Proves the finite-length quantum Hamming bound for every nontrivial exact subspace code in local dimension q ≥ 3.
hub
Good quantum error-correcting codes ex- ist
14 Pith papers cite this work, alongside 2,563 external citations. Polarity classification is still indexing.
14
Pith papers citing it
2,563
external citations · OpenAlex
hub tools
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Under local amplitude damping, GHZ-type states lose magic, regain it after entanglement death, and the rebirth threshold exactly mirrors the entanglement-death threshold: γ₊ = 1 − γₑ for every n.
Univariate bicycle codes give an explicit basis for logical operators and distance upper bounds in a restricted class of quantum LDPC codes while matching the performance of less constrained generalized and bivariate bicycle codes in simulations.
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.
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 noise with under 30 data qubits per logical qubit.
Dilution method for quaternary Min-Sum decoder yields 16% apparent depolarizing threshold up to d=20, outperforms MWPM in finite regimes, and for X-noise beats BP-OSD at d=65 with O(N log² d) complexity.
Global Bradley-Terry rankings of LLMs are misleading due to structured heterogeneity in user preferences, and small (λ, ν)-portfolios recover coherent subpopulations that cover over 96% of votes with just five rankings.
Lattice QED is established as a quantum error-correcting code beyond stabilizers, with explicit recovery operations constructed via quantum reference frames for gauge and fermionic sectors.
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.
VarQEC uses a distinguishability loss as a machine-learning objective to variationally discover resource-efficient encoding circuits optimized for given noise models.
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 prior values.
Dyadic matrices enable algebraic construction of QLDPC codes with enumerated short cycles and absorbing sets, yielding decoding gains in simulations even without higher girth.
Lifted product QLDPC codes have isomorphic Tanner graphs for H_X and H_Z, with connectivity conditions and bounds on minimal absorbing sets.
A topical review unifying statistical mechanics, tensor network, and AI approaches to approximate maximum likelihood decoding for quantum error correction codes.
citing papers explorer
-
The Quantum Hamming Bound in Arbitrary Local Dimension
Proves the finite-length quantum Hamming bound for every nontrivial exact subspace code in local dimension q ≥ 3.
-
Sudden death of entanglement, rebirth of magic
Under local amplitude damping, GHZ-type states lose magic, regain it after entanglement death, and the rebirth threshold exactly mirrors the entanglement-death threshold: γ₊ = 1 − γₑ for every n.
-
Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds
Univariate bicycle codes give an explicit basis for logical operators and distance upper bounds in a restricted class of quantum LDPC codes while matching the performance of less constrained generalized and bivariate bicycle codes in simulations.
-
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.
-
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 noise with under 30 data qubits per logical qubit.
-
Towards Scalable Quaternary Message-Passing Decoding for Quantum Error Correction
Dilution method for quaternary Min-Sum decoder yields 16% apparent depolarizing threshold up to d=20, outperforms MWPM in finite regimes, and for X-noise beats BP-OSD at d=65 with O(N log² d) complexity.
-
Why Global LLM Leaderboards Are Misleading: Small Portfolios for Heterogeneous Supervised ML
Global Bradley-Terry rankings of LLMs are misleading due to structured heterogeneity in user preferences, and small (λ, ν)-portfolios recover coherent subpopulations that cover over 96% of votes with just five rankings.
-
Error Correction in Lattice Quantum Electrodynamics with Quantum Reference Frames
Lattice QED is established as a quantum error-correcting code beyond stabilizers, with explicit recovery operations constructed via quantum reference frames for gauge and fermionic sectors.
-
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.
-
Learning Encodings by Maximizing State Distinguishability: Variational Quantum Error Correction
VarQEC uses a distinguishability loss as a machine-learning objective to variationally discover resource-efficient encoding circuits optimized for given noise models.
-
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 prior values.
-
Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes
Dyadic matrices enable algebraic construction of QLDPC codes with enumerated short cycles and absorbing sets, yielding decoding gains in simulations even without higher girth.
-
Graphical Analysis of Lifted Product Code Constructions
Lifted product QLDPC codes have isomorphic Tanner graphs for H_X and H_Z, with connectivity conditions and bounds on minimal absorbing sets.
-
Maximum Likelihood Decoding of Quantum Error Correction Codes
A topical review unifying statistical mechanics, tensor network, and AI approaches to approximate maximum likelihood decoding for quantum error correction codes.