Exact results for accepting probabilities of quantum automata-Reference-Cited by-同舟云学术

Exact results for accepting probabilities of quantum automata

Published:2003-02 Issue:1-3 Volume:295 Page:3-25
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Ambainis Andris,Ķikusts Arnolds

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference18 articles.

1. D. Aharonov, M. Ben-Or, Russell Impagliazzo, Noam Nisan, Limitations of noisy reversible computation, quant-ph/9611028.33quant-ph preprints are available at http://www.arxiv.org/abs/quant-ph/preprint-number

2. A. Ambainis, R. Bonner, R. Freivalds, A. Ķikusts, Probabilities to accept languages by quantum finite automata. Proc. COCOON’99, pp. 174–183. Also quant-ph/9904066.

3. A. Ambainis, R. Freivalds, One-way quantum finite automata: strengths, weaknesses and generalizations, Proc. FOCS’98, pp. 332–341. Also quant-ph/9802062.

4. A. Ambainis, A. Ķikusts, M. Valdats, On the class of languages recognizable by 1-way quantum finite automata, Proc. STACS’01, pp. 75–86. Also quant-ph/0009004.

5. A. Ambainis, J. Watrous, Quantum finite automata revisited, in preparation, 2002.

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deterministic Construction of QFAs Based on the Quantum Fingerprinting Technique;Lobachevskii Journal of Mathematics;2023-02

2. Four Collaborations with Rūsiņš Freivalds;Baltic Journal of Modern Computing;2016-12-19

3. Quantum Automata with Open Time Evolution;Nature-Inspired Computing Design, Development, and Applications;2012

4. Quantum Automata Theory – A Review;Algebraic Foundations in Computer Science;2011

5. On the Weakness of One-Way Quantum Pushdown Automata;2010 Fourth International Conference on Quantum, Nano and Micro Technologies;2010-02