Algebraic results on quantum automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2996, Issue , 2004, Pages 93-104

  Ambainis, Andris ^a   Beaudry, Martin ^b   Golovkins, Marats ^a   Kikusts, Arnolds ^a   Mercer, Mark ^c   Thérien, Denis ^c  

^a UNIVERSITY OF LATVIA   (Latvia)

^b UNIVERSITÉ DE SHERBROOKE   (Canada)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL LINGUISTICS; MAGNETIC RESONANCE; QUANTUM COMPUTERS;

ALGEBRAIC THEORIES; BOOLEAN COMBINATIONS; QUANTUM AUTOMATA; QUANTUM FINITE AUTOMATA; QUANTUM MACHINES;

NUCLEAR MAGNETIC RESONANCE;

EID: 33749554137     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24749-4_9     Document Type: Article

References (26)

1. A. Ambainis and R. Freivalds. I-way Quantum Finite Automata: Strengths, Weaknesses, and Generalizations. Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, pp. 332-341. 1998.
2. A. Ambainis, A. Kikusts: Exact Results for Accepting Probabilities of Quantum Automata. Theoretical Computer Science, 295, pp. 3-25, 2003.
3. D. Aharonov, A. Ambainis, Julia Kempe, Umesh Vazirani. Quantum walks on graphs. Proceedings of STOC'01, pp. 50-59.
4. A. Ambainis, A. Kikusts, and M. Valdats. On the class of Languages Recognized by 1-way Quantum Finite Automata. Proceedings of STACS 2001, pp. 75-86. 2001.
5. A. Ambainis, A. Nayak, A. Ta-Shma and U. Vazirani. Quantum dense coding and quantum finite automata. Journal of ACM, 49, pp. 496-511, 2002.
6. M. Beaudry, F. Lemieux, and D. Thérien. Finite loops recognize exactly the regular open languages, Proceedings of the 24th ICALP Colloquium on Automata, Languages and Programming, LNCS 1256, Springer-Verlag. 1997.
7. A. Bertoni, C. Mereghetti, B. Palano. Quantum computing: 1- way quantum finite automata. Proceedings of DLT'2003, LNCS 2730, pp. 1-20. 2003.
8. A. Brodsky and N. Pippenger. Characterizations of 1-Way Quantum Finite Automata", SIAM Journal on Computing, 31(5), pp. 1456-1478, 2002.
9. M. P. Ciamarra. Quantum Reversibility and a New Model of Quantum Automaton. FCT 2001, pp. 376-379.
10. S. Eilenberg. Automata, Languages and Machines Vol B. Academic Press. 1976.
11. C. Fuchs, J. van de Graaf. Cryptographic distinguishability measures for quantum mechanical states. IEEE Transactions on Information Theory, 45(4), pp. 1216-1227, 1999.
12. M. Golovkins and M. Kravtsev. Probabilistic Reversible Automata and Quantum Automata. COCOON 2002. pp. 574-583. 2002.
13. J. Gruska. Quantum Computing. McGraw-Hill, p. 160. 1999.
14. P. Jeavons, D. Cohen and M. Gyssens. Closure Properties of Constraint Satisfaction Problems. JACM, 44, 4. pp. 527-548. 1997.
15. A. Kondacs and J. Watrous. On the power of Quantum Finite State Automata. FOCS 1997, pp. 66-75. 1997.
16. A. Marshall, I. Olkin. Inequalities: Theory of Majorization and Its Applications. Academic Press, 1979.
17. C Moore, J. Crutchfield. Quantum Automata and Quantum Grammars. Theoretical Computer Science, 237(1-2), pp. 275-306, 2000.
18. A. Nayak. Optimal Lower Bounds for Quantum Automata and Random Access Codes. Proc. 40th FOCS, pp 369-377. 1997.
19. M. Nielsen, I. Chuang. Quantum Computation and Quantum Information, Cambridge University Press, 2000.
20. J. E. Pin. BG=PG: A success story. NATO Advanced Study Institute Semigroups, Formal Languages and Groups, pp. 33-47. 1995.
21. J. E. Pin. On languages accepted by finite reversible automata. Proceedings of the 14th International Colloquium on Automata, Languages, and Programming. LNCS 267, pp. 237-249. 1987.
22. J. E. Pin, A variety theorem without complementation, Russian Mathematics (Izvestija vuzov.Matematika) 39, pp. 80-90. 1995.
23. J. E. Pin. Varieties of Formal Languages. North Oxford Academic Publishers, Ltd, London. 1986.
24. M. Rabin. Probabilistic Automata. Information and Control, 6(3), pp. 230-245. September 1963.
25. I. Simon. Piecewise Testable Events. Proc. 2nd GI Conf., pp. 214-222, 1975.
26. L. Vandersypen, M. Steffen, G. Breyta, C. Yannoni, M. Sherwood, I Chuang. Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance. Nature, 414, 883-887, 2001.