Symbolic Reasoning about Quantum Circuits in Coq
arXiv:2005.11023 · doi:10.1007/s11390-021-1637-9
Abstract
A quantum circuit is a computational unit that transforms an input quantum state to an output one. A natural way to reason about its behavior is to compute explicitly the unitary matrix implemented by it. However, when the number of qubits increases, the matrix dimension grows exponentially and the computation becomes intractable. In this paper, we propose a symbolic approach to reasoning about quantum circuits. It is based on a small set of laws involving some basic manipulations on vectors and matrices. This symbolic reasoning scales better than the explicit one and is well suited to be automated in Coq, as demonstrated with some typical examples.
arXiv commentarXiv admin note: text overlap with arXiv:1802.02648 by other authors
References in corpus (9)
- Automated optimization of large quantum circuits with continuous parameters
- Towards Large-scale Functional Verification of Universal Quantum Circuits
- QWIRE Practice: Formal Verification of Quantum Circuits in Coq
- A Deductive Verification Framework for Circuit-building Quantum Programs
- Quantum Relational Hoare Logic
- ReQWIRE: Reasoning about Reversible Quantum Circuits
- Formalization of Quantum Protocols using Coq
- Formalized linear algebra over Elementary Divisor Rings in Coq
- Verified Optimization in a Quantum Intermediate Representation