319 research outputs found
Scalable Neural Network Decoders for Higher Dimensional Quantum Codes
Machine learning has the potential to become an important tool in quantum
error correction as it allows the decoder to adapt to the error distribution of
a quantum chip. An additional motivation for using neural networks is the fact
that they can be evaluated by dedicated hardware which is very fast and
consumes little power. Machine learning has been previously applied to decode
the surface code. However, these approaches are not scalable as the training
has to be redone for every system size which becomes increasingly difficult. In
this work the existence of local decoders for higher dimensional codes leads us
to use a low-depth convolutional neural network to locally assign a likelihood
of error on each qubit. For noiseless syndrome measurements, numerical
simulations show that the decoder has a threshold of around when
applied to the 4D toric code. When the syndrome measurements are noisy, the
decoder performs better for larger code sizes when the error probability is
low. We also give theoretical and numerical analysis to show how a
convolutional neural network is different from the 1-nearest neighbor
algorithm, which is a baseline machine learning method
Space-Time Circuit-to-Hamiltonian Construction and Its Applications
The circuit-to-Hamiltonian construction translates dynamics (a quantum
circuit and its output) into statics (the groundstate of a circuit Hamiltonian)
by explicitly defining a quantum register for a clock. The standard
Feynman-Kitaev construction uses one global clock for all qubits while we
consider a different construction in which a clock is assigned to each
interacting qubit. This makes it possible to capture the spatio-temporal
structure of the original quantum circuit into features of the circuit
Hamiltonian. The construction is inspired by the original two-dimensional
interacting fermionic model (see
http://link.aps.org/doi/10.1103/PhysRevA.63.040302) We prove that for
one-dimensional quantum circuits the gap of the circuit Hamiltonian is
appropriately lower-bounded, partially using results on mixing times of Markov
chains, so that the applications of this construction for QMA (and partially
for quantum adiabatic computation) go through. For one-dimensional quantum
circuits, the dynamics generated by the circuit Hamiltonian corresponds to
diffusion of a string around the torus.Comment: 27 pages, 5 figure
Constructions and Noise Threshold of Hyperbolic Surface Codes
We show how to obtain concrete constructions of homological quantum codes
based on tilings of 2D surfaces with constant negative curvature (hyperbolic
surfaces). This construction results in two-dimensional quantum codes whose
tradeoff of encoding rate versus protection is more favorable than for the
surface code. These surface codes would require variable length connections
between qubits, as determined by the hyperbolic geometry. We provide numerical
estimates of the value of the noise threshold and logical error probability of
these codes against independent X or Z noise, assuming noise-free error
correction
The Small Stellated Dodecahedron Code and Friends
We explore a distance-3 homological CSS quantum code, namely the small
stellated dodecahedron code, for dense storage of quantum information and we
compare its performance with the distance-3 surface code. The data and ancilla
qubits of the small stellated dodecahedron code can be located on the edges
resp. vertices of a small stellated dodecahedron, making this code suitable for
3D connectivity. This code encodes 8 logical qubits into 30 physical qubits
(plus 22 ancilla qubits for parity check measurements) as compared to 1 logical
qubit into 9 physical qubits (plus 8 ancilla qubits) for the surface code. We
develop fault-tolerant parity check circuits and a decoder for this code,
allowing us to numerically assess the circuit-based pseudo-threshold.Comment: 19 pages, 14 figures, comments welcome! v2 includes updates which
conforms with the journal versio
Local Decoders for the 2D and 4D Toric Code
We analyze the performance of decoders for the 2D and 4D toric code which are
local by construction. The 2D decoder is a cellular automaton decoder
formulated by Harrington which explicitly has a finite speed of communication
and computation. For a model of independent and errors and faulty
syndrome measurements with identical probability we report a threshold of
for this Harrington decoder. We implement a decoder for the 4D toric
code which is based on a decoder by Hastings arXiv:1312.2546 . Incorporating a
method for handling faulty syndromes we estimate a threshold of for
the same noise model as in the 2D case. We compare the performance of this
decoder with a decoder based on a 4D version of Toom's cellular automaton rule
as well as the decoding method suggested by Dennis et al.
arXiv:quant-ph/0110143 .Comment: 22 pages, 21 figures; fixed typos, updated Figures 6,7,8,
Single-Shot Decoding of Linear Rate LDPC Quantum Codes With High Performance
We construct and analyze a family of low-density parity check (LDPC) quantum codes with a linear encoding rate, distance scaling as nϵ for ϵ>0 and efficient decoding schemes. The code family is based on tessellations of closed, four-dimensional, hyperbolic manifolds, as first suggested by Guth and Lubotzky. The main contribution of this work is the construction of suitable manifolds via finite presentations of Coxeter groups, their linear representations over Galois fields and topological coverings. We establish a lower bound on the encoding rate k/n of 13/72=0.180… and we show that the bound is tight for the examples that we construct. Numerical simulations give evidence that parallelizable decoding schemes of low computational complexity suffice to obtain high performance. These decoding schemes can deal with syndrome noise, so that parity check measurements do not have to be repeated to decode. Our data is consistent with a threshold of around 4% in the phenomenological noise model with syndrome noise in the single-shot regime
Quantum Low-Density Parity-Check Codes
Quantum error correction is an indispensable ingredient for scalable quantum computing. In this Perspective we discuss a particular class of quantum codes called “quantum low-density parity-check (LDPC) codes.” The codes we discuss are alternatives to the surface code, which is currently the leading candidate to implement quantum fault tolerance. We introduce the zoo of quantum LDPC codes and discuss their potential for making quantum computers robust with regard to noise. In particular, we explain recent advances in the theory of quantum LDPC codes related to certain product constructions and discuss open problems in the field
- …