Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations

@article{Gottesman1999DemonstratingTV,
  title={Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations},
  author={Daniel Gottesman and Isaac L. Chuang},
  journal={Nature},
  year={1999},
  volume={402},
  pages={390-393}
}
Algorithms such as quantum factoring and quantum search illustrate the great theoretical promise of quantum computers; but the practical implementation of such devices will require careful consideration of the minimum resource requirements, together with the development of procedures to overcome inevitable residual imperfections in physical systems. [] Key Method We show that single quantum bit (qubit) operations, Bell-basis measurements and certain entangled quantum states such as Greenberger–Horne…

Figures from this paper

Quantifying the magic of quantum channels
TLDR
A resource theory for magic quantum channels is developed to characterize and quantify the quantum "magic" or non-stabilizerness of noisy quantum circuits, and two efficiently computable magic measures for quantum channels are introduced.
Deterministic teleportation of a quantum gate between two logical qubits
TLDR
The teleportation of a controlled-NOT (CNOT) gate is experimentally demonstrated, which illustrates a compelling approach for implementing multi-qubit operations on logical qubits and indicates a promising path towards fault-tolerant quantum computation using a modular architecture.
Quantum teleportation of physical qubits into logical code spaces
TLDR
This work creates a maximally entangled state between a physical and an error-correctable logical qubit and uses it as a teleportation resource and demonstrates the teleportation of quantum information encoded on the physical qubit into the error-Corrected logical qu bit with fidelities up to 0.786.
Quantum computing with realistically noisy devices
  • E. Knill
  • Computer Science, Physics
    Nature
  • 2005
TLDR
This work reports a simple architecture for fault-tolerant quantum computing, providing evidence that accurate quantum computing is possible for EPGs as high as three per cent, and shows that non-trivial quantum computations at EPG’s of as low as one per cent could be implemented.
Teleportation-based realization of an optical quantum two-qubit entangling gate
TLDR
The smallest nontrivial module in such a scheme—a teleportation-based quantum entangling gate for two different photonic qubits is demonstrated—an important step toward the realization of practical quantum computers and could lead to many further applications in linear optics quantum information processing.
Practical experimental certification of computational quantum gates using a twirling procedure.
TLDR
This work demonstrates state-of-the-art coherent control of an ensemble of magnetic moments of nuclear spins in a single crystal solid by implementing the encoding operation for a 3-qubit code with only a 1% degradation in average fidelity discounting preparation and measurement errors.
Demonstration of an all-optical quantum controlled-NOT gate
TLDR
An unambiguous experimental demonstration and comprehensive characterization of quantum CNOT operation in an optical system that produces all four entangled Bell states as a function of only the input qubits' logical values, for a single operating condition of the gate.
Quantum supremacy in constant-time measurement-based computation: A unified architecture for sampling and verification
TLDR
This work proposes a model device made of locally-interacting multiple qubits, designed such that simultaneous single-qubit measurements on it can output probability distributions whose average-case sampling is classically intractable, under similar assumptions as the sampling of non-Interacting bosons and instantaneous quantum circuits.
Measurement-based quantum computation
Quantum computation offers a promising new kind of information processing, where the non-classical features of quantum mechanics are harnessed and exploited. A number of models of quantum computation
Quantum computing by interrogation
TLDR
Difficulties of the two-provers interactive proof and guidelines for the future research are presented as well as the new three-prover interactive proof for quantum device performing computation by doing single qubit unitary operations.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 46 REFERENCES
Quantum computing: pro and con
  • J. Preskill
  • Computer Science
    Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1998
TLDR
The potential of quantum computation is assessed, some of the known quantum algorithms and the prospects for finding new ones are reviewed, and the specifications that should be met by future hardware are commented on.
Efficient fault-tolerant quantum computing
  • A. Steane
  • Computer Science, Physics
    Nature
  • 1999
TLDR
The recovery operation is adapted to simultaneously correct errors and perform a useful measurement that drives the computation, which means that the difficulty of realizing a useful quantum computer need be only an order of magnitude larger than the logic device contained within it.
Fault-tolerant quantum computation
  • P. Shor
  • Computer Science, Physics
    Proceedings of 37th Conference on Foundations of Computer Science
  • 1996
TLDR
For any quantum computation with t gates, it is shown how to build a polynomial size quantum circuit that tolerates O(1/log/sup c/t) amounts of inaccuracy and decoherence per gate, for some constant c; the previous bound was O( 1/t).
Reliable quantum computers
  • J. Preskill
  • Physics
    Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1998
The new field of quantum error correction has developed spectacularly since its origin less than two years ago. Encoded quantum information can be protected from errors that arise due to uncontrolled
On Universal and Fault-Tolerant Quantum Computing
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis
Simple quantum computer.
  • Chuang, Yamamoto
  • Physics, Computer Science
    Physical review. A, Atomic, molecular, and optical physics
  • 1995
We propose an implementation of a quantum computer to solve Deutsch's problem, which requires exponential time on a classical computer but only linear time with quantum parallelism. By using a
The Heisenberg Representation of Quantum Computers
Since Shor`s discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest. Unfortunately, one of the key features
Elementary gates for quantum computation.
TLDR
U(2) gates are derived, which derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number of unitary operations on arbitrarily many bits.
Theory of fault-tolerant quantum computation
TLDR
It is demonstrated that fault-tolerant universal computation is possible for any stabilizer code, including the five-quantum-bit code.
Multiple-particle interference and quantum error correction
  • A. Steane
  • Physics
    Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1996
The concept of multiple-particle interference is discussed, using insights provided by the classical theory of error correcting codes. This leads to a discussion of error correction in a quantum
...
1
2
3
4
5
...