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

参数化多量子比特 Pauli 门的最优、硬件原生分解

Optimal, hardware native decomposition of parameterized multi-qubit Pauli gates

P. V. Sriluckshmy, Vicente Pina-Canelles, Mario Ponce, Manuel G. Algaba, Fedor Šimkovic, Martin Leib

AI总结:

本文提出将参数化多量子比特 Pauli 门最优分解为硬件原生 P2QP 门的方法,给出任意硬件图下深度与门数的精确表达式,并通过 LHZ 映射联合优化多个门。

摘要:

我们展示了如何将参数化多量子比特 Pauli(PMQP)门高效分解为原生的参数化双量子比特 Pauli(P2QP)门,同时最小化电路深度和 P2QP 门的数量。给定一个现实的量子计算模型,我们论证该技术在硬件原生门数量和分解的总深度方面都是最优的。从路径和星形硬件图的 PMQP 门分解出发,我们将该过程推广到任意通用硬件图,并给出了分解的深度和 P2QP 门数量的精确表达式。此外,我们展示了如何高效组合多个 PMQP 门的分解,以利用 Lechner-Hauke-Zoller(LHZ)映射进一步降低组合优化问题的深度以及 P2QP 门数量。

英文摘要:

We show how to efficiently decompose a parameterized multi-qubit Pauli (PMQP) gate into native parameterized two-qubit Pauli (P2QP) gates minimizing both the circuit depth and the number of P2QP gates. Given a realistic quantum computational model, we argue that the technique is optimal in terms of the number of hardware native gates and the overall depth of the decomposition. Starting from PMQP gate decompositions for the path and star hardware graph, we generalize the procedure to any generic hardware graph and provide exact expressions for the depth and number of P2QP gates of the decomposition. Furthermore, we show how to efficiently combine the decomposition of multiple PMQP gates to further reduce the depth as well as the number of P2QP gates for a combinatorial optimization problem using the Lechner-Hauke-Zoller (LHZ) mapping.

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

↑