Bordg Anthony, Lachnitt Hanna, He Yijun
Department of Computer Science and Technology, University of Cambridge, Cambridge, UK.
Computer Science Department, Stanford University, Stanford, USA.
J Autom Reason. 2021;65(5):691-709. doi: 10.1007/s10817-020-09584-7. Epub 2020 Dec 24.
In this article we present an ongoing effort to formalise quantum algorithms and results in quantum information theory using the proof assistant Isabelle/HOL. Formal methods being critical for the safety and security of algorithms and protocols, we foresee their widespread use for quantum computing in the future. We have developed a large library for quantum computing in Isabelle based on a matrix representation for quantum circuits, successfully formalising the no-cloning theorem, quantum teleportation, Deutsch's algorithm, the Deutsch-Jozsa algorithm and the quantum Prisoner's Dilemma. We discuss the design choices made and report on an outcome of our work in the field of quantum game theory.
在本文中,我们展示了一项正在进行的工作,即使用证明助手Isabelle/HOL将量子算法形式化,并得出量子信息论中的结果。形式化方法对于算法和协议的安全性至关重要,我们预计其未来将在量子计算中得到广泛应用。我们基于量子电路的矩阵表示,在Isabelle中开发了一个用于量子计算的大型库,成功地将不可克隆定理、量子隐形传态、德伊奇算法、德伊奇 - 若萨算法以及量子囚徒困境形式化。我们讨论了所做的设计选择,并报告了我们在量子博弈论领域的工作成果。