Quantum temporal logic and reachability problems of matrix semigroups
From MaRDI portal
Publication:6614888
DOI10.1016/J.IC.2024.105197MaRDI QIDQ6614888
Publication date: 8 October 2024
Published in: Information and Computation (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A simple proof of the Skolem-Mahler-Lech theorem
- Multiplicities of algebraic linear recurrences
- Multiplicities of recurrence sequences
- Quantum automata and quantum grammars
- The zero multiplicity of linear recurrence sequences
- Reachability analysis of quantum Markov decision processes
- Verification of concurrent programs: The automata-theoretic framework
- Termination of nondeterministic quantum programs
- A Skolem-Mahler-Lech theorem in positive characteristic and finite automata
- On infinite direct products.
- The logic of quantum mechanics.
- Eine arithmetische Eigenschaft der Taylor-Koeffizienten rationaler Funktionen.
- A note on recurring series
- Elements of mathematics: from Euclid to Gödel
- Reachability Probabilities of Quantum Markov Chains
- Reachability and Termination Analysis of Concurrent Quantum Programs
- Model-Checking Linear-Time Properties of Quantum Systems
- Exact Quantum Algorithms for the Leader Election Problem
- (Un)decidable Problems about Reachability of Quantum Systems
- Fast quantum byzantine agreement
- Decidability of the Membership Problem for 2 × 2 integer matrices
- Towards a quantum programming language
- COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME
- A Skolem–Mahler–Lech Theorem for Iterated Automorphisms ofK–algebras
- Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model
- Polynomial Invariants for Affine Programs
- Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks
- Decidable and Undecidable Problems about Quantum Automata
- Quantum weakest preconditions
- Unsolvability in 3 × 3 Matrices
- Skolem meets schanuel
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)
