Quantum Nondemolition Monitoring of Universal Quantum Computers
arXiv:quant-ph/9704028 · doi:10.1103/PhysRevLett.80.631
Abstract
The halt scheme for quantum Turing machines, originally proposed by Deutsch, is reformulated precisely and is proved to work without spoiling the computation. The ``conflict'' pointed out recently by Myers in the definition of a universal quantum computer is shown to be only apparent. In the context of quantum nondemolition (QND) measurement, it is also shown that the output observable, an observable representing the output of the computation, is a QND observable and that the halt scheme is equivalent to the QND monitoring of the output observable.
5 pages, RevTeX, no figures, revised, to appear in Phys. Rev. Lett
Cited by in corpus (19)
- Evading quantum mechanics
- Remarks on Universal Quantum Computer
- On Halting Process of Quantum Turing Machine
- A comparative study of universal quantum computing models: towards a physical unification
- A prototype of quantum von Neumann architecture
- Quantum Kolmogorov Complexity and the Quantum Turing Machine
- Quantum Random Access Stored-Program Machines
- Algorithmic Information Theoretic Issues in Quantum Mechanics
- Quantum Kolmogorov Complexity and Quantum Key Distribution
- Quantum Turing Machines Computations and Measurements
- Quantum Kolmogorov Complexity and Information-Disturbance Theorem
- Halting in quantum Turing computation
- Unsolvability of the Halting Problem in Quantum Dynamics
- Quantum Kolmogorov Complexity and Bounded Quantum Memory
- Quantum Iterative Deepening with an application to the Halting problem
- Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs
- Irreversibility in the Halting Problem of Quantum Computer
- A local model of quantum Turing machines
- On Quantum Turing Machine Halting Deterministically