10,876 research outputs found
What is a quantum computer, and how do we build one?
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
Fault-tolerant quantum computation with cluster states
The one-way quantum computing model introduced by Raussendorf and Briegel
[Phys. Rev. Lett. 86 (22), 5188-5191 (2001)] shows that it is possible to
quantum compute using only a fixed entangled resource known as a cluster state,
and adaptive single-qubit measurements. This model is the basis for several
practical proposals for quantum computation, including a promising proposal for
optical quantum computation based on cluster states [M. A. Nielsen,
arXiv:quant-ph/0402005, accepted to appear in Phys. Rev. Lett.]. A significant
open question is whether such proposals are scalable in the presence of
physically realistic noise. In this paper we prove two threshold theorems which
show that scalable fault-tolerant quantum computation may be achieved in
implementations based on cluster states, provided the noise in the
implementations is below some constant threshold value. Our first threshold
theorem applies to a class of implementations in which entangling gates are
applied deterministically, but with a small amount of noise. We expect this
threshold to be applicable in a wide variety of physical systems. Our second
threshold theorem is specifically adapted to proposals such as the optical
cluster-state proposal, in which non-deterministic entangling gates are used. A
critical technical component of our proofs is two powerful theorems which
relate the properties of noisy unitary operations restricted to act on a
subspace of state space to extensions of those operations acting on the entire
state space.Comment: 31 pages, 54 figure
Internal Consistency of Fault-Tolerant Quantum Error Correction in Light of Rigorous Derivations of the Quantum Markovian Limit
We critically examine the internal consistency of a set of minimal
assumptions entering the theory of fault-tolerant quantum error correction for
Markovian noise. These assumptions are: fast gates, a constant supply of fresh
and cold ancillas, and a Markovian bath. We point out that these assumptions
may not be mutually consistent in light of rigorous formulations of the
Markovian approximation. Namely, Markovian dynamics requires either the
singular coupling limit (high temperature), or the weak coupling limit (weak
system-bath interaction). The former is incompatible with the assumption of a
constant and fresh supply of cold ancillas, while the latter is inconsistent
with fast gates. We discuss ways to resolve these inconsistencies. As part of
our discussion we derive, in the weak coupling limit, a new master equation for
a system subject to periodic driving.Comment: 19 pages. v2: Significantly expanded version. New title. Includes a
debate section in response to comments on the previous version, many of which
appeared here http://dabacon.org/pontiff/?p=959 and here
http://dabacon.org/pontiff/?p=1028. Contains a new derivation of the
Markovian master equation with periodic drivin
- …