Project Highlights
December 2010 to November 2011 Highlights
Quantum-public-key identification protocol that is secure against a computationally unbounded adversary
The Affleck-Kennedy-Lieb-Taskai ground state of an isotropic quantum anti-ferromagnet in two dimensions is a universal resource for quantum computation
Subexponential-time quantum algorithm for constructing isogenies between elliptic curves
Quantum metropolis algorithm for simulating quantum systems
Time- and space-efficient algorithm for optimizing adaptive quantum metrology processes
Previous Highlights
Bosonic Hamiltonians problems are as hard to simulate as Fermionic Hamiltonian (QMA-hard)
Rigorous Lie-Trotter-Suzuki scheme for approximately decomposing ordered operator exponentials into a product of ordinary operator
exponentials
The general adversary lower bound is tight for every boolean function
QIP = PSPACE
Fast decoding algorithm for topological quantum error correcting codes