Testing Non-isometry Is QMA-Complete

DOI10.1007/978-3-642-18073-6_6zbMath1309.68077arXiv0910.3740OpenAlexW1631902221MaRDI QIDQ3070977

Bill Rosgen

Publication date: 28 January 2011

Published in: Theory of Quantum Computation, Communication, and Cryptography (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Testing Quantum Circuits and Detecting Insecure Encryption

This page was built for publication: Testing Non-isometry Is QMA-Complete