5,216 research outputs found
Combining Topological Hardware and Topological Software: Color Code Quantum Computing with Topological Superconductor Networks
We present a scalable architecture for fault-tolerant topological quantum
computation using networks of voltage-controlled Majorana Cooper pair boxes,
and topological color codes for error correction. Color codes have a set of
transversal gates which coincides with the set of topologically protected gates
in Majorana-based systems, namely the Clifford gates. In this way, we establish
color codes as providing a natural setting in which advantages offered by
topological hardware can be combined with those arising from topological
error-correcting software for full-fledged fault-tolerant quantum computing. We
provide a complete description of our architecture including the underlying
physical ingredients. We start by showing that in topological superconductor
networks, hexagonal cells can be employed to serve as physical qubits for
universal quantum computation, and present protocols for realizing
topologically protected Clifford gates. These hexagonal cell qubits allow for a
direct implementation of open-boundary color codes with ancilla-free syndrome
readout and logical -gates via magic state distillation. For concreteness,
we describe how the necessary operations can be implemented using networks of
Majorana Cooper pair boxes, and give a feasibility estimate for error
correction in this architecture. Our approach is motivated by nanowire-based
networks of topological superconductors, but could also be realized in
alternative settings such as quantum Hall-superconductor hybrids.Comment: 24 pages, 24 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
Design of nanophotonic circuits for autonomous subsystem quantum error correction
We reapply our approach to designing nanophotonic quantum memories to
formulate an optical network that autonomously protects a single logical qubit
against arbitrary single-qubit errors. Emulating the 9 qubit Bacon-Shor
subsystem code, the network replaces the traditionally discrete syndrome
measurement and correction steps by continuous, time-independent optical
interactions and coherent feedback of unitarily processed optical fields.Comment: 12 pages, 4 figure
Approximate quantum error correction for generalized amplitude damping errors
We present analytic estimates of the performances of various approximate
quantum error correction schemes for the generalized amplitude damping (GAD)
qubit channel. Specifically, we consider both stabilizer and nonadditive
quantum codes. The performance of such error-correcting schemes is quantified
by means of the entanglement fidelity as a function of the damping probability
and the non-zero environmental temperature. The recovery scheme employed
throughout our work applies, in principle, to arbitrary quantum codes and is
the analogue of the perfect Knill-Laflamme recovery scheme adapted to the
approximate quantum error correction framework for the GAD error model. We also
analytically recover and/or clarify some previously known numerical results in
the limiting case of vanishing temperature of the environment, the well-known
traditional amplitude damping channel. In addition, our study suggests that
degenerate stabilizer codes and self-complementary nonadditive codes are
especially suitable for the error correction of the GAD noise model. Finally,
comparing the properly normalized entanglement fidelities of the best
performant stabilizer and nonadditive codes characterized by the same length,
we show that nonadditive codes outperform stabilizer codes not only in terms of
encoded dimension but also in terms of entanglement fidelity.Comment: 44 pages, 8 figures, improved v
Quantum Error Correction with the Toric-GKP Code
We examine the performance of the single-mode GKP code and its concatenation
with the toric code for a noise model of Gaussian shifts, or displacement
errors. We show how one can optimize the tracking of errors in repeated noisy
error correction for the GKP code. We do this by examining the
maximum-likelihood problem for this setting and its mapping onto a 1D Euclidean
path-integral modeling a particle in a random cosine potential. We demonstrate
the efficiency of a minimum-energy decoding strategy as a proxy for the path
integral evaluation. In the second part of this paper, we analyze and
numerically assess the concatenation of the GKP code with the toric code. When
toric code measurements and GKP error correction measurements are perfect, we
find that by using GKP error information the toric code threshold improves from
to . When only the GKP error correction measurements are perfect
we observe a threshold at . In the more realistic setting when all error
information is noisy, we show how to represent the maximum likelihood decoding
problem for the toric-GKP code as a 3D compact QED model in the presence of a
quenched random gauge field, an extension of the random-plaquette gauge model
for the toric code. We present a new decoder for this problem which shows the
existence of a noise threshold at shift-error standard deviation for toric code measurements, data errors and GKP ancilla errors.
If the errors only come from having imperfect GKP states, this corresponds to
states with just 4 photons or more. Our last result is a no-go result for
linear oscillator codes, encoding oscillators into oscillators. For the
Gaussian displacement error model, we prove that encoding corresponds to
squeezing the shift errors. This shows that linear oscillator codes are useless
for quantum information protection against Gaussian shift errors.Comment: 50 pages, 14 figure
Tailoring surface codes for highly biased noise
The surface code, with a simple modification, exhibits ultra-high error
correction thresholds when the noise is biased towards dephasing. Here, we
identify features of the surface code responsible for these ultra-high
thresholds. We provide strong evidence that the threshold error rate of the
surface code tracks the hashing bound exactly for all biases, and show how to
exploit these features to achieve significant improvement in logical failure
rate. First, we consider the infinite bias limit, meaning pure dephasing. We
prove that the error threshold of the modified surface code for pure dephasing
noise is , i.e., that all qubits are fully dephased, and this threshold
can be achieved by a polynomial time decoding algorithm. We demonstrate that
the sub-threshold behavior of the code depends critically on the precise shape
and boundary conditions of the code. That is, for rectangular surface codes
with standard rough/smooth open boundaries, it is controlled by the parameter
, where and are dimensions of the surface code lattice. We
demonstrate a significant improvement in logical failure rate with pure
dephasing for co-prime codes that have , and closely-related rotated
codes, which have a modified boundary. The effect is dramatic: the same logical
failure rate achievable with a square surface code and physical qubits can
be obtained with a co-prime or rotated surface code using only
physical qubits. Finally, we use approximate maximum likelihood decoding to
demonstrate that this improvement persists for a general Pauli noise biased
towards dephasing. In particular, comparing with a square surface code, we
observe a significant improvement in logical failure rate against biased noise
using a rotated surface code with approximately half the number of physical
qubits.Comment: 18+4 pages, 24 figures; v2 includes additional coauthor (ASD) and new
results on the performance of surface codes in the finite-bias regime,
obtained with beveled surface codes and an improved tensor network decoder;
v3 published versio
- …