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

矩阵乘积态到浅量子线路的分解

Decomposition of Matrix Product States into Shallow Quantum Circuits

Manuel S. Rudolph, Jing Chen, Jacob Miller, Atithi Acharya, Alejandro Perdomo-Ortiz

摘要:

近年来数值计算的快速发展,特别是GPU和TPU硬件加速器的兴起,使张量网络(TN)算法能够扩展到更大的量子模拟问题,并更广泛地用于解决机器学习任务。TN的“量子启发”性质允许它们被映射到参数化的量子线路(PQC),这一事实激发了最近的提议,用于使用近期量子设备来增强TN算法的性能,以及使联合量子经典训练框架受益于TN和PQC模型的独特优势。然而,任何这样的方法的成功取决于使用现实的量子线路来近似TN状态的有效和准确的方法,这仍然是一个未解决的问题。在这项工作中,我们比较了一系列新的和以前开发的算法协议,用于将任意键尺寸的矩阵乘积态(MPS)分解成由两个量子位幺正的堆叠线性层组成的低深度量子线路。这些协议是从不同的组合形成的一个预先存在的分析分解方案与约束优化的电路酉,都具有高效的经典运行时。我们的实验结果揭示了一个特定的协议,涉及量子线路的顺序增长和优化,优于所有其他方法,在有限的计算资源的设置中看到更大的好处。鉴于这些有希望的结果,我们希望我们提出的分解协议在TN和PQC的任何联合应用中形成一个有用的成分,从而进一步释放经典和量子计算的丰富和互补的好处。

英文摘要:

The rapid pace of recent advancements in numerical computation, notably the rise of GPU and TPU hardware accelerators, have allowed tensor network (TN) algorithms to scale to even larger quantum simulation problems, and to be employed more broadly for solving machine learning tasks. The "quantum-inspired" nature of TNs permits them to be mapped to parametrized quantum circuits (PQCs), a fact which has inspired recent proposals for enhancing the performance of TN algorithms using near-term quantum devices, as well as enabling joint quantum-classical training frameworks which benefit from the distinct strengths of TN and PQC models. However, the success of any such methods depends on efficient and accurate methods for approximating TN states using realistic quantum circuits, something which remains an unresolved question. In this work, we compare a range of novel and previously-developed algorithmic protocols for decomposing matrix product states (MPS) of arbitrary bond dimensions into low-depth quantum circuits consisting of stacked linear layers of two-qubit unitaries. These protocols are formed from different combinations of a preexisting analytical decomposition scheme with constrained optimization of circuit unitaries, and all possess efficient classical runtimes. Our experimental results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods, with even greater benefits seen in the setting of limited computational resources. Given these promising results, we expect our proposed decomposition protocol to form a useful ingredient within any joint application of TNs and PQCs, in turn further unlocking the rich and complementary benefits of classical and quantum computation.

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

↑