Title: Quantum Computation and Lattice Problems
Speaker: Oded Regev, Institute for Advanced Study, Princeton
Date: Tuesday, December 3, 2002
Location: CoRE Building, room 431, Rutgers University, Busch Campus, Piscataway, NJ
We present the first explicit connection between quantum computation and lattice problems. Namely, we show a solution to the Unique Shortest Vector Problem (SVP) under the assumption that there exists an algorithm that solves the hidden subgroup problem on the dihedral group by coset sampling. Moreover, we solve the hidden subgroup problem on the dihedral group by using an average case subset sum routine.