Trace monoids with idempotent generators and measure-only quantum automata
From MaRDI portal
Publication:5962066
DOI10.1007/S11047-009-9154-8zbMath1207.68181OpenAlexW1995432494MaRDI QIDQ5962066
Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
Publication date: 16 September 2010
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-009-9154-8
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)
Related Items (10)
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers* ⋮ Complexity of Promise Problems on Classical and Quantum Automata ⋮ Size lower bounds for quantum automata ⋮ On the Power of One-Way Automata with Quantum and Classical States ⋮ Unnamed Item ⋮ Quantum finite automata: advances on Bertoni's ideas ⋮ Removing nondeterminism in constant height pushdown automata ⋮ The descriptional power of queue automata of constant length ⋮ Descriptional complexity of iterated uniform finite-state transducers ⋮ Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power
Cites Work
- Regular languages accepted by quantum automata
- Quantum computation by measurement and quantum memory
- Algebraic results on quantum automata
- Combinatorial problems of commutation and rearrangements
- Characterizations of 1-Way Quantum Finite Automata
- On the definition of a family of automata
- Notes on finite asynchronous automata
- An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Complexity Theory
- Probability Inequalities for Sums of Bounded Random Variables
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Trace monoids with idempotent generators and measure-only quantum automata
