What is a quantum computer, and how do we build one?
arXiv:0906.4344 · doi:10.1103/PhysRevA.83.012303
Abstract
The DiVincenzo criteria for implementing a quantum computer have been seminal in focussing both experimental and theoretical research in quantum information processing. These criteria were formulated specifically for the circuit model of quantum computing. However, several new models for quantum computing (paradigms) have been proposed that do not seem to fit the criteria well. The question is therefore what are the general criteria for implementing quantum computers. To this end, a formal operational definition of a quantum computer is introduced. It is then shown that according to this definition a device is a quantum computer if it obeys the following four criteria: Any quantum computer must (1) have a quantum memory; (2) facilitate a controlled quantum evolution of the quantum memory; (3) include a method for cooling the quantum memory; and (4) provide a readout mechanism for subsets of the quantum memory. The criteria are met when the device is scalable and operates fault-tolerantly. We discuss various existing quantum computing paradigms, and how they fit within this framework. Finally, we lay out a roadmap for selecting an avenue towards building a quantum computer. This is summarized in a decision tree intended to help experimentalists determine the most natural paradigm given a particular physical implementation.
References in corpus (68)
- Quantum Computation with Quantum Dots
- Elementary gates for quantum computation
- Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
- Review article: Linear optical quantum computing
- Quantum state engineering with Josephson-junction devices
- Efficient classical simulation of slightly entangled quantum computations
- The Physical Implementation of Quantum Computation
- Persistent entanglement in arrays of interacting particles
- Quantum Teleportation is a Universal Computational Primitive
- Measurement-based quantum computation with cluster states
- Quantum Algorithms Revisited
- Multiple Particle Interference and Quantum Error Correction
- NMR Techniques for Quantum Control and Computation
- Quantum Computing with Very Noisy Devices
- Quantum computation over continuous variables
- Quantum computation with ions in thermal motion
- Two-Bit Gates are Universal for Quantum Computation
- Multi-party entanglement in graph states
- Reliable Quantum Computers
- Conditional Quantum Dynamics and Logic Gates
- A Theory of Fault-Tolerant Quantum Computation
- Universal Quantum Computation with Continuous-Variable Cluster States
- Reference frames, superselection rules, and quantum information
- Fault-tolerant quantum computation with high threshold in two dimensions
- Resource-efficient linear optical quantum computation
- Stabilizer Codes and Quantum Error Correction
- On the role of entanglement in quantum computational speed-up
- Josephson-Junction Qubits with Controlled Couplings
- Topological fault-tolerance in cluster state quantum computation
- Quantum Search by Local Adiabatic Evolution
- Efficient high-fidelity quantum computation using matter qubits and linear optics
- Quantum computers can search rapidly by using almost any transformation
- Optical quantum computation using cluster states
- Maintaining coherence in Quantum Computers
- Separability of very noisy mixed states and implications for NMR quantum computing
- Quantum Manipulations of Small Josephson Junctions
- A fault-tolerant one-way quantum computer
- Overhead and noise threshold of fault-tolerant quantum error correction
- Active stabilisation, quantum computation and quantum state synthesis
- Adiabatic quantum computation with Cooper pairs
- Quantum Computing with an 'Always On' Heisenberg Interaction
- Quantum computation based on d-level cluster states
- Fault-tolerant quantum computation with cluster states
- Error correcting codes for adiabatic quantum computation
- Repeat-Until-Success quantum computing using stationary and flying qubits
- Towards Fault Tolerant Adiabatic Quantum Computation
- Quantum computing with neutral atoms
- Brokered Graph State Quantum Computing
- Fault-tolerant quantum computation
- Globally controlled quantum wires for perfect qubit transport, mirroring and computing
- Grover's Quantum Search Algorithm for an Arbitrary Initial Amplitude Distribution
- Local Fault-tolerant Quantum Computation
- Nested quantum search and NP-complete problems
- Measurement based entanglement under conditions of extreme photon loss
- Analysis of Generalized Grover's Quantum Search Algorithms Using Recursion Equations
- Potential and limits to cluster state quantum computing using probabilistic gates
- Quantum Computing in Arrays Coupled by 'Always On' Interactions
- Local Unitary Quantum Cellular Automata
- Single spin measurement using cellular automata techniques
- Reversible universal quantum computation within translation invariant systems
- Robust adiabatic approach to optical spin entangling in coupled quantum dots
- Optical Quantum Computation with Perpetually Coupled Spins
- Multi-Qubit Gates in Arrays Coupled by 'Always On' Interactions
- Quantum error correction in globally controlled arrays
- Decoherence-based exploration of d-dimensional one-way quantum computation
- Deriving a Fault-Tolerant Threshold for a Global Control Scheme
- Error Correcting the Control Unit in Global Control Schemes
- Globally controlled fault tolerant quantum computation
Cited by in corpus (6)
- Three-electron spin qubits
- The Quantum Socket: Three-Dimensional Wiring for Extensible Quantum Computing
- Localized quantum walks as secured quantum memory
- Autler-Townes Doublet observation via a Cooper-Pair Beam Splitter
- Reduced conditional dynamic of quantum system under indirect quantum measurement
- The Photodetection Process under the Conditions of an Imperfect Measurement Device