Regular languages accepted by quantum automata

DOI10.1006/inco.2000.2911zbMath1003.68061OpenAlexW2053216403MaRDI QIDQ1854417

Marco Carpentieri, Alberto Bertoni

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/bebda90e37c599597208682a4863b755a44d74ca

Mathematics Subject Classification ID

Related Items (20)

Energy complexity of regular language recognition ⋮ Automata theory based on quantum logic: Some characterizations ⋮ Complexity of Promise Problems on Classical and Quantum Automata ⋮ Energy complexity of regular languages ⋮ Unnamed Item ⋮ Preface ⋮ GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA ⋮ Quantum automata for some multiperiodic languages ⋮ Quantum finite automata: advances on Bertoni's ideas ⋮ Small size quantum automata recognizing some regular languages ⋮ Some formal tools for analyzing quantum automata. ⋮ Determination of equivalence between quantum sequential machines ⋮ Trace monoids with idempotent generators and measure-only quantum automata ⋮ Determining the equivalence for one-way quantum finite automata ⋮ Some algebraic properties of measure-once two-way quantum finite automata ⋮ Efficient probability amplification in two-way quantum finite automata ⋮ A note on quantum sequential machines ⋮ Characterizations of one-way general quantum finite automata ⋮ Quantum finite automata with control language ⋮ On hybrid models of quantum finite automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum mechanical Hamiltonian models of Turing machines
• An introduction to Hilbert space and quantum logic
• Quantum computational networks
• Quantum Computation
• Characterizations of 1-Way Quantum Finite Automata
• Rapid solution of problems by quantum computation
• A method for obtaining digital signatures and public-key cryptosystems
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Realizable Universal Quantum Logic Gates
• Quantum complexity theory
• Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines
• Logical Reversibility of Computation
• Analogies and differences between quantum and stochastic automata

This page was built for publication: Regular languages accepted by quantum automata