Simple quantum computer.

  title={Simple quantum computer.},
  author={Chuang and Yamamoto},
  journal={Physical review. A, Atomic, molecular, and optical physics},
  volume={52 5},
  • ChuangYamamoto
  • Published 22 May 1995
  • Physics, Computer Science
  • Physical review. A, Atomic, molecular, and optical physics
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 dual-rail quantum-bit representation as a simple form of error correction, our machine can tolerate some amount of decoherence and still give the correct result with high probability. The design that we employ also demonstrates a signature for quantum parallelism which unambiguously distinguishes the… 

Tables from this paper

Quantum Computation and Shor's Factoring Algorithm

The authors give an exposition of Shor's algorithm together with an introduction to quantum computation and complexity theory, and discuss experiments that may contribute to its practical implementation.

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

It is shown that single quantum bit operations, Bell-basis measurements and certain entangled quantum states such as Greenberger–Horne–Zeilinger (GHZ) states are sufficient to construct a universal quantum computer.


We describe a solid state implementation of a quantum computer using ballistic single electrons as flying qubits in 1D nanowires. We show how to implement all the steps required for universal quantum

Efficient classical simulation of optical quantum information circuits.

This simulatability result places powerful constraints on the capability to realize exponential quantum speedups as well as on inducing an optical nonlinear transformation via linear optics, photodetection-based measurement, and classical feedforward of measurement results, optimal cloning, and a wide range of other processes.

Quantum Teleportation is a Universal Computational Primitive

We present a method to create a variety of interesting gates by teleporting quantum bits through special entangled states. This allows, for instance, the construction of a quantum computer based on

Prospects on Planar Quantum Computing

High-fidelity planar quantum circuits have been recently experimentally demonstrated, enabling a new generation of quantum computing, based on reliable, monolithically integrated planar optical

Experimental realization of the one qubit Deutsch-Jozsa algorithm in a quantum dot

We perform quantum interference experiments on a single self-assembled semiconductor quantum dot. The presence or absence of a single exciton in the dot provides a qubit that we control with

Quantum Computers, Factoring, and Decoherence

Here it is shown how the decoherence process degrades the interference pattern that emerges from the quantum factoring algorithm, a problem of practical significance for cryptographic applications.

Photonic Realization of a Quantum Finite Automaton

A physical implementation of a quantum finite automaton recognizing a well known family of periodic languages and exploiting the polarization degree of freedom of single photons and their manipulation through linear optical elements is described.

Investigating Photonic Quantum Computation

The use of photons as qubits is a promising implementation for quantum computation. The inability of photons to interact, especially with the environment, makes them an ideal physical candidate.



in Proc

  • 35 Annual Symposium on Foundations of Computer Science
  • 1994


  • Rev. Lett. 58, 1792
  • 1987


  • Rev. Lett. 72, 210
  • 1994


  • Rev. Lett. 67, 1852
  • 1991


  • R. Soc. Lond. A 400, 97
  • 1985


  • Rev. A 42, 1699
  • 1990

Workshop on Quantum Computing and Communication

  • Gaithersburg, MD, August 18-19
  • 1994

in Proc

  • 3rd Asia-Pacific Phys. Conf. (World Scientific, Singapore, 1988); G. J. Milburn, Phys. Rev. Lett. 62, 2124 (1989); I. Chuang, unpublished
  • 1993


  • Rev. A 32, 3266
  • 1985


  • R. Soc. Lond. A 425, 73
  • 1989