Learning quantum finite automata with queries
From MaRDI portal
Publication:6149966
DOI10.1017/s0960129523000373arXiv2111.14041MaRDI QIDQ6149966
Publication date: 5 March 2024
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.14041
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exponentially more concise quantum recognition of non-RMM regular languages
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
- Learning regular sets from queries and counterexamples
- Learning probabilistic automata and Markov chains via queries
- An improved lower bound on query complexity for quantum PAC learning
- Queries and concept learning
- Automata and quantum computing
- Quantum algorithms for learning symmetric juntas via the adversary bound
- Algebraic results on quantum automata
- Automata theory based on quantum logic: reversibilities and pushdown automata
- Determination of equivalence between quantum sequential machines
- Quantum Finite Automata: A Modern Introduction
- Learning Weighted Automata
- Characterizations of 1-Way Quantum Finite Automata
- The learnability of quantum states
- Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries
- Inference of Reversible Languages
- Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
- Equivalences and Separations Between Quantum and Classical Learnability
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
- Quantum discriminant analysis for dimensionality reduction and classification
This page was built for publication: Learning quantum finite automata with queries
