Resource Optimized Quantum Architectures for Surface Code Implementations of Magic-State Distillation

Abstract

Quantum computers capable of solving classically intractable problems are under construction, and intermediate-scale devices are approaching completion. Current efforts to design large-scale devices require allocating immense resources to error correction, with the majority dedicated to the production of high-fidelity ancillary states known as magic-states. Leading techniques focus on dedicating a large, contiguous region of the processor as a single "magic-state distillation factory" responsible for meeting the magic-state demands of applications. In this work we design and analyze a set of optimized factory architectural layouts that divide a single factory into spatially distributed factories located throughout the processor. We find that distributed factory architectures minimize the space-time volume overhead imposed by distillation. Additionally, we find that the number of distributed components in each optimal configuration is sensitive to application characteristics and underlying physical device error rates. More specifically, we find that the rate at which T-gates are demanded by an application has a significant impact on the optimal distillation architecture. We develop an optimization procedure that discovers the optimal number of factory distillation rounds and number of output magic states per factory, as well as an overall system architecture that interacts with the factories. This yields between a 10x and 20x resource reduction compared to commonly accepted single factory designs. Performance is analyzed across representative application classes such as quantum simulation and quantum chemistry.

16 pages, 14 figures

References in corpus (27)

• Quantum Computing in the NISQ era and beyond
• Elementary gates for quantum computation
• Surface codes: Towards practical large-scale quantum computation
• Topological quantum memory
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Quantum algorithms: an overview
• Surface code quantum computing by lattice surgery
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• Digitized adiabatic quantum computing with a superconducting circuit
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Magic state distillation with low overhead
• Gate count estimates for performing quantum chemistry on small quantum computers
• Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
• Quantum circuits of T-depth one
• Generalized Jordan-Wigner Transformations
• Quantum computation with realistic magic state factories
• Simulating chemistry efficiently on fault-tolerant quantum computers
• Multilevel distillation of magic states for quantum computing
• Fault-Tolerant High Level Quantum Circuits: Form, Compilation and Description
• Qutrit Magic State Distillation
• Surface code implementation of block code state distillation
• Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
• Space, time, parallelism and noise requirements for reliable quantum computing
• Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates
• Optimized Surface Code Communication in Superconducting Quantum Computers
• Optimal ancilla-free Clifford+T approximation of z-rotations
• Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code

Cited by in corpus (5)

• SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation
• Constraints on magic state protocols from the statistical mechanics of Wigner negativity
• Fault-tolerant Post-Selection for Low Overhead Magic State Preparation
• Locality-aware Pauli-based computation for local magic state preparation
• LSQCA: Resource-Efficient Load/Store Architecture for Limited-Scale Fault-Tolerant Quantum Computing