scientific article; zbMATH DE number 2013192

MaRDI QIDQ4436359zbMATH OpenFDO

Authors Karl Svozil

Publication date 4 December 2003

Full work available at URL https://arxiv.org/abs/hep-th/9412047

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68)

Recommendations

• Quantum theory, the Church–Turing principle and the universal quantum computer
• Universality and programmability of quantum computers
• Quantum Complexity Theory
• Computing with quanta -- impacts of quantum theory on computation.
• scientific article; zbMATH DE number 743589

Cited in

(18)

• Quantum computation based on retarded and advanced propagation.
• Quantum computation by measurement and quantum memory
• One complexity theorist's view of quantum computing
• Recursivity in Quantum Mechanics
• Universal quantum computation with shutter logic
• THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY
• Temporally unstructured quantum computation
• On the completeness of quantum computation models
• Can a Universal Quantum Computer Be Fully Quantum?
• Quantum Computation over Continuous Variables
• scientific article; zbMATH DE number 1497858 (Why is no real title available?)
• scientific article; zbMATH DE number 743589 (Why is no real title available?)
• scientific article; zbMATH DE number 1397430 (Why is no real title available?)
• Unconventional Computation
• Theory and Applications of Models of Computation
• A quantum computer only needs one universe
• Foundation for quantum computing. II
• Quantum interference computation

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 Q4436359)