673 research outputs found
Numerical simulation of information recovery in quantum computers
Decoherence is the main problem to be solved before quantum computers can be
built. To control decoherence, it is possible to use error correction methods,
but these methods are themselves noisy quantum computation processes. In this
work we study the ability of Steane's and Shor's fault-tolerant recovering
methods, as well a modification of Steane's ancilla network, to correct errors
in qubits. We test a way to measure correctly ancilla's fidelity for these
methods, and state the possibility of carrying out an effective error
correction through a noisy quantum channel, even using noisy error correction
methods.Comment: 38 pages, Figures included. Accepted in Phys. Rev. A, 200
Local Fault-tolerant Quantum Computation
We analyze and study the effects of locality on the fault-tolerance threshold
for quantum computation. We analytically estimate how the threshold will depend
on a scale parameter r which estimates the scale-up in the size of the circuit
due to encoding. We carry out a detailed semi-numerical threshold analysis for
concatenated coding using the 7-qubit CSS code in the local and `nonlocal'
setting. First, we find that the threshold in the local model for the [[7,1,3]]
code has a 1/r dependence, which is in correspondence with our analytical
estimate. Second, the threshold, beyond the 1/r dependence, does not depend too
strongly on the noise levels for transporting qubits. Beyond these results, we
find that it is important to look at more than one level of concatenation in
order to estimate the threshold and that it may be beneficial in certain
places, like in the transportation of qubits, to do error correction only
infrequently.Comment: REVTeX, 44 pages, 19 figures, to appear in Physical Review
Active stabilisation, quantum computation and quantum state synthesis
Active stabilisation of a quantum system is the active suppression of noise
(such as decoherence) in the system, without disrupting its unitary evolution.
Quantum error correction suggests the possibility of achieving this, but only
if the recovery network can suppress more noise than it introduces. A general
method of constructing such networks is proposed, which gives a substantial
improvement over previous fault tolerant designs. The construction permits
quantum error correction to be understood as essentially quantum state
synthesis. An approximate analysis implies that algorithms involving very many
computational steps on a quantum computer can thus be made possible.Comment: 8 pages LaTeX plus 4 figures. Submitted to Phys. Rev. Let
Pulsed force sequences for fast phase-insensitive quantum gates in trapped ions
We show how to create quantum gates of arbitrary speed between trapped ions,
using a laser walking wave, with complete insensitivity to drift of the optical
phase, and requiring cooling only to the Lamb-Dicke regime. We present pulse
sequences that satisfy the requirements and are easy to produce in the
laboratory.Comment: 11 pages, 3 figure
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 just single qubit operations, Bell
measurements, and GHZ states. We also present straightforward constructions of
a wide variety of fault-tolerant quantum gates.Comment: 6 pages, REVTeX, 6 epsf figure
Holonomic quantum computation in decoherence-free subspaces
We show how to realize, by means of non-abelian quantum holonomies, a set of
universal quantum gates acting on decoherence-free subspaces and subsystems. In
this manner we bring together the quantum coherence stabilization virtues of
decoherence-free subspaces and the fault-tolerance of all-geometric holonomic
control. We discuss the implementation of this scheme in the context of quantum
information processing using trapped ions and quantum dots.Comment: 4 pages, no figures. v2: minor changes. To appear in PR
Simple Quantum Error Correcting Codes
Methods of finding good quantum error correcting codes are discussed, and
many example codes are presented. The recipe C_2^{\perp} \subseteq C_1, where
C_1 and C_2 are classical codes, is used to obtain codes for up to 16
information qubits with correction of small numbers of errors. The results are
tabulated. More efficient codes are obtained by allowing C_1 to have reduced
distance, and introducing sign changes among the code words in a systematic
manner. This systematic approach leads to single-error correcting codes for 3,
4 and 5 information qubits with block lengths of 8, 10 and 11 qubits
respectively.Comment: Submitted to Phys. Rev. A. in May 1996. 21 pages, no figures. Further
information at http://eve.physics.ox.ac.uk/ASGhome.htm
Superfast Cooling
Currently laser cooling schemes are fundamentally based on the weak coupling
regime. This requirement sets the trap frequency as an upper bound to the
cooling rate. In this work we present a numerical study that shows the
feasibility of cooling in the strong coupling regime which then allows cooling
rates that are faster than the trap frequency with state of the art
experimental parameters. The scheme we present can work for trapped atoms or
ions as well as mechanical oscillators. It can also cool medium size ions
chains close to the ground state.Comment: 5 pages 4 figure
A Theory of Fault-Tolerant Quantum Computation
In order to use quantum error-correcting codes to actually improve the
performance of a quantum computer, it is necessary to be able to perform
operations fault-tolerantly on encoded states. I present a general theory of
fault-tolerant operations based on symmetries of the code stabilizer. This
allows a straightforward determination of which operations can be performed
fault-tolerantly on a given code. I demonstrate that fault-tolerant universal
computation is possible for any stabilizer code. I discuss a number of examples
in more detail, including the five-qubit code.Comment: 30 pages, REVTeX, universal swapping operation added to allow
universal computation on any stabilizer cod
- …