On the Class of Languages Recognizable by 1-Way Quantum Finite Automata-Reference-Cited by-同舟云学术

On the Class of Languages Recognizable by 1-Way Quantum Finite Automata

Published: Issue: Volume: Page:75-86
ISSN:
Container-title:STACS 2001
language:
Short-container-title:

Author:

Ambainis1 Andris,KĶikusts Arnolds,Valdats Māris

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44693-1_7.pdf

Reference13 articles.

1. Lect Notes Comput Sci;A. Ambainis,1999

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

3. A. Ambainis, A. Nayak, A. Ta-Shma, U. Vazirani. Dense quantum coding and a lower bound for 1-way quantum automata. Proc. STOC’99, pp. 376–383. Also quant-ph/9804043.

4. A. Ambainis, J. Watrous. Two-way finite automata with quantum and classical states. cs.CC/9911009. Submitted to Theoretical Computer Science.

5. E. Bernstein, U. Vazirani, Quantum complexity theory. SIAM Journal on Computing, 26:1411–1473, 1997.

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

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

2. On Language Varieties Without Boolean Operations;Language and Automata Theory and Applications;2021

3. Simulations of Quantum Finite Automata;Lecture Notes in Computer Science;2020

4. Quantum State Complexity of Formal Languages;Descriptional Complexity of Formal Systems;2015

5. High-level Structures for Quantum Computing;Synthesis Lectures on Quantum Computing;2012-05-31