The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
On the power of quantum finite state automata
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 /spl epsiv/>0, there is a 2qfa M which recognizes the non-regular language L={a/sup m/b/sup m/|m/spl ges/1} with (one-sided) error bounded by E, and which halts in linear time. Specifically, M accepts any string in L with probability 1 and rejects any string not in L with probability at least 1-/spl epsiv/. 2. For every regular language L, there is a reversible (and hence quantum) 2-way finite state automaton which recognizes L and which runs in linear time. In fact, it is possible to define 2qfar's which recognize the non-context-free language {a/sup m/b/sup m/c/sup m/|m/spl ges/1}, based on the same technique used for 1. Consequently, the class of languages recognized by linear time, bounded error 2qfa's properly includes the regular languages. Since it is known that 2-way deterministic, nondeterministic and polynomial expected time, bounded error probabilistic finite automata can recognize only regular languages, it follows that 2qfa's are strictly more powerful than these "classical" models. In the case of 1-way automata, the situation is reversed. We prove that the class of languages recognizable by bounded error 1qfa's is properly contained in the class of regular languages.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Rapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700
Finite Automata and Their Decision Problems
Rabin, M. O., & Scott, D. (1959) · IBM Journal of Research and Development · doi:10.1147/rd.32.0114 · Cited by 1,879
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Quantum computational networks
Deutsch, D. E. (1989) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1989.0099 · Cited by 1,270
Elements of the Theory of Computation
Lewis, H. R., & Papadimitriou, C. H. (1998) · ACM SIGACT News · doi:10.1145/300307.1040360 · Cited by 1,040
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649
Chi-Chih Yao, A. (2002) · Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science · doi:10.1109/sfcs.1993.366852 · Cited by 633
Cited by
Quantum automata and quantum grammars
Moore, C., & Crutchfield, J. P. (2000) · Theoretical Computer Science · doi:10.1016/s0304-3975(98)00191-1 · Cited by 406
Optimal lower bounds for quantum automata and random access codes
Nayak, A. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814608 · Cited by 275
Dense quantum coding and quantum finite automata
Ambainis, A., Nayak, A., Ta-Shma, A., & Vazirani, U. (2002) · Journal of the ACM · doi:10.1145/581771.581773 · Cited by 258
On the Hardness of Distinguishing Mixed-State Quantum Computations
Rosgen, B., & Watrous, J. (2005) · 20th Annual IEEE Conference on Computational Complexity (CCC'05) · doi:10.1109/ccc.2005.21 · Cited by 70
Self-citation
Metadata
- Authors
- Kondacs, A., & Watrous, J.
- Venue
- Proceedings 38th Annual Symposium on Foundations of Computer Science
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-22
- Pages
- 66-75
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2115757125
- Cited by
- 346
- References
- 19
- FWCI
- 11.58
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the power of quantum finite state automata. https://app.cochat.ai/papers/10.1109/sfcs.1997.646094
- The paper
- Kondacs, A., & Watrous, J. (2002). On the power of quantum finite state automata. Proceedings 38th Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1997.646094
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.