Equivalence checking of quantum finite-state machines

DOI10.1016/J.JCSS.2020.08.004MaRDI QIDQ2220441zbMATH OpenOpenAlexFDO

Authors Qisheng Wang, Junyi Liu, Mingsheng Ying

Publication date 22 January 2021

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1901.02173

zbMATH Keywords

quantum computingminimisationquantum circuitsMealy machinesequivalence checking

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68)

Recommendations

• A note on quantum sequential machines
• Determining the equivalence for one-way quantum finite automata
• scientific article; zbMATH DE number 2080997
• Determination of equivalence between quantum sequential machines
• Multi-letter quantum finite automata: decidability of the equivalence and minimization of states

Cites work

• scientific article; zbMATH DE number 2040892 (Why is no real title available?)
• scientific article; zbMATH DE number 2080997 (Why is no real title available?)
• scientific article; zbMATH DE number 3371972 (Why is no real title available?)
• A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
• Algorithms in real algebraic geometry
• Characterization of sequential quantum machines
• Characterizations of 1-Way Quantum Finite Automata
• Characterizations of one-way general quantum finite automata
• Determination of equivalence between quantum sequential machines
• Determining the equivalence for one-way quantum finite automata
• Equivalence checking of quantum protocols
• Model-checking linear-time properties of quantum systems
• Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
• On the complexity of minimizing probabilistic and quantum automata
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• Probabilistic model of fault detection in quantum circuits
• Property checking of quantum circuits using quantum multiple-valued decision diagrams
• Quantum automata and quantum grammars
• Quantum computers.
• Reachability Probabilities of Quantum Markov Chains
• Stability and Complexity of Minimising Probabilistic Automata
• Switching and Finite Automata Theory
• Testing finite-state machines: state identification and verification

Cited in

(6)

• Quantum Büchi automata
• scientific article; zbMATH DE number 2080997 (Why is no real title available?)
• A note on quantum sequential machines
• Determination of equivalence between quantum sequential machines
• Equivalence checking in multi-level quantum systems
• Fast equivalence-checking for quantum circuits

This page was built for publication: Equivalence checking of quantum finite-state machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220441)