EXACT NON-IDENTITY CHECK IS NQP-COMPLETE

DOI10.1142/S0219749910006599zbMath1201.81040arXiv0903.0675OpenAlexW1973585392MaRDI QIDQ3057846

Yu Tanaka

Publication date: 17 November 2010

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

Full work available at URL: https://arxiv.org/abs/0903.0675

zbMATH Keywords

quantum computational complexitynon-deterministic quantum polynomial-timenon-identity check

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Unnamed Item
• Quantum Computability
• "NON-IDENTITY-CHECK" IS QMA-COMPLETE

This page was built for publication: EXACT NON-IDENTITY CHECK IS NQP-COMPLETE