Power of One Bit of Quantum Information
- 21 December 1998
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 81 (25) , 5672-5675
- https://doi.org/10.1103/physrevlett.81.5672
Abstract
In standard quantum computation, the initial state is pure and the answer is determined by making a measurement of some of the bits in the computational basis. What can be accomplished if the initial state is a highly mixed state and the answer is determined by measuring the expectation of on the first bit with bounded sensitivity? This is the situation in high temperature ensemble quantum computation. We show that in this model it is possible to perform interesting physics simulations that have no known efficient classical algorithms, even though the model is less powerful than standard quantum computation in the presence of oracles.
Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Resilient Quantum ComputationScience, 1998
- Reliable quantum computersProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
- Quantum Complexity TheorySIAM Journal on Computing, 1997
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- Quantum Mechanics Helps in Searching for a Needle in a HaystackPhysical Review Letters, 1997
- Ensemble quantum computing by NMR spectroscopyProceedings of the National Academy of Sciences, 1997
- Bulk Spin-Resonance Quantum ComputationScience, 1997
- Квантовые вычисления: алгоритмы и исправление ошибокPublished by Steklov Mathematical Institute ,1997
- Elementary gates for quantum computationPhysical Review A, 1995
- Two-bit gates are universal for quantum computationPhysical Review A, 1995