论文标题
fermionic系统量子模拟的并行化技术
Parallelization techniques for quantum simulation of fermionic systems
论文作者
论文摘要
将费米子操作员映射到Qubit Operators是模拟量子计算机上的费米管系统的重要步骤。我们研究了这种映射的选择如何与量子处理器的基本量子量子连接性相互作用，以实现（或阻碍）所得的哈密顿式仿真算法的平行化（或阻碍）并行化。结果表明，该问题可以映射到从特定选择的Qubits上编码费米子和fermionic相互作用到路径上的图形上的路径着色问题。此问题的基本版本称为弱着色问题。考虑到映射的细粒细节会产生所谓的强着色问题，从而改善并行性能。提出了各种说明性的分析和数值示例，以证明基于弱色和强的并行化的改进量。我们的结果对于在近期量子处理器上实施尤其重要，在算法可行性中需要最小化电路深度。
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.
