Automated distribution of quantum circuits via hypergraph partitioning
Automated distribution of quantum circuits via hypergraph partitioning
复制标题
DOI：
10.1103/physreva.100.032308
复制
发表时间：
2018-11
影响因子：
2.9
通讯作者：
Pablo Andr'es-Mart'inez;C. Heunen
中科院分区：
文献类型：
--
作者：
Pablo Andr'es-Mart'inez;C. Heunen
量子算法通常被描述为单片电路，在适度的输入大小下变得更大。近期的量子架构只能管理少量的量子比特。我们开发了一种自动方法，将量子电路分布在多个代理之间，最大限度地减少它们之间的量子通信。我们将问题归结为超图划分，然后使用最先进的优化器来解决它。与以前的方法不同，这使得我们的方法在实践中很有用。在五个具有实际意义的量子电路上对我们的实现进行了评估。
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.