Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

FOCS
2002
IEEE

favoriteEmaildiscussreport

88views Theoretical Computer Science» more FOCS 2002»

Quantum Computation and Lattice Problems

13 years 9 months ago

Quantum Computation and Lattice Problems

Download www.cs.tau.ac.il

We present the ﬁrst explicit connection between quantum computation and lattice problems. Namely, our main result is 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. Additionally, we present an approach to solving the hidden subgroup problem on the dihedral group by using an average case subset sum routine. Key words. lattices, quantum computation, shortest vector problem, hidden subgroup problem AMS subject classiﬁcations. 81P68, 68Q25, 68W25, 11H06

Oded Regev

Real-time Traffic

FOCS 2002 | Hidden Subgroup Problem | Quantum Computation | Shortest Vector Problem | Theoretical Computer Science |

claim paper

Related Content

» Making NTRU as Secure as WorstCase Problems over Ideal Lattices

» A Lattice Problem in Quantum NP

» Pseudorandom Functions and Lattices

» Machine invention of quantum computing circuits by means of genetic programming

» Adiabatic quantum state generation and statistical zero knowledge

» Coordination of quantum internet agents

» Progress in Quantum Computational Cryptography

» Training a Quantum Neural Network

» Polynomial time quantum algorithm for the computation of the unit group of a number field

Post Info
More Details (n/a)

Added	14 Jul 2010
Updated	14 Jul 2010
Type	Conference
Year	2002
Where	FOCS
Authors	Oded Regev

Comments (0)