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
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3representative citing papers
A new fault-tolerant scheme called parity unfolding distills gates from any Clifford hierarchy level using 2^{k+3} + O(2^{k/2}) biased-noise qubits, cutting logical error rates by 43% and resources by 26% for arbitrary rotation synthesis compared to T-only distillation.
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.
-
Parity-unfolded distillation architecture for noise-biased platforms
A new fault-tolerant scheme called parity unfolding distills gates from any Clifford hierarchy level using 2^{k+3} + O(2^{k/2}) biased-noise qubits, cutting logical error rates by 43% and resources by 26% for arbitrary rotation synthesis compared to T-only distillation.
- Game-Theoretic Discovery of Quantum Error-Correcting Codes Through Nash Equilibria