Routed tile codes on a 2D nearest-neighbor grid achieve circuit-level thresholds of 0.11%-0.13% under SI1000 noise and become more qubit-efficient than the surface code below a physical error rate of 0.08%.
Title resolution pending
9 Pith papers cite this work. Polarity classification is still indexing.
9
Pith papers citing it
fields
quant-ph 9representative citing papers
Surface code logical qubits in continuous baths have a true thermodynamic error threshold only for short-range interactions, as their decoherence maps exactly to the anisotropic Kondo model.
Two machine learning models reconstruct continuous Wigner functions from sparse phase-space measurements: a provably efficient regression model for sparse states (O(s⁴ log d) samples) and a self-supervised neural network for general states including experimental GKP code data.
Pi-QEM selects dominant low-weight Pauli strings for ML training in quantum error mitigation, reducing ground-state energy estimation error by up to 34.01% using a single observable in molecular simulations on noisy IBM backends.
An FPGA-based neural-network decoder achieves 550 ns deterministic closed-loop latency for real-time distance-3 surface code error correction on a superconducting processor, matching offline decoding performance.
In-patch multiplexing reduces expected attempts per accepted logical magic state by 45-79% at physical error rate 2e-3 for distances 3 and 5 while leaving the escape stage unchanged.
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.
Classical simulation algorithms for low-magic adaptive quantum circuits with high Pauli measurement rates, demonstrated on all-to-all monitored circuits with sub-extensive T-gates to study measurement-induced phase transitions.
Numerical simulations of the surface-code ML decoder under single- and two-qubit unitary rotations reveal a ferromagnetic volume-law phase in which classical information is retained yet hard to recover.
citing papers explorer
-
Strictly Local Tile-Code Architectures on Two-Dimensional Planar Lattices
Routed tile codes on a 2D nearest-neighbor grid achieve circuit-level thresholds of 0.11%-0.13% under SI1000 noise and become more qubit-efficient than the surface code below a physical error rate of 0.08%.
-
Quantum Decoherence of the Surface Code: A Generalized Caldeira-Leggett Approach
Surface code logical qubits in continuous baths have a true thermodynamic error threshold only for short-range interactions, as their decoherence maps exactly to the anisotropic Kondo model.
-
Learning to Reconstruct Wigner Functions in Phase Space
Two machine learning models reconstruct continuous Wigner functions from sparse phase-space measurements: a provably efficient regression model for sparse states (O(s⁴ log d) samples) and a self-supervised neural network for general states including experimental GKP code data.
-
Pauli Weight Hamiltonian Term Selection for Optimized Machine Learning Based Quantum Error Mitigation
Pi-QEM selects dominant low-weight Pauli strings for ML training in quantum error mitigation, reducing ground-state energy estimation error by up to 34.01% using a single observable in molecular simulations on noisy IBM backends.
-
Real-time Surface-Code Error Correction Using an FPGA-based Neural-Network Decoder
An FPGA-based neural-network decoder achieves 550 ns deterministic closed-loop latency for real-time distance-3 surface code error correction on a superconducting processor, matching offline decoding performance.
-
Reducing Postselection Overhead in Magic-State Cultivation by In-Patch Multiplexing
In-patch multiplexing reduces expected attempts per accepted logical magic state by 45-79% at physical error rate 2e-3 for distances 3 and 5 while leaving the escape stage unchanged.
-
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.
-
Classical Simulations of Low Magic Quantum Dynamics
Classical simulation algorithms for low-magic adaptive quantum circuits with high Pauli measurement rates, demonstrated on all-to-all monitored circuits with sub-extensive T-gates to study measurement-induced phase transitions.
-
Phases of decodability in the surface code with unitary errors
Numerical simulations of the surface-code ML decoder under single- and two-qubit unitary rotations reveal a ferromagnetic volume-law phase in which classical information is retained yet hard to recover.