On the Lower Bounds for One-Way Quantum Automata-Reference-Cited by-同舟云学术

On the Lower Bounds for One-Way Quantum Automata

Published:2000 Issue: Volume: Page:132-140
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Ablayev Farid,Gainutdinova Aida

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44612-5_9

Reference8 articles.

1. P. Alexandrov, Introduction to set theory and general topology, Moscow, Nauka, 1977 (in Russian).

2. A. Ambainis and R. Freivalds, 1-way quantum finite automata: strengths, weaknesses and generalization, In Proceeding of the 39th IEEE Conference on Foundation of Computer Science, 1998, 332–342. See also quant-ph/9802062 v3

3. A. Brodsky and N. Pippenger, Characterizations of 1-way quantum finite automata, quant-ph/9903014, 1999

4. http://xxx.lanl.gov/archive/quant-ph . See also its Russian mirror: http://xxx.itep.ru .

5. A. Kondacs, J. Watrous, On the power of quantum finite state automata. In Proceeding of the 38th IEEE Conference on Foundation of Computer Science, 1997, 66–75.

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

1. Unary probabilistic and quantum automata on promise problems;Quantum Information Processing;2017-12-26

2. Unary Probabilistic and Quantum Automata on Promise Problems;Developments in Language Theory;2015

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

4. Revisiting the Power and Equivalence of One-Way Quantum Finite Automata;Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence;2010

5. Some algebraic properties of measure-once two-way quantum finite automata;Quantum Information Processing;2008-09-16