Some formal tools for analyzing quantum automata.
From MaRDI portal
Publication:2490805
DOI10.1016/j.tcs.2006.01.042zbMath1160.68375OpenAlexW1989468189MaRDI QIDQ2490805
Carlo Mereghetti, Beatrice Palano, Alberto Bertoni
Publication date: 18 May 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.042
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)
Related Items (11)
Complexity of Promise Problems on Classical and Quantum Automata ⋮ From Quantum Query Complexity to State Complexity ⋮ Potential of Quantum Finite Automata with Exact Acceptance ⋮ Size lower bounds for quantum automata ⋮ On the Power of One-Way Automata with Quantum and Classical States ⋮ Lifting query complexity to time-space complexity for two-way finite automata ⋮ Preface ⋮ Quantum automata for some multiperiodic languages ⋮ Promise problems solved by quantum and classical finite automata ⋮ Quantum finite automata: advances on Bertoni's ideas ⋮ Quantum finite automata with control language
Cites Work
- The complexity of linear problems in fields
- Model theory
- Quantum automata and quantum grammars
- Regular languages accepted by quantum automata
- Quantum automata and algebraic groups
- Small size quantum automata recognizing some regular languages
- Characterizations of 1-Way Quantum Finite Automata
- Properties of Finite and Pushdown Transducers
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Complexity Theory
- Some decision problems on integer matrices
- On the Size of One-way Quantum Finite Automata with Periodic Behaviors
- Decidable and Undecidable Problems about Quantum Automata
- Probability Inequalities for Sums of Bounded Random Variables
- Probabilistic automata
- Theoretical Computer Science
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Some formal tools for analyzing quantum automata.
