Time-Sliced Quantum Circuit Partitioning for Modular Architectures
arXiv:2005.12259 · doi:10.1145/3387902.3392617
Abstract
Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitioning heuristics which map quantum circuits to modular physical machines one time slice at a time. Specifically, we create optimized mappings for each time slice, accounting for the cost to move data from the previous time slice and using a tunable lookahead scheme to reduce the cost to move to future time slices. We compare our approach to a traditional statically-mapped, owner-computes model. Our results show strict improvement over the static mapping baseline. We reduce the non-local communication overhead by 89.8\% in the best case and by 60.9\% on average. Our techniques, unlike many exact solver methods, are computationally tractable.
Appears in CF'20: ACM International Conference on Computing Frontiers
References in corpus (37)
- Quantum Computing in the NISQ era and beyond
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Machine Learning
- Elementary gates for quantum computation
- Trapped-Ion Quantum Computing: Progress and Challenges
- Scalable Quantum Simulation of Molecular Energies
- Quantum Error Correction for Beginners
- Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
- Benchmarking an 11-qubit quantum computer
- A new quantum ripple-carry addition circuit
- Efficient Toffoli Gates Using Qudits
- Blueprint for a microwave trapped-ion quantum computer
- An Artificial Neuron Implemented on an Actual Quantum Processor
- Deterministic teleportation of a quantum gate between two logical qubits
- Quantum Circuit Simplification and Level Compaction
- Automated optimization of large quantum circuits with continuous parameters
- Synthesis of Quantum Circuits for Linear Nearest Neighbor Architectures
- Addition on a Quantum Computer
- Quantum arithmetic with the Quantum Fourier Transform
- Assessing the progress of trapped-ion processors towards fault-tolerant quantum computation
- Compiling quantum circuits to realistic hardware architectures using temporal planners
- Random access quantum information processors
- Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers
- Factoring with Qutrits: Shor's Algorithm on Ternary and Metaplectic Quantum Architectures
- Fault-Tolerant High Level Quantum Circuits: Form, Compilation and Description
- Simulating the performance of a distance-3 surface code in a linear ion trap
- Quantum Template Matching
- Mapping of Lattice Surgery-based Quantum Circuits on Surface Code Architectures
- Linear Nearest Neighbor Synthesis of Reversible Circuits by Graph Partitioning
- Spectroscopy of a synthetic trapped ion qubit
- Multilayer microwave integrated quantum circuits for scalable quantum computing
- Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
- Factoring with n+2 clean qubits and n-1 dirty qubits
- An efficient quantum circuits optimizing scheme compared with QISKit
- Unitary Entanglement Construction in Hierarchical Networks
- Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices
- Decomposing Quantum Generalized Toffoli with an Arbitrary Number of Ancilla
Cited by in corpus (24)
- A Modular Quantum Compilation Framework for Distributed Quantum Computing
- Mapping quantum circuits to modular architectures with QUBO
- Entanglement-efficient bipartite-distributed quantum computing
- Interaction graph-based characterization of quantum benchmarks for improving quantum circuit mapping techniques
- Revisiting the Mapping of Quantum Circuits: Entering the Multi-Core Era
- Hungarian Qubit Assignment for Optimized Mapping of Quantum Circuits on Multi-Core Architectures
- Orchestrated Trios: Compiling for Efficient Communication in Quantum Programs with 3-Qubit Gates
- Networked Quantum Services
- Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures
- Route-Forcing: Scalable Quantum Circuit Mapping for Scalable Quantum Computing Architectures
- A Hardware-Aware Gate Cutting Framework for Practical Quantum Circuit Knitting
- Circuit Partitioning for Multi-Core Quantum Architectures with Deep Reinforcement Learning
- Modeling Short-Range Microwave Networks to Scale Superconducting Quantum Computation
- Characterizing Qubit Traffic of a Quantum Intranet aiming at Modular Quantum Computers
- TeleSABRE: Layout Synthesis in Multi-Core Quantum Systems with Teleport Interconnect
- Quantum Data Centers in the Presence of Noise
- A Multilevel Framework for Partitioning Quantum Circuits
- Exploring a Double Full-Stack Communications-Enabled Architecture for Multi-Core Quantum Computers
- On the Impact of Classical and Quantum Communication Networks Upon Modular Quantum Computing Architecture System Performance
- Entanglement-Efficient Distribution of Quantum Circuits over Large-Scale Quantum Networks
- Attention-Based Deep Reinforcement Learning for Qubit Allocation in Modular Quantum Architectures
- Efficient Time-Aware Partitioning of Quantum Circuits for Distributed Quantum Computing
- Circuit Partitioning for the Quantum Internet
- Exploiting Long-Distance Interactions and Tolerating Atom Loss in Neutral Atom Quantum Architectures