Can a Universal Quantum Computer Be Fully Quantum?
From MaRDI portal
Publication:4492466
DOI10.1103/PhysRevLett.78.1823zbMath0944.81007MaRDI QIDQ4492466
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
81P68: Quantum computation
Related Items
Remarks on universal quantum computer, A prototype of quantum von Neumann architecture, Quantum Kolmogorov complexity and information-disturbance theorem, Machine semantics, Quantum circuit oracles for abstract machine computations, Unsolvability of the halting problem in quantum dynamics, Quantum random access stored-program machines, Zeno machines and hypercomputation, Can a Quantum Computer Run the von Neumann Architecture?, On Halting Process of Quantum Turing Machine, THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY, IRREVERSIBILITY IN THE HALTING PROBLEM OF QUANTUM COMPUTER
Cites Work