Security in the Quantum Future
Quantum theory is quickly becoming quantum technology.
The Quantum Innovators in science and engineering workshop brings together the most promising young researchers in quantum physics and engineering. Guests are invited for a four-day conference aimed at exploring the frontier of our field.
Maureen Joel Lagos
Department of Materials Science and Engineering
Canadian Centre for Electron Microscopy
McMaster University, Ontario, Canada
Wednesday, October 2, 2019
2:30 p.m.
C2-361 (Reading Room)
Abstract:
The Quantum Innovators in Computer Science and Mathematics workshop brings together promising researchers working on theoretical aspects of quantum information and computation in computer science and mathematics.
Talks are open for anyone to attend.
The one-day workshop is the third in a series that brings together researchers at Institut de Recherche en Informatique Fondamentale (IRIF), Université Paris-Diderot and the Institute for Quantum Computing, University of Waterloo. It will feature a full day of talks on recent progress in quantum algorithms and complexity theory, and related areas, made by members of the two institutions, with the idea to foster collaboration.
The goal of the IQC Workshop on Quantum Illumination is to bring together a wide range of participants from these various domains to discuss the state of the art in laboratory research, the range of possible applications, and paths toward those applications.
Since its conception a decade ago, interest in Quantum Illumination, a form of long-range quantum sensing, has grown steadily. Motivated by applications in defence, quantum communications and other areas, interest has now spread from academia to industry and government. The goal of the IQC Workshop on Quantum Illumination is to bring together a wide range of participants from these various domains to discuss the state of the art in laboratory research, the range of possible applications, and paths toward those applications.
Nigar Sultana
Approximate counting -- given a black-box function f:[N]->{0,1}, multiplicatively estimate the number of x's such that f(x)=1 -- is one of the most basic problems in quantum algorithms. In 1998, Brassard, Hoyer, Mosca, and Tapp (BHMT) gave a fully quadratic quantum speedup for the problem, while Nayak and Wu showed that this speedup was optimal. What else is there to say?
Variational quantum algorithms such as VQE or QAOA aim to simulate low-energy properties of quantum many-body systems or find approximate solutions of combinatorial optimization problems. Such algorithms employ variational states generated by low-depth quantum circuits to minimize the expected value of a quantum or classical Hamiltonian.