arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.03178quant-phcs.LOmath.CO
收藏

量子线路的ZX演算图论简化

Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus

Ross Duncan, Aleks Kissinger, Simon Perdrix, John van de Wetering

摘要:

我们提出了一个全新的方法来优化量子线路,基于ZX演算。我们首先将量子线路解释为ZX图,它提供了一种灵活的、较低层次的语言来图形化地描述量子计算。然后,利用ZX-演算的规则,给出了基于局部互补和旋转两种图变换的ZX-图的简化策略,并证明了简化后的ZX-图可以变换回一个量子线路.虽然很少有人知道从任意ZX-图提取电路,我们表明,我们的简化ZX-图的基本图形总是有一个图论属性称为广义流,这反过来又产生一个确定性的电路提取过程。对于Clifford电路,这种提取过程产生了一个新的正规形式,这是渐近最优的大小,并给出了一个新的,较小的上限门深度最近邻架构。对于Clifford+T和更一般的电路,我们的技术使我们能够“看到周围”的门,阻碍Clifford结构,并产生比天真的“切割和重新合成”的方法更小的电路。

英文摘要:

We present a completely new approach to quantum circuit optimisation, based on the ZX-calculus. We first interpret quantum circuits as ZX-diagrams, which provide a flexible, lower-level language for describing quantum computations graphically. Then, using the rules of the ZX-calculus, we give a simplification strategy for ZX-diagrams based on the two graph transformations of local complementation and pivoting and show that the resulting reduced diagram can be transformed back into a quantum circuit. While little is known about extracting circuits from arbitrary ZX-diagrams, we show that the underlying graph of our simplified ZX-diagram always has a graph-theoretic property called generalised flow, which in turn yields a deterministic circuit extraction procedure. For Clifford circuits, this extraction procedure yields a new normal form that is both asymptotically optimal in size and gives a new, smaller upper bound on gate depth for nearest-neighbour architectures. For Clifford+T and more general circuits, our technique enables us to to `see around' gates that obstruct the Clifford structure and produce smaller circuits than naive 'cut-and-resynthesise' methods.

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

↑