arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2502.14715quant-ph
收藏

优化驱动的量子电路约简

Optimization Driven Quantum Circuit Reduction

Bodo Rosenhahn, Tobias J. Osborne, Christoph Hirche

AI总结:

本文针对硬件受限门集下转译导致电路变长的问题,提出基于局部项替换的随机搜索、数据库检索和机器学习决策支持三种方法,在保持酉操作不变的同时显著缩短电路。

摘要:

在可用门集受限的特定硬件上实现量子电路,通常会导致等效电路长度大幅增加。这一过程也称为转译(transpilation);由于退相干,必须在不影响功能的情况下使量子电路尽可能短。在本工作中,我们提出三种不同的转译方法,它们基于局部化的项替换方案,可在保持电路所实现酉操作不变的同时,显著缩短电路长度。第一种变体基于随机搜索方案,其他变体分别由数据库检索方案和基于机器学习的决策支持驱动。我们表明,所提出的方法能够为受限门集生成较短的量子电路,优于使用不同 qiskit 优化级别所获得的典型结果。我们的方法可应用于不同门集,并能随任意数量的量子比特良好扩展。

英文摘要:

Implementing a quantum circuit on specific hardware with a reduced available gate set is often associated with a substantial increase in the length of the equivalent circuit. This process is also known as transpilation and due to decoherence, it is mandatory to keep quantum circuits as short as possible, without affecting functionality. In this work we propose three different transpilation approaches, based on a localized term-replacement scheme, to substantially reduce circuit lengths while preserving the unitary operation implemented by the circuit. The first variant is based on a stochastic search scheme, and the other variants are driven by a database retrieval scheme and a machine learning based decision support. We show that our proposed methods generate short quantum circuits for restricted gate sets, superior to the typical results obtained by using different qiskit optimization levels. Our method can be applied to different gate sets and scales well with an arbitrary number of qubits.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑