Corpus ID: 236493277

Improved quantum error correction using soft information

  title={Improved quantum error correction using soft information},
  author={Christopher Pattison and Michael Beverland and Marcus P. da Silva and Nicolas Delfosse},
The typical model for measurement noise in quantum error correction is to randomly flip the binary measurement outcome. In experiments, measurements yield much richer information—e.g., continuous current values, discrete photon counts—which is then mapped into binary outcomes by discarding some of this information. In this work, we consider methods to incorporate all of this richer information, typically called soft information, into the decoding of quantum error correction codes, and in… Expand
1 Citations
A decoder for the triangular color code by matching on a M\"obius strip
The color code is remarkable for its ability to perform fault-tolerant logic gates. This motivates the design of practical decoders that minimise the resource cost of color-code quantum computation.Expand


Analog Quantum Error Correction with Encoding a Qubit into an Oscillator.
This approach is the first attempt to draw both digital and analog information to improve quantum error correction performance and achieve the hashing bound for the quantum capacity of the GQC. Expand
Correcting coherent errors with surface codes
By performing large-scale simulations, Robert König from Technical University of Munich and an international team of collaborators show that coherent effects do not significantly impact the error correction in surface codes, giving confidence in the viability of this approach for developing fault-tolerance quantum computing architectures. Expand
Quantum error correction with the toric Gottesman-Kitaev-Preskill code
We examine the performance of the single-mode Gottesman-Kitaev-Preskill (GKP) code and its concatenation with the toric code for a noise model of Gaussian shifts, or displacement errors. We show howExpand
Computing with spin qubits at the surface code error threshold
High-fidelity control of quantum bits is paramount for the reliable execution of quantum algorithms and for achieving fault-tolerance, the ability to correct errors faster than they occur [1]. TheExpand
Fault-Tolerant Quantum Computation
Fault tolerance techniques will be essential for achieving the considerable potential of quantum computers and will need to control high noise rates and do so with low overhead, since qubits are expensive. Expand
Protocols for optimal readout of qubits using a continuous quantum nondemolition measurement
We study how the spontaneous relaxation of a qubit affects a continuous quantum nondemolition measurement of the initial state of the qubit. Given some noisy measurement record {psi}, we seek anExpand
The XZZX Surface Code
We show that a variant of the surface code---the XZZX code---offers remarkable performance for fault-tolerant quantum computation. The error threshold of this code matches what can be achieved withExpand
Low-distance Surface Codes under Realistic Quantum Noise
It is found that architectures with gate times in the 5-40 ns range and T1 times of at least 1-2 us range will exhibit improved logical error rates with a 17-qubit surface code encoding. Expand
Encoding a qubit in an oscillator
Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. These codesExpand
Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
A linear-time maximum likelihood decoder for surface codes over the quantum erasure channel is proposed, which is optimal both in terms of performance and speed. Expand