• Corpus ID: 238215341

Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes

  title={Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes},
  author={Nicolas Delfosse and Michael Beverland and Maxime Tremblay},
In this work we establish lower bounds on the size of Clifford circuits that measure a family of commuting Pauli operators. Our bounds depend on the interplay between a pair of graphs: the Tanner graph of the set of measured Pauli operators, and the connectivity graph which represents the qubit connections required to implement the circuit. For local-expander quantum codes, which are promising for low-overhead quantum error correction, we prove that any syndrome extraction circuit implemented… 

Low-overhead fault-tolerant quantum computing using long-range connectivity.

This work presents a scheme for low-overhead fault-tolerant quantum computation based on quantum low-density parity-check (LDPC) codes, where long-range interactions enable many logical qubits to be encoded with a modest number of physical qubits.

Surface code compilation via edge-disjoint paths

The Edge-Disjoint Paths Compilation algorithm has the best asymptotic worst-case performance guarantees on the circuit depth for compiling parallel operations when compared to related compilation methods based on swap s and network coding.

Bias-tailored quantum LDPC codes

1Dahlem Center for Complex Quantum Systems, Freie Universität Berlin, 14195 Berlin, Germany 2Department of Physics and Astronomy, University of Sheffield, Sheffield S3 7RH, United Kingdom 3Centre for



Constant Overhead Quantum Fault-Tolerance with Quantum Expander Codes

We prove that quantum expander codes can be combined with quantum fault-tolerance techniques to achieve constant overhead: the ratio between the total number of physical qubits required for a quantum

Constant-overhead quantum error correction with thin planar connectivity

This work proposes a 2D layout for quantum LDPC codes by decomposing their Tanner graphs into a small number of planar layers, each layer contains long-range connections which do not cross.

Surface codes: Towards practical large-scale quantum computation

The concept of the stabilizer, using two qubits, is introduced, and the single-qubit Hadamard, S and T operators are described, completing the set of required gates for a universal quantum computer.

Tradeoffs for reliable quantum information storage in 2D systems

It is shown that kd{2}=O(n) where the coefficient in O( n) depends only on the locality of the constraints and dimension of the Hilbert spaces describing individual particles.

Decoding across the quantum low-density parity-check code landscape

This work shows that belief propagation combined with ordered statistics post-processing is a general decoder for quantum low density parity check codes constructed from the hypergraph product, and improves upon previous quantum decoders based on belief propagation, and approaches the performance of the minimum weight perfect matching algorithm.

Numerical study of hypergraph product codes

This paper numerically estimate the performance for the hypergraph product codes under independent bit and phase flip noise and shows that for similar rate, the performance of the hyper graph product is better than thePerformance of the toric code as soon as the authors deal with more than $500$ logical qubits and that for $3600$ logicalqubits, the logical error rate for thehypergraph product code is several orders of magnitude smaller.

Building a Fault-Tolerant Quantum Computer Using Concatenated Cat Codes

This work presents a comprehensive architectural analysis for a fault-tolerant quantum computer based on cat codes concatenated with outer quantum error-correcting codes, and proposes a system of acoustic resonators coupled to superconducting circuits with a two-dimensional layout.

Quantum Expander Codes

We present an efficient decoding algorithm for constant rate quantum hyper graph-product LDPC codes which provably corrects adversarial errors of weight proportional to the code minimum distance, or

Degenerate Quantum LDPC Codes With Good Finite Length Performance

It is shown that with the help of OSD-like post-processing the performance of the standard belief propagation (BP) decoder on many QLDPC codes can be improved by several orders of magnitude.

Fiber bundle codes: breaking the n1/2 polylog(n) barrier for Quantum LDPC codes

This is the first quantum LDPC code construction that achieves distance greater than N1/2 polylog(N), based on generalizing the homological product of codes to a fiber bundle.