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/HOL 将量子算法形式化并产生量子信息理论的持续努力。正式方法对于算法和协议的安全性和保障性至关重要，我们预计它们在未来将广泛用于量子计算。我们在 Isabelle 开发了一个基于量子电路矩阵表示的大型量子计算库，成功地形式化了不可克隆定理、量子隐形传态、Deutsch 算法、Deutsch-Jozsa 算法和量子囚徒困境。我们讨论了所做的设计选择，并报告了我们在量子博弈论领域的工作成果。