Novel low-depth unitary circuits enable fully addressable, fault-tolerant two-qubit Clifford gates on quantum LDPC codes with constant depth independent of code distance, achieving memory-like error scaling across multiple code families.

Novel low-depth unitary circuits enable fully addressable, fault-tolerant two-qubit Clifford gates on quantum LDPC codes with constant depth independent of code distance, achieving memory-like error scaling across multiple code families.
New efficient classical algorithms enable benchmarking of fault-tolerant non-Clifford quantum circuits via affine-diagonal decomposition, solving a key challenge in validating quantum error correction at scale.
We develop exact error correction protocols for non-Abelian topological surface codes based on quantum doubles, determining orthogonal error bases and charge/flux transfer circuits applicable to any finite group.
Boundary-connected planar modules reduce physical qubit overhead for quantum error correction by 10-30× compared to surface codes while maintaining nearest-neighbor gates, enabling scalable fault-tolerant quantum computation.
Quantum Tanner codes achieve optimal spacetime scaling for reliable quantum memory with noisy error correction—matching theoretical bounds while tolerating coherent and correlated faults.
Researchers construct random quantum LDPC codes approaching the Gilbert-Varshamov bound with constant-weight checks, matching random stabilizer code performance on quantum erasure and Pauli channels.
First fault-tolerant scheme enabling injection & ejection into quantum codes with constant space-time overhead under locally stochastic noise, advancing practical quantum error correction.
Developed algebraic method to determine minimum distances in quantum error correction codes, enabling exact distance analysis of bivariate bicycle codes without numerical search.
Novel all-optical scheme for preparing large-amplitude cat states with near-unity probability using quantum non-demolition interactions. Robust to photon loss and enables efficient quantum error correction using Gottesman-Kitaev-Preskill codes.
Layer codes enable quantum memories to maintain information 1.7–3× longer without correction cycles than surface codes at equal distance, advancing fault-tolerant quantum computing design through detailed circuit analysis.
Proves that optimal quantum erasure on fixed spin regions cannot eliminate fundamental collective interference loss—orthogonality exponents persist despite best possible local control in quantum spin environments.
Novel decoding algorithm using rank-decomposition dynamic programming achieves polynomial-time exact maximum-likelihood decoding for quantum error correction on specific code families, outperforming tensor-network methods.
Researchers formulate continuous quantum error correction as an information engine, revealing a fundamental tradeoff: stronger feedback improves qubit protection but demands escalating energy resources.
Novel analytical link between qubit depolarizing noise and bosonic Gaussian channels improves lower bounds on quantum capacity threshold from p≥0.1940 to p≥0.2029, offering new insights into symmetric code optimization.
Novel algebraic framework for implementing logical operations on neutral-atom quantum processors with constant-depth atom shuttling, achieving 2× faster measurements than graph-based approaches while maintaining competitive qubit overhead.
New result: Exact minimum distance d = 15 for my [[832, 10, 15]] quantum LDPC code.
Algebraic reduction cuts exhaustive enumeration to ~1 second.
📄 Read the paper and explore the proof:
doi.org/10.5281/zeno...
JPMorganChase & Quantinuum achieved fault-tolerant execution of quantum algorithms using Steane code error correction on 97 physical qubits, demonstrating better-than-random performance with QAOA and HHL algorithms.
IonQ's hybrid error correction strategy using scheduled qLDPC and adapted CliNR achieves 74x speedup for logical Clifford operations and 5x for Toffoli gates, addressing latency bottlenecks in fault-tolerant quantum computing.
QuaSARQ achieves up to 105× speedup over existing simulators for stabilizer circuits by reformulating sequential measurement algorithms as GPU-efficient parallel operations, reaching 180,000 qubits with 80% energy reduction.
#StabilizerSimulation #QuantumErrorCorrection #GPUAcceleration
Changing probe preparation from encoded to product state dramatically reduces calibration sample requirements, enabling quantum error correction tasks that exceed budget constraints with traditional methods.