Related Experiment Video
Updated: Oct 14, 2025

Scalable Quantum Integrated Circuits on Superconducting Two-Dimensional Electron Gas Platform
Published on: August 2, 2019
Certified Quantum Computation in Isabelle/HOL
Anthony Bordg1, Hanna Lachnitt2, Yijun He3
1Department of Computer Science and Technology, University of Cambridge, Cambridge, UK.
Abstract:
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.
Related Concept Videos
Quantum Numbers
The Quantum-Mechanical Model of an Atom
Parseval's Theorem
Interestingly, Parseval's theorem also holds for the trigonometric form of the Fourier series, which...
Castigliano's Theorem
Lattice Centering and Coordination Number
Types of Unit Cells
Imagine taking a large number of identical...
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...

