James Wootton, University of Leeds
Abstract to be announced.
Thomas Vidick, University of California, Berkeley
Osama Moussa, Institute for Quantum Computing
Abstract to be announced.
Olaf Benningshof, Universiteit Leiden
David Cory, Institute for Quantum Computing
In RAC II at the Institute for Quantum Computing we are setting up a laboratory of test-beds for quantum information processing. I will describe the range of test-beds, what each offers for the development of quantum processors and where we are on the path towards a non-trivial quantum processor.
Christophe Couteau, L’Université de technologie de Troyes
Jacob Biamonte, Oxford University
Andrew Childs, Institute for Quantum Computing
Mark Wilde, McGill University
Thomas Jennewein, IQC
Yutaka Shikano, Tokyo Institute of Technology & Paul Skrzypczyk, University of Bristol
Robert Raussendorf, University of British Columbia
Given two elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit an isogeny (a.k.a. algebraic map) between them, but finding such an isogeny is believed to be computationally difficult. The fastest known classical algorithm for this problem requires exponential time, and prior to our work no faster quantum algorithm was known. We show that this problem can be solved in subexponential time on a quantum computer, assuming the
IQC/QuantumWorks Joint Seminar Eric Luvisotto and Scott Inwood, Waterloo Commercialization Office (”WatCo”)
Patrick Hayden, McGill
Mike Thewalt, Simon Fraser University
Kristan Temme and Maris Ozols will be speaking at this Physics lunch seminar.
Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. A natural generalization of constraint satisfaction problems to the quantum setting is the local Hamiltonian problem, which is of significant interest to both complexity theorists and to physicists studying properties of physical systems alike. In this talk, we define a natural approximation version of the local Hamiltonian problem and initiate its study. We present two main results.
Mike Geller, University of Georgia
Seth Lloyd, Massachusetts Institute of Technology
Falk Unger, University of California, Berkeley
Todd Pittman, University of Maryland, Baltimore County
Britton Plourde, Syracuse University
Nathan Wiebe, University of Calgary
We introduce an efficient quantum algorithm for simulating time-dependent Hamiltonian quantum dynamics on a quantum computer and accounts fully for all computational resources, especially the per-qubit oracle query cost, which has been previously regarded as constant cost per query regardless of the number of qubits accessed.
Adrian Lupascu, Institute for Quantum Computing
Quantum superconducting circuits are nanostructured superconducting electrical networks with Josephson junctions. At low temperatures, their quantum dynamics is properly described by using a few degrees of freedom with a collective character. The parameters in the Hamiltonian depend on the dimensions and topology of the circuit; superconducting quantum circuits therefore behave as artificial atoms.