论文标题
纠缠和四元素:图形微积分ZQ
Entanglement and Quaternions: The graphical calculus ZQ
论文作者
论文摘要
图形分解是代表和推理量子电路和过程的重要工具。有些不仅在图形上直观,而且在逻辑上完成。其中最著名的是ZX-Calculus,它是中间代表的行业候选人。算法设计师的意图与量子硬件的门说明之间的语言。 ZX微积分是由广义Z和X旋转构建的,难以推理任意旋转。这与使用这些任意旋转来利用硬件效率的跨硬件编译器TRIQ形成鲜明对比。在本文中,我们介绍了图形的微积分ZQ,该ZQ使用四元组表示这些任意旋转,类似于Triq,而无相Z蜘蛛表示代表纠缠,类似于ZX。我们表明,对于量子量子计算,这种演算是合理的,并且还表明基于完全蜘蛛的表示是不可能的。这种新的演算扩展了Qubit图形微积分的动物园,每个动物园都具有不同的优势,我们希望它将为ZX和TRIQ的优化过程提供通用语言。
Graphical calculi are vital tools for representing and reasoning about quantum circuits and processes. Some are not only graphically intuitive but also logically complete. The best known of these is the ZX-calculus, which is an industry candidate for an Intermediate Representation; a language that sits between the algorithm designer's intent and the quantum hardware's gate instructions. The ZX calculus, built from generalised Z and X rotations, has difficulty reasoning about arbitrary rotations. This contrasts with the cross-hardware compiler TriQ which uses these arbitrary rotations to exploit hardware efficiencies. In this paper we introduce the graphical calculus ZQ, which uses quaternions to represent these arbitrary rotations, similar to TriQ, and the phase-free Z spider to represent entanglement, similar to ZX. We show that this calculus is sound and complete for qubit quantum computing, while also showing that a fully spider-based representation would have been impossible. This new calculus extends the zoo of qubit graphical calculi, each with different strengths, and we hope it will provide a common language for the optimisation procedures of both ZX and TriQ.