Automated distribution of quantum circuits
Preprint
Abstract
Quantum algorithms are usually monolithic circuits, becoming large at modest input size. Near-term quantum architectures can only execute small circuits. We develop automated methods to distribute quantum circuits over multiple agents, minimising quantum communication between them. We reduce the problem to hypergraph partitioning, which is NP-hard but has advanced heuristic solvers. Our implementation is evaluated on five quantum circuits. Four are amenable to distribution. The distribution cost is more than halved when compared to a naive approach.Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- Hybrid quantum logic and a test of Bell’s inequality using two different atomic isotopesNature, 2015
- Interacting quantum observables: categorical algebra and diagrammaticsNew Journal of Physics, 2011
- Simulation of electronic structure Hamiltonians using quantum computersMolecular Physics, 2011
- -hard and linear variants of hypergraph partitioningTheoretical Computer Science, 2010
- Photonic quantum technologiesNature Photonics, 2009
- Quantum Algorithm for Linear Systems of EquationsPhysical Review Letters, 2009
- Distributed quantum computation over noisy channelsPhysical Review A, 1999
- Mixed-state entanglement and quantum error correctionPhysical Review A, 1996
- Quantum computational networksProceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 1989
- Simulating physics with computersInternational Journal of Theoretical Physics, 1982