Advances in Quantum Coding Theory 2024
2024-02-12..2024-02-16
Berkeley, United States
[Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms, Application-Driven Coding Theory 2024, Summer Cluster on Quantum Computing 2025, Quantum Wave in Computing Reunion 2021, Advances in the Theory of Error-Correcting Codes, Coding: From Practice to Theory]
who it's for
quantum coding theorists, quantum error correction researchers, neutral-atom experimentalists, bosonic and continuous-variable researchers, quantum hardware architects, theoretical quantum information scientists, decoder and fault-tolerance engineers
topics
quantum LDPC codes; small-set-flip decoding; BP+OSD decoder pipelines; Viderman-style erasure conversion; quantum Tanner decoders; lattice-surgery embeddings for LDPC; Floquet code constructions; surface-code decoders parallelized in time; bosonic code logical gates; homological quantum rotor codes; low-overhead 2D fault tolerance; logical operations in qLDPC
| title | author | length |
|---|---|---|
| Introduction to qLDPC Codes | Louis Golowich | 01h 07m |
Overview of quantum LDPC codes: CSS hypergraph-product constructions take two classical LDPC Tanner graphs to build quantum codes with k growing linearly but… | ||
| Decoding Quantum Low Density Parity Check Codes | Joschka Roffe | 50m |
Quantum LDPC codes promise ~50 physical qubits per logical qubit but require general decoders because matching fails; plain belief propagation often produces… | ||
| High-Threshold and Low-Overhead Fault-Tolerant Quantum Memory | Ted Yoder | 47m |
An end-to-end protocol uses a family of LDPC (bi-variate bicycle) codes, measured by depth-7 circuits on a degree-6 Tanner graph split into two planar layers… | ||
| Layer Codes | Dominic Williamson | 48m |
Claim is that one can saturate 3D locality bounds to get essentially optimal local quantum LDPC codes by concatenating good LDPC codes with stacked surface… | ||
| Low-Overhead Fault Tolerance in Two Dimensions | Chris Pattison | 35m |
Constructs a 2D fault-tolerance scheme that uses only nearest-neighbor 2D gates to simulate long-range LDPC check circuits via graph edge coloring and… | ||
| What is Your Logical Qubit? | Jeongwan Haah | 56m |
Survey of recent demos lists concrete claims and limits: small codes (9‑qubit, 5‑qubit NV, bosonic cat/GKP) show coherence gains ≈1–2× or fault‑tolerant… | ||
| Fault Tolerance of Stabilizer Channels | Michael Beverland | 51m |
Defines a practical fault distance for stabilizer channels, gives linear-algebra H and L matrices to compute syndrome and logical action, and proves a… | ||
| Viderman's Algorithm for Quantum LDPC Codes | Inbal Livni Navon | 40m |
New Viderman-style decoder for hypergraph-product quantum LDPC codes gives a linear-time erasure conversion that outputs an envelope L guaranteed to contain… | ||
| Decoders for Good Quantum LDPC Codes | Shouzhen Gu | 43m |
Constructs linear-time and parallel decoders for quantum Tanner LDPC codes built on a left-right Cayley complex and local classical codes, proving they correct… | ||
| Bounds on qLDPC Code Parameters | Nouédyn Baspin | 26m |
Provides geometry‑oblivious bounds on qLDPC parameters by analyzing the connectivity graph of qubits and using the separation profile plus an expansion lemma… | ||
| Back to the Future | Robert Calderbank | 50m |
History connects concrete claims: Reed–Muller families are proved to achieve capacity on the binary erasure channel by combining their full symmetry with… | ||
| A Tutorial on Floquet Codes | Benjamin Brown | 01h 03m |
Shows that toric‑code behavior arises from repeated two-body measurements by cycling condensations of color‑code anyons, concretely the red x → green y → blue… | ||
| Logical Operations in Floquet Codes | Margarita Davydova | 50m |
Claims that logical gates are absorbed into measurement sequences by designing dynamic automorphism codes built from a color-code parent and explicit… | ||
| Constructions and Performance of Hyperbolic and Semi-Hyperbolic Floquet Codes | Oscar Higgott | 38m |
Constructs Floquet codes from colour-code hyperbolic tilings and a fine-grained semi-hyperbolic family, yielding weight-two checks and degree‑three… | ||
| Logical Gates in qLDPC | Armanda Quintavalle | 34m |
Claims a concrete method to get transversal Clifford gates on hypergraph-product LDPC codes by choosing a kernel basis, folding paired qubits and applying… | ||
| Scalable Surface-Code Decoders with Parallelization in Time. | Xinyu Tan | 41m |
Claim: a sandwich decoding scheme splits the 3D surface-code syndrome graph into overlapping time windows with buffer zones and runs inner decoders in parallel… | ||
| Logical Quantum Processor Based on Reconfigurable Atom Arrays | Dolev Bluvstein | 01h 11m |
Reconfigurable neutral-atom arrays implement logical qubits by moving atoms with SLMs and AODs, using Rydberg blockade CZ gates and mid-circuit readout. The… | ||
| QEC in Neutral Atom Quantum Computers | Harry Zhou | 01h 05m |
Neutral-atom systems implement rectangular subarray moves and a log-depth sorting network to realize hypergraph-product and quasi-cyclic LDPC codes, using… | ||
| Panel Discussion on Neutral Atoms | Daniel Crow, Ken Brown | 50m |
Neutral-atom setups demonstrate 99.5% two‑qubit fidelity and a measured atom loss around 0.1% per two‑qubit gate, use tweezers + lattice loading across a ~250… | ||
| Tutorial on Bosonic Codes | Victor Albert | 01h 13m |
Survey of bosonic codes compares specific code families, noise models and lab results: GKP lattice codes (phase-space lattices, displacement/nullifier… | ||
| Bosonic (And Other) Codes With Interesting Logical Gate Sets | Anthony Leverrier | 58m |
A constructive recipe builds encodings by averaging a chosen logical state and a chosen physical state over a compact group representation, using elementary… | ||
| Error Correction with Hybrid-Fusions | Shruti Puri | 45m |
Presents a concrete architecture: prepare resource-state factories and use fusion (measurement-based) foliation of the XZZX surface code to exploit biased… | ||
| Homological Quantum Rotor Codes: Logical Qubits from Torsion | Christophe Vuillot | 47m |
Defines homological quantum rotor codes using integer chain complexes and homology to produce logical degrees of freedom that can be either continuous rotors… | ||
| nothing matches | ||