Two-way finite automata with quantum and classical states

Theoretical Computer Science

Volumn 287, Issue 1, 2002, Pages 299-311

  Ambainis, Andris ^a   Watrous, John ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; POLYNOMIALS; PROBABILITY; QUANTUM THEORY;

QUANTUM COMPUTING;

FINITE AUTOMATA;

EID: 0037174192     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00138-X     Document Type: Article

References (21)

1. Quantum circuits with mixed states
2. 1-way quantum finite automata: Strengths, weaknesses and generalizations
3. Dense quantum coding and a lower bound for 1-way quantum automata
4. Quantum computation
5. A time-complexity gap for two-way probabilistic finite state automata
6. Finite state verifiers I: The power of interaction
7. Probabilistic two-way machines
8. A lower bound for probabilistic algorithms for finite state machines
9. A fast quantum mechanical algorithm for database search
10. Bounds for the quantity of information transmitted by a quantum communication channel
11. Running time to recognize nonregular languages by 2-way probabilistic automata
12. Quantum computations: Algorithms and error correction
13. On the power of quantum finite state automata
14. Quantum automata and quantum grammars
15. Optimal lower bounds for quantum automata and random access codes
16. Quantum information and computation
17. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer