scientific article; zbMATH DE number 5049912

MaRDI QIDQ5482449zbMATH OpenFDO

Authors Stefan Heinrich

Publication date 28 August 2006

zbMATH Keywords

quantum computerquantum model of computation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Recommendations

• Quantum computational number theory
• scientific article; zbMATH DE number 1796836
• scientific article; zbMATH DE number 1555956
• Quantum computation and NP-complete problems
• Quantum Complexity Theory
• Complexity considerations quantum computation
• Qubit complexity of continuous problems
• Computational complexity and applications of quantum algorithm
• On quantum complexity
• Computational complexity of the quantum separability problem

Cited in

(8)

• ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING
• Numerical Recipes in Quantum Information Theory and Quantum Computing
• The quantum query complexity of elliptic PDE
• scientific article; zbMATH DE number 1530002 (Why is no real title available?)
• What can quantum computers do?
• scientific article; zbMATH DE number 1189115 (Why is no real title available?)
• scientific article; zbMATH DE number 2156284 (Why is no real title available?)
• Large-Scale Scientific Computing

This page was built for publication:

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