Quantum automata and quantum grammars

Theoretical Computer Science

Volumn 237, Issue 1-2, 2000, Pages 275-306

  Moore, Cristopher ^a   Crutchfield, James P ^a  

^a SANTA FE INSTITUTE   (United States)

Author keywords

Automata; Complexity classes; Grammars; Quantum computation

Indexed keywords

EID: 0000134862     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00191-1     Document Type: Article

References (38)

1. L.M. Adleman, Molecular computation of solutions to combinatorial problems, Science 266 (1994) 1021-1023.
2. P. Benioff, Quantum mechanical Hamiltonian models of Turing machines that dissipate no energy, Phys. Rev. Lett. 48 (1982) 1581-1585 and J. Statist. Phys. 29 (1982) 515-546.
3. P. Benioff, Quantum mechanical Hamiltonian models of Turing machines that dissipate no energy, Phys. Rev. Lett. 48 (1982) 1581-1585 and J. Statist. Phys. 29 (1982) 515-546.
4. J. Berstel, Transductions and Context-Free Languages, Teubner Studienbücher, Berlin, 1978.
5. L. Blum, M. Shub, S. Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. 21 (1989) 1-46.
6. R. Bukharaev, On the representability of events in probabilistic automata, Probab. Meth. Cybernet. V Kazan (1967) 7-20 (Russian).
7. A. Cherubini, C. Citrini, S.C. Reghizzi, D. Mandrioli, QRT FIFO automata, breadth-first grammars and their relations, Theoret. Comput. Sci. 85 (1991) 171-203.
8. J.I. Cirac, P. Zoller, Quantum computations with cold trapped ions, Phys. Rev. Lett. 74 (1995) 4091-4094.
9. J.P. Crutchfield, The calculi of emergence: computation, dynamics, and induction, Physica D 75 (1994) 11-54.
10. J.P. Crutchfield, M. Mitchell, The evolution of emergent computation, Proc. Natl. Acad. Sci. 92 (1995) 10742-10746.
11. D. Deutsch, Quantum theory, the Church-Turing principle and the universal quantum computer, Proc. R. Soc. London Ser. A 400 (1985) 97-117.
12. C. Dürr, M. Santha, A decision procedure for unitary linear quantum cellular automata, Proc. 37th Symp. on Foundations of Computer Science, 1996, pp. 38-45.
13. C.A. Ellis, Probabilistic languages and automata, Ph.D. Thesis, University of Illinois, Urbana, 1969.
14. P. Flajolet, Analytic models and ambiguity of context-free languages, Theoret. Comput. Sci. 49 (1987) 283-309.
15. N.A. Gershenfeld, I.L. Chuang, Bulk spin-resonance quantum computation, Science 275 (1997) 350-356.
16. R. Giles, Reconstruction of gauge potentials from Wilson loops, Phys. Rev. D 24(8) (1981) 2160-2168.
17. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, New York, 1979.
18. A. Kondacs, J. Watrous, On the power of quantum finite state automata, Proc. 38th Symp. on Foundations of Computer Science, 1997, To appear.
19. W. Kuich, A. Salomaa, Semirings, Automata, Languages, EATCS Monographs on Theoretical Computer Science, vol. 5. Springer, Berlin, 1986.
20. S. Lloyd, A potentially realizable quantum computer, Science 261 (1993) 1569-1571.
21. I. Macarie, Closure properties of stochastic languages, University of Rochester Computer Science Technical Report 441, 1993.
22. C. Moore, Unpredictability and undecidability in dynamical systems, Phys. Rev. Lett. 64 (1990) 2354-2357 and Nonlinearity 4 (1991) 199-230.
23. C. Moore, Unpredictability and undecidability in dynamical systems, Phys. Rev. Lett. 64 (1990) 2354- 2357 and Nonlinearity 4 (1991) 199-230.
24. C. Moore, Dynamical recognizers: real-time language recognition by analog computers, Theoret. Comput. Sci. 201 (1998) 99-136.
25. A. Paz, Introduction to Probabilistic Automata, Academic Press, New York, 1971.
26. M.O. Rabin, Probabilistic automata, Inform. Control 6 (1963) 230-245.
27. El Rodento Diablo, personal communication.
28. A.L. Rosenberg, Real-time definable languages, J. ACM 14 (1967) 645-662.
29. Y. Sakakibara, M. Brown, R. Hughey, I.S. Mian, K. Sjolander, R.C. Underwood, D. Haussler, Recent methods for RNA modeling using stochastic context-free grammars, in: M. Crochemore, D. Gusfield, (Eds.), Combinatorial Pattern Matching, 5th Annual Symp., Springer, Berlin, 1994, pp. 289-306.
30. D.B. Searls, The linguistics of DNA, Am. Scientist 80 (1992) 579-591.
31. P.W. Shor, Algorithms for quantum computation: discrete logarithms and factoring, Proc. 35th Symp. on Foundations of Computer Science, 1994, pp. 124-134.
32. P.W. Shor, Fault-tolerant quantum computation, Proc. 37th Symp. on Foundations of Computer Science, 1996, pp. 56-65.
33. H. Siegelmann, E.D. Sontag, Analog computation via neural networks, Theoret. Comput. Sci. 131 (1994) 331-360.
34. H. Siegelmann, E.D. Sontag, L. Giles, The complexity of language recognition by neural networks, in: J. van Leeuwen, (Ed.), Algorithms, Software, Architecture, North-Holland, Amsterdam, 1992, pp. 329-335.
35. A.M. Steane, Active stabilization, quantum computation, and quantum state synthesis, Phys. Rev. Lett. 78 (1997) 2252-2255.
36. J.S. Townsend, A Modern Approach to Quantum Mechanics, McGraw-Hill, New york 1992.
37. P. Turakainen, On stochastic languages, Inform. Control 12 (1968) 304-313.
38. D.R. Upper, Theory and algorithms for hidden Markov models, and generalized hidden Markov models, Ph.D. Thesis, Mathematics Department, University of California, Berkeley, 1997.