Magic-State Functional Units: Mapping and Scheduling Multi-Level Distillation Circuits for Fault-Tolerant Quantum Architectures

Abstract

Quantum computers have recently made great strides and are on a long-term path towards useful fault-tolerant computation. A dominant overhead in fault-tolerant quantum computation is the production of high-fidelity encoded qubits, called magic states, which enable reliable error-corrected computation. We present the first detailed designs of hardware functional units that implement space-time optimized magic-state factories for surface code error-corrected machines. Interactions among distant qubits require surface code braids (physical pathways on chip) which must be routed. Magic-state factories are circuits comprised of a complex set of braids that is more difficult to route than quantum circuits considered in previous work [1]. This paper explores the impact of scheduling techniques, such as gate reordering and qubit renaming, and we propose two novel mapping techniques: braid repulsion and dipole moment braid rotation. We combine these techniques with graph partitioning and community detection algorithms, and further introduce a stitching algorithm for mapping subgraphs onto a physical machine. Our results show a factor of 5.64 reduction in space-time volume compared to the best-known previous designs for magic-state factories.

arXiv comment13 pages, 10 figures

References in corpus (20)

• Fast unfolding of communities in large networks
• Community structure in social and biological networks
• Quantum Computing in the NISQ era and beyond
• Surface codes: Towards practical large-scale quantum computation
• Topological quantum memory
• Community detection in complex networks using Extremal Optimization
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Magic state distillation with low overhead
• Improved classical simulation of quantum circuits dominated by Clifford gates
• 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
• Layered architecture for quantum computing
• Quantum computation with realistic magic state factories
• Multilevel distillation of magic states for quantum computing
• Surface code implementation of block code state distillation
• Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
• Optimized Surface Code Communication in Superconducting Quantum Computers
• Synthesis of Arbitrary Quantum Circuits to Topological Assembly
• Synthesis of Topological Quantum Circuits

Cited by in corpus (6)

• Asymptotic Improvements to Quantum Circuits via Qutrits
• SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation
• A SAT Scalpel for Lattice Surgery: Representation and Synthesis of Subroutines for Surface-Code Fault-Tolerant Quantum Computing
• Synchronization for Fault-Tolerant Quantum Computers
• RESCQ: Realtime Scheduling for Continuous Angle Quantum Error Correction Architectures
• Managing Classical Processing Requirements for Quantum Error Correction