"NON-IDENTITY-CHECK" IS QMA-COMPLETE

@inproceedings{Janzing2005NONIDENTITYCHECKIQ,
  title={"NON-IDENTITY-CHECK" IS QMA-COMPLETE},
  author={Dominik Janzing and Pawel Wocjan and Thomas Beth},
  year={2005}
}
We describe a computational problem that is complete for the complexity class QMA, a quantum generalization of NP. It arises as a natural question in quantum computing and quantum physics. "Non-identity-check" is the following decision problem: Given a classical description of a quantum circuit (a sequence of elementary gates), determine whether it is almost equivalent to the identity. Explicitly, the task is to decide whether the corresponding unitary is close to a complex multiple of the… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 15 CITATIONS

Space-efficient Simulations of Quantum Interactive Proofs.

VIEW 14 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

QMA-complete problems

  • Quantum Information & Computation
  • 2012
VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Testing Quantum Circuits and Detecting Insecure Encryption

VIEW 5 EXCERPTS
CITES RESULTS, BACKGROUND & METHODS
HIGHLY INFLUENCED

Quantum Proofs

  • Foundations and Trends in Theoretical Computer Science
  • 2016
VIEW 2 EXCERPTS
CITES METHODS & BACKGROUND

Strong equivalence of reversible circuits is coNP-complete

  • Quantum Information & Computation
  • 2013
VIEW 2 EXCERPTS
CITES BACKGROUND & METHODS

Computational distinguishability of degradable and antidegradable channels

  • Quantum Information & Computation
  • 2009
VIEW 1 EXCERPT
CITES BACKGROUND