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.
Schlingemann, arXiv:quant-ph/0111080 (2001)
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
abstract
We establish the connection between a recent new construction technique for quantum error correcting codes, based on graphs, and the so-called stabilizer codes: Each stabilizer code can be realized as a graph code and vice versa.
fields
quant-ph 3verdicts
UNVERDICTED 3representative citing papers
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.
New building block and protocol for all-photonic quantum repeaters using repeater graph states that reduces emissive memories at end nodes and integrates with memory-based systems.
citing papers explorer
-
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.
-
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.
-
Architecture and protocols for all-photonic quantum repeaters
New building block and protocol for all-photonic quantum repeaters using repeater graph states that reduces emissive memories at end nodes and integrates with memory-based systems.