Automated distribution of quantum circuits via hypergraph partitioning

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.