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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2verdicts
UNVERDICTED 2representative citing papers
A systematic graph-state protocol yields a family of [[n,1,3]] non-CSS codes that preserve bare-ancilla fault tolerance against hook errors and includes one code with higher rate than prior examples under depolarizing 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.
-
Fault-tolerant syndrome extraction in [[n,1,3]] non-CSS code family generated using measurements on graph states
A systematic graph-state protocol yields a family of [[n,1,3]] non-CSS codes that preserve bare-ancilla fault tolerance against hook errors and includes one code with higher rate than prior examples under depolarizing noise.