Decoding Holographic Codes with an Integer Optimisation Decoder

• URL: http://arxiv.org/abs/2008.10206v2
• Date: Fri, 18 Dec 2020 04:06:29 GMT
• Title: Decoding Holographic Codes with an Integer Optimisation Decoder
• Authors: Robert J. Harris, Elliot Coupe, Nathan A. McMahon, Gavin K. Brennen, and Thomas M. Stace
• Abstract summary: We develop a most likely error Pauli error decoding algorithm for stabiliser codes based on general purpose integer optimisation. We analyse the performance of holographic codes against Pauli errors and find numerical evidence for thresholds against Pauli errors for bulk qubits.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We develop a most likely error Pauli error decoding algorithm for stabiliser codes based on general purpose integer optimisation. Using this decoder we analyse the performance of holographic codes against Pauli errors and find numerical evidence for thresholds against Pauli errors for bulk qubits. We compare the performance of holographic code families of various code rates and find phenomenological Pauli error thresholds ranging from $7\%$ to $16\%$, depending on the code rate. Additionally we give numerical evidence that specific distance measures of the codes we consider scales polynomially with number of physical qubits.

Related papers

• Breadth-first graph traversal union-find decoder [0.0]
  We develop variants of the union-find decoder that simplify its implementation and provide potential decoding speed advantages. We show how these methods can be adapted to decode non-topological quantum low-density-parity-check codes.
  arXiv  Detail & Related papers  (2024-07-22T18:54:45Z)
• Testing the Accuracy of Surface Code Decoders [55.616364225463066]
  Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC) This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
  arXiv  Detail & Related papers  (2023-11-21T10:22:08Z)
• A family of permutationally invariant quantum codes [54.835469342984354]
  We show that codes in the new family correct quantum deletion errors as well as spontaneous decay errors. Our construction contains some of the previously known permutationally invariant quantum codes. For small $t$, these conditions can be used to construct new examples of codes by computer.
  arXiv  Detail & Related papers  (2023-10-09T02:37:23Z)
• Existence of Pauli-like stabilizers for every quantum error-correcting code [0.0]
  We will show that every quantum error-correcting code has a similar structure, in that the code can be stabilized by commutative Paulian'' operators. Examples concerning codeword stabilized codes and bosonic codes will be presented.
  arXiv  Detail & Related papers  (2023-08-29T17:01:17Z)
• Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
  We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
  arXiv  Detail & Related papers  (2023-07-20T10:51:23Z)
• Error-correcting codes for fermionic quantum simulation [4.199246521960609]
  We present methodologies for fermions via qubit systems on a two-dimensional lattice algorithm. We identify a family of stabilizer codes suitable for fermion simulation. Our method can increase the code distances without decreasing the (fermionic) code rate.
  arXiv  Detail & Related papers  (2022-10-16T01:43:07Z)
• Graph Neural Networks for Channel Decoding [71.15576353630667]
  We showcase competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph. We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results.
  arXiv  Detail & Related papers  (2022-07-29T15:29:18Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)
• Trellis Decoding For Qudit Stabilizer Codes And Its Application To Qubit Topological Codes [3.9962751777898955]
  We show that trellis decoders have strong structure, extend the results using classical coding theory as a guide, and demonstrate a canonical form from which the structural properties of the decoding graph may be computed. The modified decoder works for any stabilizer code $S$ and separates into two parts: a one-time, offline which builds a compact, graphical representation of the normalizer of the code, $Sperp$, and a quick, parallel, online computation using the Viterbi algorithm.
  arXiv  Detail & Related papers  (2021-06-15T16:01:42Z)
• Decoding Across the Quantum LDPC Code Landscape [4.358626952482686]
  We show that belief propagation combined with ordered statistics post-processing is a general decoder for quantum low density parity check codes. We run numerical simulations of the decoder applied to three families of hypergraph product code: topological codes, fixed-rate random codes and a new class of codes that we call semi-topological codes.
  arXiv  Detail & Related papers  (2020-05-14T14:33:08Z)
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond [68.8204255655161]
  We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold. We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
  arXiv  Detail & Related papers  (2020-04-15T18:00:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.