Mostad et al., 2024 - Google Patents

Generalizing Quantum Tanner Codes

Mostad et al., 2024

View PDF
Document ID
3305604521686667312
Author
Mostad O
Rosnes E
Lin H
Publication year
Publication venue
arXiv preprint arXiv:2405.07980

External Links

Snippet

In this work, we present a generalization of the recently proposed quantum Tanner codes by Leverrier and Z\'emor, which contains a construction of asymptotically good quantum LDPC codes. Quantum Tanner codes have so far been constructed equivalently from groups …
Continue reading at arxiv.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/002—Quantum computers, i.e. information processing by using quantum superposition, coherence, decoherence, entanglement, nonlocality, teleportation
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1105—Decoding
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1148—Structural properties of the code parity-check or generator matrix
    • H03M13/116—Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices

Similar Documents

Publication Publication Date Title
Higgott et al. Improved decoding of circuit noise and fragile boundaries of tailored surface codes
US10599989B2 (en) Efficient reduction of resources for the simulation of fermionic Hamiltonians on quantum hardware
US6128764A (en) Quantum error-correcting codes and devices
Ouyang Permutation-invariant quantum codes
Rains Quantum codes of minimum distance two
Biham et al. Entanglement monotone derived from Grover’s algorithm
EP1540508A2 (en) Methods for transmitting data across quantum interfaces and quantum gates using same
Biham et al. Grover’s quantum search algorithm for an arbitrary initial mixed state
Leverrier et al. Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes
Matsumine et al. Channel decoding with quantum approximate optimization algorithm
Leverrier et al. Decoding quantum Tanner codes
Ueno et al. Qulatis: A quantum error correction methodology toward lattice surgery
Chamon et al. Constructing quantum spin liquids using combinatorial gauge symmetry
Smolin et al. Simple family of nonadditive quantum codes
Christandl et al. Recoupling coefficients and quantum entropies
Mazáč et al. Topological order, entanglement, and quantum memory at finite temperature
Devulapalli et al. Quantum routing with teleportation
Hong et al. Quantum memory at nonzero temperature in a thermodynamically trivial system
He et al. Strong quantum nonlocality and unextendibility without entanglement in $ N $-partite systems with odd $ N$
Mostad et al. Generalizing Quantum Tanner Codes
Zhou et al. Entanglement of random hypergraph states
US12068759B2 (en) Construction of lookup decoders for stabilizer codes
Ruh et al. Digital quantum simulation of the BCS model with a central-spin-like quantum processor
Sudevan et al. $ n $-qubit states with maximum entanglement across all bipartitions: A graph state approach
Large et al. Perfect quantum state transfer of hard-core bosons on weighted path graphs