Can a Universal Quantum Computer Be Fully Quantum?

DOI10.1103/PhysRevLett.78.1823zbMath0944.81007OpenAlexW1983800310MaRDI QIDQ4492466

John M. Myers

Publication date: 16 July 2000

Published in: Physical Review Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1103/physrevlett.78.1823

zbMATH Keywords

universal quantum computerhalt qubit

Mathematics Subject Classification ID

Related Items (12)

A prototype of quantum von Neumann architecture ⋮ THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY ⋮ Quantum Kolmogorov complexity and information-disturbance theorem ⋮ Can a Quantum Computer Run the von Neumann Architecture? ⋮ Machine semantics ⋮ Quantum circuit oracles for abstract machine computations ⋮ Zeno machines and hypercomputation ⋮ Remarks on universal quantum computer ⋮ On Halting Process of Quantum Turing Machine ⋮ IRREVERSIBILITY IN THE HALTING PROBLEM OF QUANTUM COMPUTER ⋮ Unsolvability of the halting problem in quantum dynamics ⋮ Quantum random access stored-program machines

Cites Work

• Quantum computational networks
• Quantum theory, the Church–Turing principle and the universal quantum computer

This page was built for publication: Can a Universal Quantum Computer Be Fully Quantum?