Automated distribution of quantum circuits via hypergraph partitioning
Top Cited Papers
- 5 September 2019
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 100 (3) , 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, minimizing quantum communication between them. We reduce the problem to hypergraph partitioning and then solve it with state-of-the-art optimizers. This makes our approach useful in practice, unlike previous methods. Our implementation is evaluated on five quantum circuits of practical relevance.Keywords
All Related Versions
Funding Information
- Engineering and Physical Sciences Research Council (EP/L01503X/1, EP/R044759/1)
This publication has 33 references indexed in Scilit:
- Simulation of electronic structure Hamiltonians using quantum computersMolecular Physics, 2011
- Photonic quantum technologiesNature Photonics, 2009
- Quantum Algorithm for Linear Systems of EquationsPhysical Review Letters, 2009
- Quantum entanglementReviews of Modern Physics, 2009
- Robust Long-Distance Entanglement and a Loophole-Free Bell Test with Ions and PhotonsPhysical Review Letters, 2003
- A One-Way Quantum ComputerPhysical Review Letters, 2001
- Quantum computations: algorithms and error correctionRussian Mathematical Surveys, 1997
- Mixed-state entanglement and quantum error correctionPhysical Review A, 1996
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channelsPhysical Review Letters, 1993
- Quantum computational networksProceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 1989