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.
Polynomial quantum algorithms for additive approximations of the
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A mapping of the Z3 Rabi model to a qubit-boson ring enables superconducting implementations and a coupled chain for the Z3 Potts model.
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.
-
From coupled $\mathbb{Z}_3$ Rabi models to the $\mathbb{Z}_3$ Potts model
A mapping of the Z3 Rabi model to a qubit-boson ring enables superconducting implementations and a coupled chain for the Z3 Potts model.