REVIEW 77 cited by
Quantum codes on a lattice with boundary
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
A new type of local-check additive quantum code is presented. Qubits are associated with edges of a 2-dimensional lattice whereas the stabilizer operators correspond to the faces and the vertices. The boundary of the lattice consists of alternating pieces with two different types of boundary conditions. Logical operators are described in terms of relative homology groups.
Forward citations
Showing 60 of 77 Pith papers that cite this
-
Vine Codes: Low-Overhead Quantum LDPC Codes on a Planar Square Grid
Vine codes generalize directional codes to open planar boundaries, delivering up to 28% fewer data/measure qubits at circuit distance 7 and better simulated performance than the surface code at 10^{-3} noise while usi...
-
A polynomial-time approximation scheme for minimum-weight decoding of topological codes
Proves that minimum-weight decoding of 2D TTI stabilizer codes admits a PTAS by reducing the problem to Euclidean geometric approximation tasks such as TSP when errors are modeled as point-like excitations connected b...
-
Holographically Emergent Gauge Theory in Symmetric Quantum Circuits
Averaging symmetric Z_N quantum circuits over random noise produces a noisy surface code whose logical information is protected against symmetric errors up to a threshold, with charge-sharpening transitions coinciding...
-
Logical computation with canonical lifted product codes
Canonical lifted-product qLDPC codes admit a row/column cyclic logical basis that enables constant-seed modular surgery, compact extractors, and parallel Clifford and magic primitives.
-
Quantum LDPC codes with design rate 1/5 and good performance below 1000 physical qubits
A new family of rate-1/5 quantum LDPC codes built from non-abelian group symmetries approaches teraquop-region memory error rates below 1000 physical qubits under an optimistic, extrapolated benchmark.
-
Duality constrains optimal thresholds in quantum error correction
Zero-rate em-symmetric CSS codes are self-dual under generalized Kramers-Wannier duality, pinning their optimal code-capacity threshold (at leading order in a replica limit) to the zero-rate hashing bound p≈0.110.
-
Fault-tolerant quantum computation with static atomic buses
Static atomic buses enable high-fidelity long-range CZ gates in neutral atoms, delivering >10x better logical error rates than shuttling for FTQC with ~100 µs gates and ~1 ms QEC cycles.
-
Large-Language-Model Discovery of Quantum LDPC Codes through Structured Concept Evolution
A new LLM-guided search method called structured concept evolution discovers competitive lifted-product qLDPC code families including non-abelian constructions.
-
Breaking the bicycle frame: Coset-based quantum LDPC codes
Coset-based generalization of 2BGA codes produces new quantum LDPC codes with parameters such as [[48,8,6]] and competitive noise thresholds under BP-OSD decoding.
-
Projected logical ensembles in surface codes via the random-matrix theory of quantum dots
For single-logical-qubit surface codes with uniform X rotations, the projected logical ensemble after syndrome extraction and maximum-likelihood decoding is isomorphic to scattering-matrix ensembles of chaotic quantum...
-
A superconducting surface-code processor with lattice-surgery logical operations
Experimental realization of lattice surgery on two d=3 surface-code logical qubits in superconducting hardware, with logical Bell state, Deutsch-Jozsa algorithm, and conditioned non-Clifford gate fidelity of 0.943.
-
Breakeven demonstration of quantum low-density parity-check codes
Experimental breakeven demonstration of a qLDPC code encoding 4 logical qubits in 18 physical qubits on trapped ions, with up to 9x lower logical error rate than prior superconducting implementations.
-
Quantum metrology via partial quantum error correction
Partial QEC on superpositions of code states suppresses parallel weight-l noise by p^floor((l+1)/2) while preserving super-SQL metrology performance using local operators and an adaptive imprinter strategy.
-
Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks
Novelty search generates diverse continuous multimodal landscapes with direct basin definitions, enabling low-cost local optima networks whose features predict evolutionary algorithm performance.
-
Non-linear Sigma Model for the Surface Code with Coherent Errors
A non-linear sigma model maps surface-code decoding under coherent errors to distinct replica limits, exposing a thermal-metal phase for suboptimal decoders that is absent in optimal decoding.
-
The Structure of Circle Graph States
Circle graphs are closed under r-local complementation and bipartite circle graph states correspond one-to-one with planar code states whose MBQC is classically simulable.
-
Taming coherent noise with teleportation
Pure Z-coherent errors in teleported CSS codes are exactly equivalent to Pauli errors, enabling efficient simulation and an analytical θ_th ≥ arcsin(1/10)/5 for the teleported surface code.
-
Improved belief propagation is sufficient for real-time decoding of quantum memory
Relay-BP, a message-passing decoder using disordered memory strengths and relay ensembling, matches or beats benchmark decoders for bivariate-bicycle and surface codes within a real-time iteration budget.
-
Q3DE: A fault-tolerant quantum computer architecture for multi-bit burst errors by cosmic rays
Q3DE detects cosmic-ray-induced multi-bit burst errors from syndrome statistics alone and mitigates them through dynamic code-distance expansion and decoder rollback, cutting the exposed error period by about 1000 times.
-
High-Performance and Scalable Fault-Tolerant Quantum Computation with Lattice Surgery on a 2.5D Architecture
A sparse second qubit layer (Bypass) shortens lattice surgery paths, reducing decoding bottlenecks and enabling a 2.5D FTQC architecture that is faster and uses fewer resources in simulation.
-
Targeted Clifford logical gates for hypergraph product codes
Targeted logical Clifford gates for any hypergraph product code can be built from simple physical gates with support and depth Θ(√n), without ancillas.
-
Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice
Lattice-surgery scheduling is mapped to 3D path embedding and solved with look-ahead Dijkstra projection, yielding 3.8x lower execution time on quantum phase estimation benchmarks versus greedy scheduling.
-
Higher Gauging and Non-invertible Condensation Defects
Higher gauging of 1-form symmetries on surfaces in 2+1d QFT yields condensation defects whose fusion rules involve 1+1d TQFTs and realizes every 0-form symmetry in TQFTs.
-
Revisiting Thermal Scalability for Large-Scale Superconducting Quantum Systems
Including readout-amplifier bias-wire heat in cryogenic models moves the bottleneck to the 4 K stage and lowers estimated qubit capacity for modern superconducting systems.
-
A conditional no-go for resource-free magic-axis measurement on a static surface code
Under three stated assumptions, a resource-free static surface-code patch cannot sharply measure the magic axis at polynomial acceptance; it must pay with a resource, leave the dilute regime, or accept exponentially rarely.
-
Quantum XYZ Stabilizer Codes
A structured family of non-CSS quantum stabilizer codes built from three orthogonal classical codes, with rank-based genuineness tests, distance bounds, and finite-length decoding improvements.
-
Plaquette: A hardware-aware design platform for fault-tolerant quantum computers
Plaquette compiles realistic quantum hardware noise models into multiple sampler representations, showing that Pauli-twirled approximations can misestimate logical error rates by an order of magnitude compared to leak...
-
LUCI on IBM Hardware: Error Suppression with Almost Half Syndrome Density
Hardware experiment on IBM devices shows reset-free LUCI achieves logical X and Z error suppression ratios of 1.75(10) and 1.93(12), competitive with surface code despite halved syndrome density.
-
High-Precision Calibration Workflow Achieves Above $99.9\%$ CZ Gate Fidelity on a Scalable Superconducting Processor
A calibration workflow using ELEA and CAFE circuits achieves CZ gate fidelity above 99.9% on an 84-qubit superconducting processor with 0.007% coherent error and median 99.25% across 72 gates.
-
Optimizing bias-tailored quantum error correction beyond code-capacity noise
Under circuit-level noise the predicted advantage of bias-optimized rectangular surface codes over XZZX codes vanishes, while a new bias-filtering CNOT gadget recovers only a few-percent threshold improvement for XZZX codes.
-
Algebra of Bivariate-Bicycle Surface Codes
BBS code dimension equals the algebraic multiplicity of finite nonzero common roots of the defining bivariate polynomials, enabling a root-based prescription for arbitrary boundary shapes that avoids corner correction...
-
Barbell Codes: qLDPC Codes for Superconducting Quantum Hardware
Barbell codes are a family of qLDPC codes with a matching superconducting chip layout enabling constant hardware complexity, simulated to preserve logical information over trillions of QEC cycles at 10^{-4} physical n...
-
Homomorphic Quantum Error Correction
Establishes necessary and sufficient criterion for [[n,1,d]] stabilizer codes to preserve code space under restricted transversal block-Pauli masking U_enc(a,b)=(X^a Z^b)^⊗n for homomorphic quantum error correction.
-
A Posterior MWPM Decoding Boosts the XYZ Planar Code
XYZ planar code with pMWPM decoder achieves higher and more stable thresholds under biased noise than standard surface codes, with a 36% improvement in the infinite-bias limit.
-
Concatenating Algebraic Codes over High-Rate Quantum LDPC Codes
Concatenating quantum Reed-Solomon outer codes over the gross code using Galois qudits reaches teraquop regime at 10^{-3} physical noise with lower overhead than prior two-gross-code constructions.
-
Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices
Two new quasi-dyadic dual-containing CSS LDPC families are claimed to beat bicycle codes in finite-length simulations while enabling transversal Hadamard and BP2 decoding.
-
AI-Enabled Decoding of Qubit Loss for Quantum Error-Correcting Codes
An STGNN dual-head decoder simultaneously corrects Pauli errors and identifies qubit-loss locations from syndrome histories, outperforming MWPM baselines on simulated surface-code memory.
-
Distilling Magic States in the Bicycle Architecture
Magic state distillation can run inside a single bivariate bicycle code block, reaching ~10^-11 to 10^-12 output error at p_phys=10^-3 with hundreds of physical qubits and space-time volume near surface-code factories.
-
Quantum Error Correction Codes for Truncated SU(2) Lattice Gauge Theories
Gauss's law constraints in jmax=1/2 SU(2) lattice gauge theory are converted into stabilizer codes that correct single-qubit errors using about 9N or 12N physical qubits per N plaquettes.
-
Dense packing of the surface code: code deformation procedures and hook-error-avoiding gate scheduling
The paper introduces concrete code deformation procedures for dense surface code packing, proposes hook-error-avoiding CNOT scheduling for syndrome extraction, and reports Monte Carlo simulations showing lower logical...
-
Phenomenological Noise Models and Optimal Thresholds of the 3D Toric Code
The 3D toric code's optimal thresholds under measurement noise are ≈11% (bit-flip) and ≈2% (phase-flip), the latter inferred through an approximate entropy duality from the 4D random-bond Ising model.
-
Efficient Post-Selection for General Quantum LDPC Codes
Cluster-size and cluster-LLR norm fractions from BP+LSD decoding suppress logical error rates by orders of magnitude at low abort rates on surface, bivariate bicycle, and hypergraph product codes.
-
Transversal architecture for megaquop-scale quantum simulation with neutral atoms
A neutral-atom co-designed 'transversal STAR' architecture could reach megaquop-scale Hamiltonian simulation with about 10,000 physical qubits at 1e-3 error rates, corresponding to over 1e6 to 1e7 T gates.
-
Cross-Resonant Gates in Hybrid Fluxonium-Transmon Systems
A simulation study shows that cross-resonance CNOT gates between fluxoniums and a central transmon support high-fidelity parity checks and logical gates in a scalable dual-species architecture.
-
Enhancing Fault-Tolerant Surface Code Decoding with Iterative Lattice Reweighting
An iterative reweighting decoder for surface codes uses X-Z error correlations from circuit-level noise, improving logical error rates and raising the threshold from about 1% to 1.16%.
-
Accelerating BP-based decoders for QLDPC Codes with Local Syndrome-Based Preprocessing
Local syndrome-based preprocessing accelerates BP decoders for quantum LDPC codes, delivering up to 10x speedup on the [[144,12,12]] code while maintaining or improving logical error rates.
-
A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes
Routing syndrome information through opposite-type ancilla qubits reduces long-range connectivity of quantum LDPC codes (up to 50% for BB codes) at the cost of roughly doubled circuit depth, with circuit-level distanc...
-
Efficient and scalable inter-module switching for distributed quantum computing architectures
GMZI-based decentralized switch designs achieve any-to-any module connectivity with half the active depth and coupler count of GMZI-Spanke switches.
-
Optimizing Superconducting Three-Qubit Gates for Surface-Code Error Correction
A simulated superconducting CZZ gate, shaped to suppress surface-code-breaking Pauli errors, raises the rotated-code threshold from 0.66% to 1.2% and cuts logical error by up to 10x.
-
Diamond Circuits for Surface Codes
Diamond circuits implement a surface code on a Heavy-Square lattice using about 25% fewer qubits and 40% fewer control lines than the standard circuit, at the cost of a roughly 3x lower threshold and longer detecting regions.
-
Performance Analysis for Crosstalk Errors between Parallel Entangling Gates in Trapped Ion Quantum Error Correction
Crosstalk between parallel entangling gates in a 2D trapped-ion chip requires a distance-5 surface code, and with optimized parallelism logical error rates below 10^-10 are reachable with hundreds to thousands of ions.
-
SymBreak: Mitigating Quantum Degeneracy Issues in QLDPC Code Decoders by Breaking Symmetry
SymBreak splits syndrome nodes during belief propagation, reporting 16x lower logical error rates than BP and 3.2x lower than BP+OSD for qLDPC codes, at near-BP runtime.
-
CaliScalpel: In-Situ and Fine-Grained Qubit Calibration Integrated with Surface Code Quantum Error Correction
CaliScalpel uses surface-code deformation to isolate drifted qubits for calibration while computation continues, with a new instruction set for heavy-hexagon hardware and drift-aware scheduling.
-
Magic State Injection on IBM Quantum Processors Above the Distillation Threshold
Experimental demonstration of logical |H_L> and |T_L> magic states with fidelities 0.8806 and 0.8665 on IBM superconducting hardware using a qubit-efficient surface code embedding, with reported error thresholds above...
-
Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes
A combination of fold-transversal gates, Dehn twists, and single-shot measurements gives a constant-depth, fault-tolerant Clifford gate set for toric codes, with simulated thresholds around 2 to 7 percent.
-
Degenerate quantum erasure decoding
Degenerate BP decoders achieve capacity-achieving or near-capacity performance for quantum erasure correction in linear time on bicycle, product, and topological stabilizer codes.
-
Variational Graphical Quantum Error Correction Codes
VGQEC codes embed tunable parameters in Quon graphs to enable noise-tailored quantum error correction, bridging repetition and stabilizer codes and showing experimental results under amplitude damping on a photonic system.
-
Synchronizable hybrid subsystem codes
Synchronizable hybrid subsystem codes are built from classical cyclic codes C and D with C^perp subset C subset D via CSS construction to correct Pauli and synchronization errors, tolerate gauge errors, and carry both...
-
Mixed-state topological order and the errorfield double formulation of decoherence-induced transitions
Decoherence on abelian topological order is modeled as a temporal defect in double TQFT driving boundary anyon condensation transitions classified by Lagrangian subgroups of the doubled order.
-
Optimal working point in digitized quantum annealing
For a fixed number of Trotter steps, linear-schedule digitized quantum annealing has an optimal total time proportional to the step count; longer times produce the maximally disordered state.
Discussion (0). Continue with ORCID to comment.