arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2207.12470quant-phhep-lathep-phnucl-th
收藏

费米子体系量子模拟的并行化技术

Parallelization techniques for quantum simulation of fermionic systems

Jacob Bringewatt, Zohreh Davoudi

AI总结:

本文将费米子到量子比特的映射与量子处理器连通性结合,提出弱着色和强着色两种路径着色并行化方法,以降低哈密顿量模拟电路深度,并通过解析与数值示例验证其改进效果。

摘要:

将费米子算符映射为量子比特算符是在量子计算机上模拟费米子体系的关键步骤。我们研究了这种映射的选择如何与量子处理器的底层量子比特连通性相互作用,从而促进(或阻碍)所得哈密顿量模拟算法的并行化。研究表明,该问题可以映射为图上的路径着色问题,该图由将费米子编码到量子比特上的特定选择以及将费米子相互作用编码到路径上的方式构建而成。该问题的基本版本被称为弱着色问题。考虑映射的细粒度细节则得到所谓的强着色问题,从而带来更好的并行化性能。文中给出了一系列说明性的解析和数值示例,以展示基于弱着色和强着色的并行化所带来的改进程度。我们的结果对于近期量子处理器上的实现尤为重要,因为在这些处理器上,最小化电路深度是实现算法可行性的必要条件。

英文摘要:

Mapping fermionic operators to qubit operators is an essential step for simulating fermionic systems on a quantum computer. We investigate how the choice of such a mapping interacts with the underlying qubit connectivity of the quantum processor to enable (or impede) parallelization of the resulting Hamiltonian-simulation algorithm. It is shown that this problem can be mapped to a path coloring problem on a graph constructed from the particular choice of encoding fermions onto qubits and the fermionic interactions onto paths. The basic version of this problem is called the weak coloring problem. Taking into account the fine-grained details of the mapping yields what is called the strong coloring problem, which leads to improved parallelization performance. A variety of illustrative analytical and numerical examples are presented to demonstrate the amount of improvement for both weak and strong coloring-based parallelizations. Our results are particularly important for implementation on near-term quantum processors where minimizing circuit depth is necessary for algorithmic feasibility.

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

↑