Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 220

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

1-way quantum finite automata: strengths, weaknesses and generalizations

Open access
Ambainis, A., Freivalds, R. · 2002 · Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)

Abstract

We study 1-way quantum finite automata (QFAs). First, we compare them with their classical counterparts. We show that, if an automaton is required to give the correct answer with a large probability (greater than 7/9), then any 1-way QFAs can be simulated by a 1-way reversible automaton. However, quantum automata giving the correct answer with smaller probabilities are more powerful than reversible automata. Second, we show that 1-way QFAs can be very space-efficient. We construct a 1-way QFA that is exponentially smaller than any equivalent classical (even randomized) finite automaton. We think that this construction may be useful for design of other space-efficient quantum algorithms. Third, we consider several generalizations of 1-way QFAs. Here, our goal is to find a model which is more powerful than 1-way QFAs keeping the quantum part as simple as possible.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/sfcs.1998.743469

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 2 references

Cited by

See all 220

Metadata

Authors
Ambainis, A., & Freivalds, R.
Venue
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
Published
2002-11-27
Pages
332-341
ISSN
0272-5428 (ISSN-L)
OpenAlex
W2146407322
Cited by
220
References
2
FWCI
8.70
Type
conference paper
Language
en
Open access
green

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: 1-way quantum finite automata: strengths, weaknesses and generalizations. https://app.cochat.ai/papers/10.1109/sfcs.1998.743469
The paper
Ambainis, A., & Freivalds, R. (2002). 1-way quantum finite automata: strengths, weaknesses and generalizations. Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280). https://doi.org/10.1109/sfcs.1998.743469

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.