A graph-based bounded distance decoder corrects all errors up to a chosen weight in arbitrary stabilizer codes by representing stabilizers and syndromes as graphs and pruning the search space with a feed-forward structure.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
fields
quant-ph 4representative citing papers
Quantum information lifetime scales exponentially with system size under continuous monitoring via mid-circuit measurements, proven analytically for Haar random unitaries and confirmed numerically and experimentally, unlike the linear scaling without monitoring.
Clifford-deformed elongated compass codes exhibit bias-dependent thresholds and outperform the XZZX surface code at moderate dephasing biases under code capacity noise.
citing papers explorer
-
A graph-aware bounded distance decoder for all stabilizer codes
A graph-based bounded distance decoder corrects all errors up to a chosen weight in arbitrary stabilizer codes by representing stabilizers and syndromes as graphs and pruning the search space with a feed-forward structure.
-
Scaling Laws of Quantum Information Lifetime in Monitored Quantum Dynamics
Quantum information lifetime scales exponentially with system size under continuous monitoring via mid-circuit measurements, proven analytically for Haar random unitaries and confirmed numerically and experimentally, unlike the linear scaling without monitoring.
-
Clifford-Deformed Compass Codes
Clifford-deformed elongated compass codes exhibit bias-dependent thresholds and outperform the XZZX surface code at moderate dephasing biases under code capacity noise.
- Game-Theoretic Discovery of Quantum Error-Correcting Codes Through Nash Equilibria