Quantum temporal logic and reachability problems of matrix semigroups
From MaRDI portal
Cites work
- (Un)decidable Problems about Reachability of Quantum Systems
- A note on recurring series
- A simple proof of the Skolem-Mahler-Lech theorem
- A Skolem-Mahler-Lech theorem in positive characteristic and finite automata
- A Skolem–Mahler–Lech Theorem for Iterated Automorphisms ofK–algebras
- COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME
- Decidability of the membership problem for \(2\times 2\) integer matrices
- Decidable and Undecidable Problems about Quantum Automata
- Eine arithmetische Eigenschaft der Taylor-Koeffizienten rationaler Funktionen.
- Elements of mathematics: from Euclid to Gödel
- Exact Quantum Algorithms for the Leader Election Problem
- Fast quantum byzantine agreement
- scientific article; zbMATH DE number 5708042 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1512853 (Why is no real title available?)
- scientific article; zbMATH DE number 3807678 (Why is no real title available?)
- scientific article; zbMATH DE number 3011327 (Why is no real title available?)
- scientific article; zbMATH DE number 871949 (Why is no real title available?)
- scientific article; zbMATH DE number 7204386 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 3056890 (Why is no real title available?)
- Model-checking linear-time properties of quantum systems
- Multiplicities of algebraic linear recurrences
- Multiplicities of recurrence sequences
- On infinite direct products.
- Polynomial Invariants for Affine Programs
- Quantum automata and quantum grammars
- Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model
- Quantum weakest preconditions
- Reachability analysis of quantum Markov decision processes
- Reachability and termination analysis of concurrent quantum programs
- Reachability Probabilities of Quantum Markov Chains
- Skolem meets schanuel
- Sublinear-time quantum computation of the diameter in CONGEST networks
- Termination of nondeterministic quantum programs
- The logic of quantum mechanics.
- The zero multiplicity of linear recurrence sequences
- Towards a quantum programming language
- Unsolvability in 3 × 3 Matrices
- Verification of concurrent programs: The automata-theoretic framework
This page was built for publication: Quantum temporal logic and reachability problems of matrix semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614888)
