We devise greedy heuristics tailored for synthesizing quantum circuits that implement a specified set of Pauli rotations. Our heuristics are designed to minimize either the count of entangling gates or the depth of entangling gates, and they can be adjusted to either maintain or loosen the ordering of rotations. We present benchmark results demonstrating a depth reduction of up to a factor of 4 compared to the current state-of-the-art heuristics for synthesizing Hamiltonian simulation circuits. We also show that these heuristics can be used to optimize generic quantum circuits by decomposing and resynthesizing them.

翻译：我们设计了一种专门用于合成实现指定泡利旋转集的量子电路的贪心启发式算法。该算法旨在最小化纠缠门数量或纠缠门深度，并可调整以保持或放宽旋转顺序。基准测试结果表明，与当前最先进的哈密顿量模拟电路合成启发式算法相比，我们的方法实现了最高4倍的深度缩减。我们还展示了这些启发式算法可通过分解与重新合成来优化通用量子电路。