当前位置: X-MOL 学术arXiv.cs.CC › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Deterministic Algorithms for Compiling Quantum Circuits with Recurrent Patterns
arXiv - CS - Computational Complexity Pub Date : 2021-02-17 , DOI: arxiv-2102.08765
Davide Ferrari, Ivano Tavernelli, Michele Amoretti

Current quantum processors are noisy, have limited coherence and imperfect gate implementations. On such hardware, only algorithms that are shorter than the overall coherence time can be implemented and executed successfully. A good quantum compiler must translate an input program into the most efficient equivalent of itself, getting the most out of the available hardware. In this work, we present novel deterministic algorithms for compiling recurrent quantum circuit patterns in polynomial time. In particular, such patterns appear in quantum circuits that are used to compute the ground state properties of molecular systems using the variational quantum eigensolver (VQE) method together with the RyRz heuristic wavefunction Ansatz. We show that our pattern-oriented compiling algorithms, combined with an efficient swapping strategy, produces - in general - output programs that are comparable to those obtained with state-of-art compilers, in terms of CNOT count and CNOT depth. In particular, our solution produces unmatched results on RyRz circuits.

中文翻译:

具有递归模式的量子电路编译的确定性算法

当前的量子处理器是嘈杂的,具有有限的相干性和不完善的门实现。在这样的硬件上,只有比整体相干时间短的算法才能成功实现和执行。一个好的量子编译器必须将输入程序转换为自身效率最高的等效程序,以充分利用可用的硬件。在这项工作中,我们提出了新颖的确定性算法,用于在多项式时间内编译循环量子电路模式。特别是,这种模式出现在量子电路中,该量子电路用于使用变分量子本征求解器(VQE)方法和RyRz启发式波函数Ansatz来计算分子系统的基态特性。我们证明了面向模式的编译算法与有效的交换策略相结合,就CNOT计数和CNOT深度而言,通常生成的输出程序与使用最新编译器获得的输出程序相当。特别是,我们的解决方案在RyRz电路上产生了无与伦比的结果。
更新日期:2021-02-18
down
wechat
bug