Complexity considerations quantum computation

DOI10.1142/9789814460026_0001MaRDI QIDQ3451769zbMATH OpenOpenAlexFDO

Authors L. Accardi

Publication date 18 November 2015

Published in Quantum Bio-Informatics V (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2108/82889

Mathematics Subject Classification ID

Factorization; primality (11A51) Factorization (11Y05) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• On the Power of Quantum Computation
• ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING
• scientific article; zbMATH DE number 1464668
• Strengths and Weaknesses of Quantum Computing
• scientific article; zbMATH DE number 1072528

Cited in

(5)

• One complexity theorist's view of quantum computing
• Computational Depth Complexity of Measurement-Based Quantum Computation
• Computational complexity and applications of quantum algorithm
• scientific article; zbMATH DE number 5049912 (Why is no real title available?)
• Theory and Applications of Models of Computation

This page was built for publication: Complexity considerations quantum computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3451769)