New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
Freedman and Michael J
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Numerical study demonstrates controlled transport of Z4 parafermion edge states in a ladder model and quantifies the adiabatic speed limit under realistic conditions.
citing papers explorer
-
Lower overhead fault-tolerant building blocks for noisy quantum computers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
-
Shuttling of $\mathbb{Z}_4$ parafermions in an electronic ladder model
Numerical study demonstrates controlled transport of Z4 parafermion edge states in a ladder model and quantifies the adiabatic speed limit under realistic conditions.