Physical Review Letters · 2014 · 103 citations · 17 references
ComputingComputer SciencePhysicsQuantum ComputingQuantum MechanicsTheory Of ComputationQuantum AlgorithmsQuantum BitsQuantum ComputationQuantum SimulationQuantum StatesPolynomial HierarchyQubit States
Deterministic quantum computation with one quantum bit (DQC1) [E. Knill and R. Laflamme, Phys. Rev. Lett. 81, 5672 (1998)] is a model of quantum computing where the input is restricted to containing a single qubit in a pure state and has all other qubits in a completely mixed state. Only the single pure qubit is measured at the end of the computation. While it is known that DQC1 can efficiently solve several problems for which no known classical efficient algorithms exist, the question of whether DQC1 is really more powerful than classical computation remains open. In this Letter, we introduce a slightly modified version of DQC1, which we call DQC1(k), where k output qubits are measured, and show that DQC1(k) cannot be classically efficiently simulated for any k≥3 unless the polynomial hierarchy collapses at the third level.
17
A scheme for efficient quantum computation with linear optics
E. Knill, Raymond Laflamme, G. J. Milburn · Nature · 2001 · 5.9K citations
Robert Raussendorf, Hans J. Briegel · Physical Review Letters · 2001 · 4.5K citations
Elementary gates for quantum computation
Adriano Barenco, Charles H. Bennett, Richard Cleve et al. · Physical Review A · 1995 · 4.4K citations · Full text
Quantum Discord and the Power of One Qubit
Animesh Datta, Anil Shaji, Carlton M. Caves · Physical Review Letters · 2008 · 1.3K citations · Full text