Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Equivalence Checking of Quantum Circuits Based on Dirac Notation in Maude

Canh Minh Do, Kazuhiro Ogata

Published Jan 1, 2024• 3 citations
Publisher
DOI
10.1007/978-3-031-65941-6_5

Related papers

Equivalence Checking of Quantum Circuits with the ZX-Calculus

Lukas Burgholzer, Robert Wille

Springer eBooks•Jan 1, 2026•0 citations

Formal Verification of Quantum Arithmetic Circuits in Maude

Naoto Sato, Tsubasa Takagi

International Symposium on System Security, Safety, and Reliability (ISSSR)•May 1, 2026•0 citations

Fast Equivalence Checking of Quantum Circuits of Clifford Gates

Dimitrios Thanos, Tim J. Coopmans, Alfons Laarman

arXiv:2308.01206•Lecture notes in computer science•Jan 1, 2023•11 citations

Equivalence Checking of Quantum Circuits via Path-Sum and Weighted Model Counting

Wei‐Jia Huang, Christophe Chareton, Yu-Fang Chen +4 more

arXiv:2604.24504•Lecture notes in computer science•Jan 1, 2026•2 citations

Equivalence Checking of Parameterized Quantum Circuits: Verifying the Compilation ofVariational Quantum Algorithms

Lukas Burgholzer, Robert Wille

Springer eBooks•Jan 1, 2026•0 citations

Symbolic Model Checking Quantum Circuits in Maude

Canh Minh Do, Kazuhiro Ogata

This paper presents a symbolic approach to model checking quantum circuits by using a set of laws from quantum mechanics and basic matrix operations with Dirac notation.We use Maude, a high-level specification/programming language based on rewriting logic, to implement our symbolic approach.As a case study, we use the approach to formally specify and verify the correctness of the quantum teleportation protocol, which is an important quantum communication protocol in the early work of quantum communications.Moreover, our implementation can be used as a general framework to formally specify and verify quantum circuits in Maude in an effortless way, where only an initial quantum state and a sequence of actions describing how a quantum circuit works in a simple way are required.

Proceedings/Proceedings of the ... International Conference on Software Engineering and Knowledge Engineering•Jul 1, 2023•7 citations
This paper presents a symbolic approach to model checking quantum circuits by using a set of laws from quantum mechanics and basic matrix operations with Dirac notation.We use Maude, a high-level specification/programming language based on rewriting logic, to implement our symbolic approach.As a case study, we use the approach to formally specify and verify the correctness of the quantum teleportation protocol, which is an important quantum communication protocol in the early work of quantum communications.Moreover, our implementation can be used as a general framework to formally specify and verify quantum circuits in Maude in an effortless way, where only an initial quantum state and a sequence of actions describing how a quantum circuit works in a simple way are required.