Testing Quantum Circuits and Detecting Insecure Encryption

DOI10.1007/978-3-642-35656-8_6zbMath1451.81181arXiv1108.1052OpenAlexW1602878499MaRDI QIDQ3455199

Bill Rosgen

Publication date: 3 December 2015

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

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

Mathematics Subject Classification ID

Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum cryptography (quantum-theoretic aspects) (81P94) Quantum gates (81P65)

Related Items (1)

Generalized Quantum Arthur--Merlin Games

Cites Work

• Quantum Arthur-Merlin games
• Randomizing quantum states: constructions and applications
• Testing Non-isometry Is QMA-Complete
• Consistency of Local Density Matrices Is QMA-Complete
• Coding theorem and strong converse for quantum channels
• The Complexity of the Local Hamiltonian Problem
• "NON-IDENTITY-CHECK" IS QMA-COMPLETE

This page was built for publication: Testing Quantum Circuits and Detecting Insecure Encryption