Simple quantum computer.

  title={Simple quantum computer.},
  author={Chuang and Yamamoto},
  journal={Physical review. A, Atomic, molecular, and optical physics},
  volume={52 5},
  • Chuang, Yamamoto
  • Published 1995
  • Physics, Medicine
  • 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… Expand

Topics from this paper

New Trends in Quantum Computing
Although some of these ideas are still beyond the grasp of current technology, quantum cryptography has been implemented and the prospects are encouraging for small-scale prototypes of quantum computation devices before the end of the millennium. Expand
Quantum Computation with Linear Optics
A constructive method to translate small quantum circuits into their optical analogues, using linear components of present-day quantum optics technology only, and can thus be used to test the performance of quantum algorithms. Expand
Quantum Computation and Shor's Factoring Algorithm
Current technology is beginning to allow us to manipulate rather than just observe individual quantum phenomena. This opens up the possibility of exploiting quantum effects to perform computationsExpand
Efficient Simulation of Quantum Systems by Quantum Computers
It is shown that the time evolution of the wave function of a quantum mechanical many particle system can be implemented very efficiently on a quantum computer and ultimately the simulation of quantum field theory might be possible on large quantum computers. Expand
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 quantumExpand
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. Expand
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. Expand
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 opticalExpand
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 withExpand
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. Expand