Flexible layout of surface code computations using AutoCCZ states

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).

16 pages, 18 figures

References in corpus (11)

• Surface codes: Towards practical large-scale quantum computation
• Quantum Teleportation is a Universal Computational Primitive
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• A new quantum ripple-carry addition circuit
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Novel constructions for the fault-tolerant Toffoli gate
• The ZX calculus is a language for surface code lattice surgery
• Distilling one-qubit magic states into Toffoli states
• Time-optimal quantum computation
• Windowed quantum arithmetic

Cited by in corpus (7)

• Focus beyond quadratic speedups for error-corrected quantum advantage
• Surface code compilation via edge-disjoint paths
• Towards security recommendations for public-key infrastructures for production environments in the post-quantum era
• The Impact of Hardware Specifications on Reaching Quantum Advantage in the Fault Tolerant Regime
• Interleaving: Modular architectures for fault-tolerant photonic quantum computing
• Accelerating Quantum Algorithms with Precomputation
• Quantum block lookahead adders and the wait for magic states