The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Optimal lower bounds for quantum automata and random access codes
Open accessAbstract
Consider the finite regular language L/sub n/={w0|w/spl isin/{0,1}*,|w|/spl les/n}. A. Ambainis et al. (1999) showed that while this language is accepted by a deterministic finite automaton of size O(n), any one-way quantum finite automaton (QFA) for it has size 2/sup /spl Omega/(n/logn)/. This was based on the fact that the evolution of a QFA is required to be reversible. When arbitrary intermediate measurements are allowed, this intuition breaks down. Nonetheless, we show a 2/sup /spl Omega/(n)/ lower bound for such QFA for L/sub n/, thus also improving the previous bound. The improved bound is obtained from simple entropy arguments based on A.S. Holevo's (1973) theorem. This method also allows us to obtain an asymptotically optimal (1-H(p))n bound for the dense quantum codes (random access codes) introduced by A. Ambainis et al. We then turn to Holevo's theorem, and show that in typical situations, it may be replaced by a tighter and more transparent in-probability bound.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Quantum Theory: Concepts and Methods
Peres, A., & Ballentine, L. E. (1995) · American Journal of Physics · doi:10.1119/1.17946 · Cited by 2,561
Wehrl, A. (1978) · Reviews of Modern Physics · doi:10.1103/revmodphys.50.221 · Cited by 1,963
Chor, B., Goldreich, O., Kushilevitz, E., & Sudan, M. (2002) · Proceedings of IEEE 36th Annual Foundations of Computer Science · doi:10.1109/sfcs.1995.492461 · Cited by 1,116
Quantum Theory: Concepts and Methods
Peres, A., & Mayer, M. E. (1994) · Physics Today · doi:10.1063/1.2808757 · Cited by 672
Chi-Chih Yao, A. (2002) · Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science · doi:10.1109/sfcs.1993.366852 · Cited by 633
Quantum circuits with mixed states
Aharonov, D., Kitaev, A., & Nisan, N. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276708 · Cited by 428
On the power of quantum finite state automata
Kondacs, A., & Watrous, J. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646094 · Cited by 346
1-way quantum finite automata: strengths, weaknesses and generalizations
Ambainis, A., & Freivalds, R. (2002) · Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) · doi:10.1109/sfcs.1998.743469 · Cited by 220
Dense quantum coding and a lower bound for 1-way quantum automata
Ambainis, A., Nayak, A., Ta‐Shma, A., & Vazirani, U. V. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/301250.301347 · Cited by 149
Self-citation
Cited by
Nonlocality and communication complexity
Buhrman, H., Cleve, R., Massar, S., & de Wolf, R. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.665 · Cited by 622
Self-testing of quantum systems: a review
Šupić, I., & Bowles, J. (2020) · Quantum · doi:10.22331/q-2020-09-30-337 · Cited by 365
The Uncertainty Principle Determines the Nonlocality of Quantum Mechanics
Oppenheim, J., & Wehner, S. (2010) · Science · doi:10.1126/science.1192065 · Cited by 365
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
Self-citationThe Bounded-Storage Model in the Presence of a Quantum Adversary
Konig, R. T., & Terhal, B. M. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.913245 · Cited by 65
Metadata
- Authors
- Nayak, A.
- Venue
- 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
- Publisher
- IEEE Comput. Soc
- Published
- 2003-01-20
- Pages
- 369-376
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W1839137787
- Cited by
- 275
- References
- 12
- FWCI
- 11.05
- 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: Optimal lower bounds for quantum automata and random access codes. https://app.cochat.ai/papers/10.1109/sffcs.1999.814608
- The paper
- Nayak, A. (2003). Optimal lower bounds for quantum automata and random access codes. 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039). https://doi.org/10.1109/sffcs.1999.814608
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.