Quantum computing: 1-way quantum automata

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

Volumn 2710, Issue , 2003, Pages 1-20

  Beŕtoni, Alberto ^a   Mereghetti, Carlo ^a   Palano, Beatrice ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

Formal power series; Quantum finite automata

Indexed keywords

COMPUTATIONAL LINGUISTICS; FINITE AUTOMATA; QUANTUM COMPUTERS;

BOOLEAN OPERATIONS; FORMAL POWER SERIES; GENERAL MODEL; HADAMARD PRODUCTS; LINEAR COMBINATIONS; QUANTUM AUTOMATA; QUANTUM COMPUTING; QUANTUM FINITE AUTOMATA;

COMPUTATION THEORY;

EID: 33749580217     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45007-6_1     Document Type: Article

References (31)

1. A. Ambainis and R. Freivalds. 1-way quantum finite automata: strengths, weaknesses and generalizations. In Proc. 39th Symposium on Foundations of Computer Science, pp. 332-342, 1998.
2. A. Ambainis, A. Kikusts, and M. Valdats. On the class of languages recognizable by 1-way quantum finite automata. In Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 2010, Springer, pp. 305-316, 2001. Also as Technical Report quant-ph/0001005.
3. L. Baldi and G. Cerofolini. La Legge di Moore e lo sviluppo dei circuiti integrati. Mondo Digitale, 3:3-15, 2002 (in Italian).
4. P. Benioff. Quantum mechanical Hamiltonian models of Turing machines. J. Stat. Phys., 29:515-546, 1982.
5. J. Berstel and C. Reutenauer. Rational series and their languages. EATCS Monographs on Theoretical Computer Science, vol. 12, Springer-Verlag, 1988.
6. A. Bertoni and M. Carpentieri. Regular languages accepted by quantum automata. Information and Computation, 165:174-182, 2001.
7. A. Bertoni and M. Carpentieri. Analogies and differences between quantum and stochastic automata. Theoretical Computer Science, 262:69-81, 2001.
8. A. Brodsky and N. Pippenger. Characterizations of 1-way quantum finite automata. Technical Report TR-99-03, Department of Computer Science, University of British Columbia, 2000.
9. E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM J. Comput., 26:1411-1473, 1997.
10. A preliminary version appeared in Proc. 25th ACM Symp. on Theory of Computation, pp. 11-20, 1993.
11. D. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. London Ser. A, 400:97-117, 1985.
12. R. Feynman. Simulating physics with computers. Int. J. Theoretical Physics, 21:467-488, 1982.
13. M. Golovkins and M. Kravtsev. Probabilistic Reversible Automata and Quantum Automata. In Proc. 8th International Computing and Combinatorics Conference, LNCS 2387, Springer, pp. 574-583, 2002
14. L. Grover. A fast quantum mechanical algorithm for database search. In Proc. 28th ACM Symposium on Theory of Computing, pp. 212-219, 1996.
15. J. Gruska. Quantum Computing. McGraw-Hill, 1999.
16. J. Gruska. Descriptional complexity issues in quantum computing. J. Automata, Languages and Combinatorics, 5:191-218, 2000.
17. W. Höffdings. Probability inequalities for sums of bounded random variables. J. American Statistical Association, 58:13-30, 1963.
18. A. Kondacs and J. Watrous. On the power of quantum finite state automata. In 38th Symposium on Foundations of Computer Science, pp. 66-75, 1997.
19. M. Marcus and H. Minc. Introduction to Linear Algebra. The Macmillan Company, 1965. Reprinted by Dover, 1988.
20. M. Marcus and H. Minc. A Survey of Matrix Theory and Matrix Inequalities. Prindle, Weber & Schmidt, 1964. Reprinted by Dover, 1992.
21. G.E. Moore. Progress in Digital Integrated Electronics. In Digest of the 1975 International Electron Devices Meeting, IEEE, pp. 11-13, 1975.
22. C. Moore and J. Crutchfield. Quantum automata and quantum grammars. Theoretical Computer Science, 237:275-306, 2000. A preliminary version of this work appears as Technical Report in 1997.
23. A. Nayak. Optimal lower bounds for quantum automata and random access codes. In Proc. 40th Symposium on Foundations of Computer Science. pp. 369-376, 1999.
24. A. Paz. Introduction to Probabilistic Automata. Academic Press, 1971.
25. J.E. Pin. On languages accepted by finite reversible automata. In Proc. 14th International Colloquium on Automata, Languages and Programming, LNCS 267, pp. 237-249. Springer-Verlag, 1987.
26. M. Rabin. Probabilistic automata. Information and Control, 6:230-245, 1963.
27. P. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26:1484-1509, 1997.
28. A preliminary version appeared in Proc. 35th IEEE Symp. on Foundations of Computer Science, pp. 20-22, 1994.
29. M.P. Schützenberger. On the definition of a family of automata. Information and Control, 4:245-270, 1961.
30. A. Salomaa and M. Soittola. Automata-theoretic aspects of formal power series. Texts and Monographs in Computer Science, Springer-Verlag, 1978.
31. P. Turakainen. Generalized automata and stochastic languages. Proc. Amer. Math. Soc., 21:303-309, 1969.