10,035 research outputs found
Quantum Error Correction via Convex Optimization
We show that the problem of designing a quantum information error correcting
procedure can be cast as a bi-convex optimization problem, iterating between
encoding and recovery, each being a semidefinite program. For a given encoding
operator the problem is convex in the recovery operator. For a given method of
recovery, the problem is convex in the encoding scheme. This allows us to
derive new codes that are locally optimal. We present examples of such codes
that can handle errors which are too strong for codes derived by analogy to
classical error correction techniques.Comment: 16 page
Fault-tolerant error correction with the gauge color code
The constituent parts of a quantum computer are inherently vulnerable to
errors. To this end we have developed quantum error-correcting codes to protect
quantum information from noise. However, discovering codes that are capable of
a universal set of computational operations with the minimal cost in quantum
resources remains an important and ongoing challenge. One proposal of
significant recent interest is the gauge color code. Notably, this code may
offer a reduced resource cost over other well-studied fault-tolerant
architectures using a new method, known as gauge fixing, for performing the
non-Clifford logical operations that are essential for universal quantum
computation. Here we examine the gauge color code when it is subject to noise.
Specifically we make use of single-shot error correction to develop a simple
decoding algorithm for the gauge color code, and we numerically analyse its
performance. Remarkably, we find threshold error rates comparable to those of
other leading proposals. Our results thus provide encouraging preliminary data
of a comparative study between the gauge color code and other promising
computational architectures.Comment: v1 - 5+4 pages, 11 figures, comments welcome; v2 - minor revisions,
new supplemental including a discussion on correlated errors and details on
threshold calculations; v3 - Author accepted manuscript. Accepted on
21/06/16. Deposited on 29/07/16. 9+5 pages, 17 figures, new version includes
resource scaling analysis in below threshold regime, see eqn. (4) and methods
sectio
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
- …