Quantum Computation and Lattice Problems
نویسنده
چکیده
We present the first 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.
منابع مشابه
External and Internal Incompressible Viscous Flows Computation using Taylor Series Expansion and Least Square based Lattice Boltzmann Method
The lattice Boltzmann method (LBM) has recently become an alternative and promising computational fluid dynamics approach for simulating complex fluid flows. Despite its enormous success in many practical applications, the standard LBM is restricted to the lattice uniformity in the physical space. This is the main drawback of the standard LBM for flow problems with complex geometry. Several app...
متن کاملFrom the Shortest Vector Problem to the Dihedral Hidden Subgroup Problem
In Quantum Computation and Lattice Problems [11] Oded Regev presented the first known connection between lattices and quantum computation, in the form of a quantum reduction from the poly(n)-unique shortest vector problem to the dihedral hidden subgroup problem by sampling cosets. This article contains a summary of Regev’s result.
متن کاملLattice-Plasmon Quantum Features
in this work, some of the lattice plasmon quantum features are examined. Initially, the interaction of the far-field photonic mode and the nanoparticle plasmon mode is investigated. We probe the optical properties of the array plasmon that are dramatically affected by the array geometry. It is notable to mention that the original goal of this work is to examine the quantum feature of the array ...
متن کاملSpace-efficient classical and quantum algorithms for the shortest vector problem
A lattice is the integer span of some linearly independent vectors. Lattice problems have many significant applications in coding theory and cryptographic systems for their conjectured hardness. The Shortest Vector Problem (SVP), which is to find the shortest non-zero vector in a lattice, is one of the well-known problems that are believed to be hard to solve, even with a quantum computer. In t...
متن کاملPropagation of Correlations in Quantum Lattice Systems
Recently, there has been increasing interest in understanding correlations in quantum lattice systems prompted by applications in quantum information theory and computation [10, 3, 2, 4] and the study of complex networks [5]. The questions that arise in the context of quantum information and computation are sufficiently close to typical problems in statistical mechanics that the methods develop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 33 شماره
صفحات -
تاریخ انتشار 2002