Projects per year
Quantum algorithms are usually monolithic circuits, becoming large at modest input size. Near-term quantum architectures can only execute small circuits. We develop an automated method 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.