Proves the finite-length quantum Hamming bound for every nontrivial exact subspace code in local dimension q ≥ 3.
hub
Shor (1995): Scheme for reducing decoherence in quantum computer memory
17 Pith papers cite this work. Polarity classification is still indexing.
17
Pith papers citing it
hub tools
citation-role summary
background 2
citation-polarity summary
roles
background 2polarities
background 2representative citing papers
Adaptive feed-forward circuits outperform non-adaptive parallel schemes in mitigating error from noisy two-outcome qubit measurements, with advantage appearing at three uses and growing unbounded with more uses.
Introduces forward-assisted purification via a new spatiotemporal framework that outperforms conventional static purification by up to 50x in copy efficiency and circumvents no-purification theorems for Bell states.
An algorithm converts topological data of 2D bulk stabilizer codes into 1D boundary subsystem codes via operator algebra and normal forms, enabling automatic generation of boundaries and defects demonstrated on toric, color, and other codes.
Search-based approximate diagonalization followed by analytical inversion yields high-precision multi-qubit Clifford+T circuits with 95% fewer non-Clifford gates on real-algorithm benchmarks.
Coq framework with discrete lenses for typed, compositional definition and verification of quantum circuits.
Sparse Mamba Decoder processes only active defects in surface code syndromes using a 13-feature representation and Mamba backbone for O(k) complexity, reporting speedups and accuracy gains over dense decoders.
Clifford-deformed zero-rate LDPC codes achieve code-capacity thresholds approaching 50% under i.i.d. pure dephasing when the number of biased logical operators scales slower than distance or overlaps satisfy stated conditions, with new examples from tile codes.
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.
Ancilla-mediated protocols enable deterministic universal logical gates on any stabilizer code without ancilla consumption or code modification.
VarQEC uses a distinguishability loss as a machine-learning objective to variationally discover resource-efficient encoding circuits optimized for given noise models.
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
A quantum anonymous secret sharing scheme is constructed using permutation-invariant codes, with leakage in ramp schemes quantified by quantum conditional min-entropy related to Knill-Laflamme conditions.
A distributed (6.6.6) color code is realized by interconnecting patches via entangled pairs, with simulations showing the concatenated MWPM decoder maintains error threshold under asymmetric seam noise while tensor-network decoder shows slight reduction.
A graph-based method is proposed to study entanglement entropy in CSS quantum codes, with illustrations on toric codes and quantum LDPC codes showing scaling behavior.
A conceptual proposal to implement finite-state classical logic machines by mapping Boolean operations onto the population and coherence dynamics of a two-level atomic system analyzed via the Liouville equation.
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.
-
Reducing measurement error with adaptivity
Adaptive feed-forward circuits outperform non-adaptive parallel schemes in mitigating error from noisy two-outcome qubit measurements, with advantage appearing at three uses and growing unbounded with more uses.
-
Forward-Assisted Purification: A Spatiotemporal Framework Beyond Conventional Limits
Introduces forward-assisted purification via a new spatiotemporal framework that outperforms conventional static purification by up to 50x in copy efficiency and circumvents no-purification theorems for Bell states.
-
Sparse Mamba Decoder for Quantum Error Correction: Efficient Defect-Centric Processing of Surface Code Syndromes
Sparse Mamba Decoder processes only active defects in surface code syndromes using a 13-feature representation and Mamba backbone for O(k) complexity, reporting speedups and accuracy gains over dense decoders.
-
Clifford-deformed zero-rate LDPC codes with 50% biased noise thresholds
Clifford-deformed zero-rate LDPC codes achieve code-capacity thresholds approaching 50% under i.i.d. pure dephasing when the number of biased logical operators scales slower than distance or overlaps satisfy stated conditions, with new examples from tile codes.
-
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.
-
Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation
Ancilla-mediated protocols enable deterministic universal logical gates on any stabilizer code without ancilla consumption or code modification.
-
Lower overhead fault-tolerant building blocks for noisy quantum computers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
-
Quantum Anonymous Secret Sharing with Permutation Invariant Codes
A quantum anonymous secret sharing scheme is constructed using permutation-invariant codes, with leakage in ramp schemes quantified by quantum conditional min-entropy related to Knill-Laflamme conditions.
-
Implementation of Finite state logic machines via the dynamics of atomic systems
A conceptual proposal to implement finite-state classical logic machines by mapping Boolean operations onto the population and coherence dynamics of a two-level atomic system analyzed via the Liouville equation.
-
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.