The stabilizer code formalism is presented as a powerful group-theoretic tool for quantum error correction, enabling code construction, analysis of quantum channel capacity, bounds on codes, and fault-tolerant computation.
Threshold Accuracy for Quantum Computation
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
abstract
We have previously (quant-ph/9608012) shown that for quantum memories and quantum communication, a state can be transmitted over arbitrary distances with error $\epsilon$ provided each gate has error at most $c\epsilon$. We discuss a similar concatenation technique which can be used with fault tolerant networks to achieve any desired accuracy when computing with classical initial states, provided a minimum gate accuracy can be achieved. The technique works under realistic assumptions on operational errors. These assumptions are more general than the stochastic error heuristic used in other work. Methods are proposed to account for leakage errors, a problem not previously recognized.
citation-role summary
background 2
citation-polarity summary
roles
background 2polarities
background 2representative citing papers
LightStim automates DEM construction for QEC protocols via a record-augmented Pauli tableau tracker, validated across memory, logical operations, distillation, and a novel cross-code lattice surgery design.
Magic state cultivation prepares high-fidelity T states with an order of magnitude fewer qubit-rounds than prior distillation methods by gradually growing them within a surface code under depolarizing noise.
Ancilla-mediated protocols enable deterministic universal logical gates on any stabilizer code without ancilla consumption or code modification.
A tree-encoded fusion scheme and MemTree compiler suppress fusion erasure errors in photonic MBQC, achieving large execution-time reductions over prior compilers with real-hardware validation.
citing papers explorer
No citing papers match the current filters.