Automated distribution of quantum circuits via hypergraph partitioning
arXiv:1811.10972 · doi:10.1103/PhysRevA.100.032308
Abstract
Quantum algorithms are usually described as monolithic circuits, becoming large at modest input size. Near-term quantum architectures can only manage a small number of qubits. We develop an automated method to distribute quantum circuits over multiple agents, minimising quantum communication between them. We reduce the problem to hypergraph partitioning and then solve it with state-of-the-art optimisers. This makes our approach useful in practice, unlike previous methods. Our implementation is evaluated on five quantum circuits of practical relevance.
arXiv comment12 pages, 10 figures
References in corpus (19)
- Quantum entanglement
- Quantum Computing in the NISQ era and beyond
- Mixed State Entanglement and Quantum Error Correction
- Quantum algorithm for solving linear systems of equations
- Photonic quantum technologies
- Quantum Teleportation is a Universal Computational Primitive
- Exponential algorithmic speedup by quantum walk
- Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
- Distributed Quantum Computation over Noisy Channels
- Simulating quantum computation by contracting tensor networks
- Simulation of Electronic Structure Hamiltonians Using Quantum Computers
- Robust long-distance entanglement and a loophole-free Bell test with ions and photons
- Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
- Local and Distributed Quantum Computation
- Distributed Quantum Computation Architecture Using Semiconductor Nanophotonics
- Hybrid quantum logic and a test of Bell's inequality using two different atomic isotopes
- Shortcuts to quantum network routing
- Circuit Transformations for Quantum Architectures
- Wire Recycling for Quantum Circuit Optimization
Cited by in corpus (25)
- Distributed Quantum Computing: a Survey
- Quantum Internet Protocol Stack: a Comprehensive Survey
- Compiler Design for Distributed Quantum Computing
- Review of Distributed Quantum Computing. From single QPU to High Performance Quantum Computing
- A Modular Quantum Compilation Framework for Distributed Quantum Computing
- Optimized Quantum Circuit Partitioning
- Multicore Quantum Computing
- Optimized compiler for Distributed Quantum Computing
- Distributing circuits over heterogeneous, modular quantum computing network architectures
- Entanglement-efficient bipartite-distributed quantum computing
- Generalised Circuit Partitioning for Distributed Quantum Computing
- Networked Quantum Services
- Finding Small and Large k-Clique Instances on a Quantum Computer
- TeleSABRE: Layout Synthesis in Multi-Core Quantum Systems with Teleport Interconnect
- A Multilevel Framework for Partitioning Quantum Circuits
- Quantum Data Centers in the Presence of Noise
- Entanglement-Efficient Distribution of Quantum Circuits over Large-Scale Quantum Networks
- GTQCP: Greedy Topology-Aware Quantum Circuit Partitioning
- Time-Aware Qubit Assignment and Circuit Optimization for Distributed Quantum Computing
- An Evolutionary Approach to Optimizing Communication Cost in Distributed Quantum Computation
- Efficient Time-Aware Partitioning of Quantum Circuits for Distributed Quantum Computing
- Circuit Partitioning for the Quantum Internet
- DPRQ: A Dynamic Programming-based Qubit Routing Algorithm for Collective Communication in Distributed Quantum Computing
- Online Scheduling and Distribution of Quantum Circuits over Quantum Networks
- Distributing Quantum Circuits Using Pre-Distributed Entanglement Pairs over Quantum Networks