"NON-IDENTITY-CHECK" IS QMA-COMPLETE

DOI10.1142/S0219749905001067zbMath1077.81024arXivquant-ph/0305050MaRDI QIDQ5704257

Thomas Beth, Dominik Janzing, Paweł Wocjan

Publication date: 14 November 2005

Published in: International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0305050

zbMATH Keywords

Quantum complexity theory

Mathematics Subject Classification ID

Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Testing Quantum Circuits and Detecting Insecure Encryption ⋮ EXACT NON-IDENTITY CHECK IS NQP-COMPLETE

Cites Work

• Quantum algorithms revisited
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Error Correcting Codes in Quantum Theory

This page was built for publication: "NON-IDENTITY-CHECK" IS QMA-COMPLETE