Attila Kondacs, John Watrous  Home/Search
Context Related
| iro.umontreal.ca/~watrous/qfa.ps wisc.edu/~watrous/qfa.ps cpsc.ucalgary.ca/~jwatrous/pap...qfa.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iro.umontreal.ca/~watrou...papers (more) From: wisc.edu/~watrous/publications (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we introduce 1-way and 2-way quantum finite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and probabilistic 1-way and 2-way finite state automata. We prove the following facts regarding 2qfa's. 1. For any ffl ? 0, there is a 2qfa M which recognizes the non-regular language L = fa m b m j m 1g with (one-sided) error bounded by ffl, and which halts in linear time. Specifically, M accepts any string in L with probability ... (Update)
Context of citations to this paper: More
...memory inductive inference machines. 3 Quantum Finite Automata Quantum finite automata were introduced by A. Kondacs and J. Watrous [KW97] (another but much weaker definition was considered by C. Moore and J. Crutchfield [MC00] the technical report version of which was published...
.... of quantum pushdown automata in a non equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [KW 97] It is established that the unitarity criteria of quantum pushdown automata are not equivalent to the corresponding unitarity...
Cited by: More
Quantum Automata and Algebraic Groups - Derksen, Jeandel, Koiran (2003) (Correct)
Dense Quantum Coding and a Lower Bound for 1-way.. - Ambainis, Nayak.. (1999) (Correct)
On Quantum Pushdown Automata - Golovkins (Correct)
Similar documents (at the sentence level):
43.0%: On the Power of 2-Way Quantum Finite State Automata - Watrous (1997) (Correct)
Active bibliography (related documents): More All
0.3: Modeling the operation of Margolus quantum cellular automaton.. - Parviainen (2002) (Correct)
0.3: Quantum Complexity Theory - Bernstein, Vazirani (1997) (Correct)
0.3: Alternative Computational Models: A Comparison of Biomolecular and .. - Reif (1998) (Correct)
Similar documents based on text: More All
0.7: Exact Results for Accepting Probabilities of Quantum Automata - Ambainis, Kikusts (2001) (Correct)
0.6: On the Class of Languages Recognizable By 1-Way Quantum .. - Ambainis, Kikusts.. (Correct)
0.5: Characterizations of 1-Way Quantum Finite Automata - Brodsky, Pippenger (Correct)
Related documents from co-citation: More All
11: way quantum finite automata: strengths (context) - Ambainis, Freivalds
11: Quantum complexity theory - Bernstein, Vazirani - 1993
10: Online preprint quant-ph (context) - Benioff, Robots et al. - 1997
BibTeX entry: (Update)
A. Kondacs and J. Watrous. On the power of quantum finite state automata. In 38th Annual Symposium on Foundations of Computer Science, pages 66-75, Miami Beach, Florida, (October 1997). IEEE. http://citeseer.ist.psu.edu/kondacs97power.html More
@inproceedings{ kondacs97power,
author = "Attila Kondacs and John Watrous",
title = "On the Power of Quantum Finite State Automata",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "66-75",
year = "1997",
url = "citeseer.ist.psu.edu/kondacs97power.html" }
Citations (may not include all citations):259 Elements of the Theory of Computation (context) - Lewis, Papadimitriou - 1981
210 A fast quantum mechanical algorithm for database search - Grover - 1996
173 Quantum complexity theory - Bernstein, Vazirani - 1993
168 Algorithms for quantum computation: discrete logarithms and .. - Shor - 1994
164 Polynomial-time algorithms for prime factorization and discr.. - Shor - 1996
144 the power of quantum computation - Simon - 1994
126 Rapid solutions of problems by quantum computation (context) - Deutsch, Jozsa - 1992
118 the Church-Turing principle and the universal quantum comput.. (context) - Deutsch - 1985
96 Finite automata and their decision problems (context) - Rabin, Scott - 1959
85 Quantum circuit complexity - Yao - 1993
70 Quantum computational networks (context) - Deutsch - 1989
52 Information and Control (context) - Rabin - 1963
46 An exact quantum polynomial-time algorithm for Simon's probl.. - Brassard, Hoyer - 1997
45 Quantum computation - Berthiaume - 1997
42 The quantum challenge to structural complexity theory - Berthiaume, Brassard - 1992
37 A potentially realizable quantum computer (context) - Lloyd - 1993
23 The reduction of two-way automata to one-way automata (context) - Shepherdson - 1959
23 Probabilistic two-way machines (context) - Freivalds - 1981
13 On one-dimensional quantum cellular automata - Watrous - 1995
13 Alternating pushdown and stack automata (context) - Ladner, Lipton et al. - 1984
13 A time-complexity gap for two-way probabilistic finite state.. (context) - Dwork, Stockmeyer - 1990
11 Santa Fe Institute Working Paper (context) - Moore, Crutchfield et al. - 1997
9 the power of 2-way probabilistic finite state automata (context) - Dwork, Stockmeyer - 1989
9 Reversible space equals deterministic space - Lange, McKenzie et al. - 1997
8 A decision procedure for well-formed linear quantum cellular.. - Durr, Le Thanh et al. - 1996
4 the languages accepted by finite reversible automata (context) - Pin - 1987
3 Annals of the New York Academy of Science (context) - Margolus - 1986
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.iro.umontreal.ca/~watrous/papers.html): More
On the Power of 2-Way Quantum Finite State Automata - Watrous (1997) (Correct)
Relationships Between Quantum and Classical Space-Bounded.. - Watrous (1998) (Correct)
On One-Dimensional Quantum Cellular Automata - Watrous (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC