Partial equivalence checking of quantum circuits
Equivalence checking of quantum circuits is an essential element in quantum program
compilation, in which a quantum program can be synthesized into different quantum circuits …
compilation, in which a quantum program can be synthesized into different quantum circuits …
[图书][B] Model Checking Quantum Systems: Principles and Algorithms
Model checking is one of the most successful verification techniques and has been widely
adopted in traditional computing and communication hardware and software industries. This …
adopted in traditional computing and communication hardware and software industries. This …
Equivalence checking of sequential quantum circuits
We define a formal framework for equivalence checking of sequential quantum circuits. The
model we adopt is a quantum state machine, which is a natural quantum generalization of …
model we adopt is a quantum state machine, which is a natural quantum generalization of …
Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages
A Colledan, U Dal Lago - Proceedings of the ACM on Programming …, 2025 - dl.acm.org
We introduce a type system for the Quipper language designed to derive upper bounds on
the size of the circuits produced by the typed program. This size can be measured according …
the size of the circuits produced by the typed program. This size can be measured according …
DisQ: A Markov Decision Process Based Language for Quantum Distributed Systems
L Chang, S Yavvari, R Cleaveland, S Basu… - arXiv preprint arXiv …, 2024 - arxiv.org
The development of quantum computers has reached a great milestone, in spite of
restrictions on important quantum resources: the number of qubits being entangled at a …
restrictions on important quantum resources: the number of qubits being entangled at a …
Model-Based Testing of Quantum Computations
M Lochau, I Schaefer - International Conference on Tests and Proofs, 2024 - Springer
Quantum computers are able to effectively solve certain types of problems being intractable
by classical computers, including tasks from linear optimization, machine learning and …
by classical computers, including tasks from linear optimization, machine learning and …
Supervisory Control of Quantum Discrete Event Systems
D Qiu - arXiv preprint arXiv:2104.09753, 2021 - arxiv.org
Discrete event systems (DES) have been deeply developed and applied in practice, but
state complexity in DES still is an important problem to be better solved with innovative …
state complexity in DES still is an important problem to be better solved with innovative …
Quantum Büchi automata
Quantum finite automata (QFAs) have been extensively studied in the literature. In this
paper, we define and systematically study quantum Büchi automata (QBAs) over infinite …
paper, we define and systematically study quantum Büchi automata (QBAs) over infinite …