| |
|
| | |
|
![[photo of a speaker] (c) D.Nagaj](img/photos/speaker.jpg)
other seminars:
|
:: Fri 9/27/13, 1:30 PM in 6C-442 Joseph Traub (Columbia University (on sabbatical at Harvard)) We introduce the notion of strong quantum speedup. To compute this speedup one must know the classical computational complexity. What is it about the problems of quantum physics and quantum chemistry that enable us to get lower bounds on the classical complexity? :: Thu 10/17/13, 3:00 PM in E17-133 Juerg Froehlich (ETH Zurich) After a brief general introduction to the subject of quantum probability theory, quantum dynamical systems are introduced and some of their probabilistic features are described. On the basis of a few general principles - "duality between observables and indeterminates", "loss of information" and "entanglement generation" - a quantum theory of experiments and measurements is developed, and the "theory of von Neumann measurements" is outlined. Finally, a theory of non-demolition measurements is sketched, and, as an application of the Martingale Convergence Theorem, it is shown how facts emerge in non-demolition measurements. :: Thu 10/17/13, 4:00 PM in 10-250 Matthias Troyer (ETH Zurich) About a century after the development of quantum mechanics we have now reached an exciting time where non-trivial devices that make use of quantum effects can be built. While a universal quantum computer of non-trivial size is still out of reach there are a number commercial and experimental devices: quantum random number generators, quantum encryption systems, and analog quantum simulators. In this colloquium I will present some of these devices and validation tests we performed on them. Quantum random number generators use the inherent randomness in quantum measurements to produce true random numbers, unlike classical pseudorandom number generators which are inherently deterministic. Optical lattice emulators use ultracold atomic gases in optical lattices to mimic typical models of condensed matter physics. Finally, I will discuss the devices built by Canadian company D-Wave systems, which are special purpose quantum simulators for solving hard classical optimization problems. :: Fri 10/18/13, 1:30 PM in 6C-442 Sean Hallgren (Penn State (visiting MIT)) Computing the unit group of a number field is one of the main problems in computational algebraic number theory. Polynomial time algorithms for problems for arbitrary degree number fields should be polynomial time in both the degree and log of the discriminant. The best classical algorithms for computing the unit group takes time exponential in both parameters. There is a quantum algorithm that runs in time polynomial in log the discriminant but exponential in the degree. We give a quantum algorithm that is polynomial in both parameters of the number field. The proof works via a reduction to a continuous Hidden Subgroup Problem. :: Fri 4/11/14, 1:30 PM in 6C-442 Keith Lee (Perimeter Institute) TBA :: Fri 4/18/14, 1:30 PM in 6C-442 Stephanie Wehner (National University of Singapore) TBA :: Fri 4/25/14, 1:30 in 6C-442 Isaac Kim (Perimeter Institute) TBA Sergei Bravyi (tentative) (IBM) TBA :: Fri 5/9/14, 1:30 PM in 6C-442 Andris Ambainis (University of Latvia) TBA :: Fri 5/16/14, 1:30 PM in 6C-442 Robin Kothari (University of Waterloo) We provide a quantum algorithm for simulating the dynamics of sparse Hamiltonians with complexity sublogarithmic in the inverse error, an exponential improvement over previous methods. Unlike previous approaches based on product formulas, the query complexity is independent of the number of qubits acted on, and for time-varying Hamiltonians, the gate complexity is logarithmic in the norm of the derivative of the Hamiltonian. Our algorithm is based on a significantly improved simulation of the continuous- and fractional-query models using discrete quantum queries, showing that the former models are not much more powerful than the discrete model even for very small error. We also significantly simplify the analysis of this conversion, avoiding the need for a complex fault correction procedure. Our simplification relies on a new form of "oblivious amplitude amplification" that can be applied even though the reflection about the input state is unavailable. Finally, we prove new lower bounds showing that our algorithms are optimal as a function of the error. This is joint work with Dominic W. Berry, Andrew M. Childs, Richard Cleve, and Rolando D. Somma. Available at http://arxiv.org/abs/1312.1414 :: Fri 5/23/14, 1:30 PM in 6C-442 Robin Blume-Kohout (tentative) (Sandia National Labs) TBA |
| |
 |  |
