Flexible layout of surface code computations using AutoCCZ states
Craig Gidney, Austin G. Fowler
TL;DR
This work introduces the AutoCCZ state, a self-correcting CCZ resource with embedded delayed-choice CZs, enabling more flexible spacetime layouts for surface-code computations. By combining a compact delayed-choice CZ, improved CCZ distillation, and routing strategies, the authors demonstrate reaction-limited ripple-carry adder and Clifford-limited QROM reads that can operate efficiently on large-scale superconducting qubit platforms. Under plausible hardware assumptions, they find that circuit-level Toffoli parallelism provides no speedup for problems smaller than about five million physical qubits, and they achieve a fourfold reduction in delayed-choice CZ spacetime volume relative to prior approaches. The results advance practical layout design for large-scale quantum arithmetic and lookups, with explicit factory counts and footprint estimates illustrating scalability considerations.
Abstract
We construct a self-correcting CCZ state (the "AutoCCZ") with embedded delayed choice CZs for completing gate teleportations. Using the AutoCCZ state we create efficient surface code spacetime layouts for both a depth-limited circuit (a ripply-carry addition) and a Clifford-limited circuit (a QROM read). Our layouts account for distillation and routing, are based on plausible physical assumptions for a large-scale superconducting qubit platform, and suggest that circuit-level Toffoli parallelism (e.g. using a carry-lookahead adder instead of a ripple-carry adder) will not reduce the execution time of computations involving fewer than five million physical qubits. We reduce the spacetime volume of delayed choice CZs by a factor of 4 compared to techniques from previous work (Fowler 2012), and make several improvements to the CCZ magic state factory from (Gidney 2019).
