A lattice problem in quantum NP

  title={A lattice problem in quantum NP},
  author={Dorit Aharonov and Oded Regev},
  journal={44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.},
  • D. Aharonov, O. Regev
  • Published 30 July 2003
  • Mathematics
  • 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
We consider coGapSVP/sub /spl radic/n/, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM /spl cap/ coNP but is not known to be in NP or in MA. We prove that it lies inside QMA, the quantum analogue of NP. This is the first non-trivial upper bound on the quantum complexity of a lattice problem. The proof relies on two novel ideas. First, we give a new characterization of QMA, called QMA+ formulation allows us to circumvent a problem which arises… 

Figures from this paper

The complexity of the consistency and N-representability problems for quantum states - eScholarship

Quantum mechanics has important consequences for machines that store and manipulate information. In particular, quantum computers might be more powerful than classical computers; examples of this

A full characterization of quantum advice

It is proved that given any quantum state rho on n qubits, there exists a local Hamiltonian H on poly(n) qubits (e.g., a sum of two-qubit interactions), such that any ground state of H can be used to simulate rho in quantum circuits of fixed polynomial size.

Adiabatic Quantum State Generation

The ASG paradigm is defined and demonstrated by using it to turn a variety of (classical) approximate counting algorithms into efficient quantum state generators of nontrivial quantum states, including, for example, the uniform superposition over all perfect matchings in a bipartite graph.

Quantum algorithms: A survey of some recent results

  • M. Rötteler
  • Computer Science, Physics
    Informatik - Forschung und Entwicklung
  • 2006
An overview of the known quantum algorithms and briefly describe the underlying ideas are given, which have been proved to be a prolific source of algorithms in which a polynomial speed-up as compared to classical algorithms can be achieved.

Lattice Problems in NP ∩ coNP Dorit Aharonov

We show that the problems of approximating the shortest and closest vector in a lattice to within a factor of √ n lie in NP intersect coNP. The result (almost) subsumes the three

Lattice problems in NP ∩ coNP

We show that the problems of approximating the shortest and closest vector in a lattice to within a factor of &nradic; lie in NP intersect coNP. The result (almost) subsumes the three

Zero-Knowledge for QMA from Locally Simulatable Proofs

The main technique consists in developing locally simulatable proofs for all of QMA, an encoding of a QMA witness such that it can be efficiently verified by probing only five qubits and the reduced density matrix can be computed in polynomial time and is independent of the witness.

Consistency of Local Density Matrices Is QMA-Complete

It is shown that deciding the consistency of local density matrices is QMA-complete (where QMA is the quantum analogue of NP), which gives an interesting example of a hard problem in QMA.

Merlin-Arthur Games and Stoquastic Complexity

It is proved that MA has a natural complete problem which is called the stoquastic k-SAT problem, a matrix-valued analogue of the satisfiability problem in which clauses are k-qubit projectors with non-negative matrix elements, while a satisfying assignment is a vector that belongs to the space spanned by these projectors.

Limits on the Hardness of Lattice Problems in ell _p Norms

The main technical contributions are a very general analysis of Gaussian distributions over lattices, which may be of independent interest and analytical techniques of Banaszczyk which, to the authors' knowledge, have yet to be exploited in computer science.



On the power of quantum proofs

  • R. RazAmir Shpilka
  • Computer Science
    Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.
  • 2004
We study the power of quantum proofs, or more precisely, the power of quantum Merlin-Arthur (QMA) protocols, in two well studied models of quantum computation: the black box model and the

Quantum NP - A Survey

We describe Kitaev's result from 1999, in which he defines the complexity class QMA, the quantum analog of the class NP, and shows that a natural extension of 3-SAT, namely local Hamiltonians, is QMA

New lattice-based cryptographic constructions

  • O. Regev
  • Mathematics, Computer Science
  • 2004
A new public key cryptosystem whose security guarantee is considerably stronger than previous results is provided, and a family of collision resistant hash functions with an improved security guarantee in terms of the unique shortest vector problem is proposed.

Succinct quantum proofs for properties of finite groups

  • J. Watrous
  • Mathematics, Computer Science
    Proceedings 41st Annual Symposium on Foundations of Computer Science
  • 2000
It is proved that for an arbitrary group oracle, there exist succinct (polynomial-length) quantum proofs for the Group Non-Membership problem that can be checked with small error in polynomial time on a quantum computer.

Quantum algorithms for some hidden shift problems

The hidden coset problem is defined, which generalizes the hidden shift problem and the hidden subgroup problem and provides a unified way of viewing the ability of the Fourier transform to capture subgroup and shift structure.

Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice

It is proved that and, where andγj denotes Hermite's constant, are lower bounds for polynomial time computable quantities λ1(L) andΜ(x,L), where Μ( x,L) is the Euclidean distance fromx to the closest vector inL.

On Quantum Algorithms for Noncommutative Hidden Subgroups

A quantum algorithm is presented for the special case of dihedral groups which determines the hidden subgroup in a linear number of calls to the input function.

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

  • P. Shor
  • Computer Science
    SIAM Rev.
  • 1999
Efficient randomized algorithms are given for factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems.

Hidden translation and orbit coset in quantum computing

We give efficient quantum algorithms for the problems of <sc>Hidden Translation</sc> and <sc>Hidden Subgroup</sc> in a large class of non-abelian groups including solvable groups of constant exponent

Exponential algorithmic speedup by a quantum walk

A black box graph traversal problem that can be solved exponentially faster on a quantum computer than on a classical computer is constructed and it is proved that no classical algorithm can solve the problem in subexponential time.