Automata theory based on quantum logic: Reversibilities and pushdown automata

Theoretical Computer Science

Volumn 386, Issue 1-2, 2007, Pages 38-56

  Qiu, Daowen ^a  

^a SUN YAT SEN UNIVERSITY   (China)

Author keywords

Finite automata; Orthomodular lattices; Pushdown automata; Quantum computation; Quantum finite automata; Quantum logic

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; MATHEMATICAL OPERATORS; QUANTUM COMPUTERS;

L VALUED FINITE AUTOMATA (L VFA); PUSHDOWN AUTOMATA; QUANTUM LOGICS; REVERSIBILITIES;

AUTOMATA THEORY;

EID: 34648831683     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.05.026     Document Type: Article

References (46)

1. Angluin D. Inference of reversible languages. J. ACM 29 (1982) 741-765
2. A. Ambainis, R. Freivalds, One-way quantum finite automata: Strengths, weaknesses and generalizations, in: Proc. 39th Annu. Symp. Foundations of Computer Science, Palo Alfo, California, 1998, pp. 332-341. Also quant-ph/9802062, 1998
3. A. Ambainis, A. Nayak, A. Ta-Shma, U. Vazirani, Dense quantum coding and a lower bound for 1-way quantum automata, in: Proc. 31st Annu. ACM Symp. Theory of Computing, Atlanta, Georgia, 1999, pp. 376-383. Also quant-ph/9804043, 1998
4. Ambainis A., and Watrous J. Two-way finite automata with quantum and classical states. Theoret. Comput. Sci. 287 (2002) 299-311
5. Bavel Z. Introduction to the Theory of Automata (1983), Reston Publishing Company, Inc., Reston, VA
6. Barnum H. Quantum information processing and quantum logic: Towards mutual illumination. quant-ph/0203129
7. Benioff P. The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines. J. Stat. Phys. 22 (1980) 563-591
8. Bennett C. Logical reversibility of computation. IBM J. Res. Dev. 17 (1973) 525-532
9. Bertoni A., and Carpentieri M. Analogies and differences between quantum and stochastic automata. Theoret. Comput. Sci. 262 (2001) 69-81
10. Brunet O., and Jorrand P. Dynamic quantum logic for quantum programs. Internat. J. Quantum Inf. 2 1 (2003) 45-54. Also quant-ph/0311143
11. Bavel Z., and Muller D.E. Connectivity and reversibility in automata. J. ACM 17 (1970) 231-240
12. Birkhoff G., and von Neumann J. The logic of quantum mechanics. Ann. of Math. 37 (1936) 823-843
13. Brodsky A., and Pippenger N. Characterizations of 1-way quantum finite automata. SIAM J. Comput. 31 (2002-1999) 1456-1478. Also quant-ph/9903014
14. Bernstein E., and Vazirani U. Quantum complexity theory. SIAM J. Comput. 26 (1997) 1411-1473
15. Cattaneo G., Dalla Chiara M.L., Giuntini R., and Leporini R. An unsharp logic from quantum computation. quant-ph/0201013
16. Cheng W., and Wang J. Grammar theory based on quantum logic. Internat. J. Theoret. Phys. 42 (2003) 1677-1691
17. Deutsch D. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. Lond. A 400 (1985) 97-117
18. Dalla Chiara M.L., Giuntini R., and Leporini R. Quantum computational logics: A survey. quant-ph/0305029
19. C.A. Ellis, Probabilistic languages and automata, Ph.D. Dissertation, University of Illinois, Urbana, IL, 1969
20. Feynman R.P. Simulating physics with computers. Internat. J. Theoret. Phys. 21 (1982) 467-488
21. Golovkins M. Quantum pushdown automata. Proc. 27th Conf. on Current Trends in Theory and Practice of Informatics. Milovy. Lecture Notes in Computer Science vol. 1963 (2000), Springer-Verlag, Berlin 336-346
22. L. Grover, A fast quantum mechanical algorithms for datdbase search, in: Proc. 28th Annual ACM Symp. Theory of Computing, Philadelphia, PA, 1996, pp. 212-219
23. Gudder S. Quantum computers. Internat. J. Theoret. Phys. 39 (2000) 2151-2177
24. Gruska J. Quantum Computing (1999), McGraw-Hill, London
25. Hopcroft J.E., and Ullman J.D. Introduction to Automata Theory, Languages, and Computation (1979), Addision-Wesley, New York
26. Karhumäki J. Applications of finite automata. MFSC'02. Lecture Notes in Computer Science vol. 2420 (2002), Springer, Berlin 40-58
27. A. Kondacs, J. Watrous, On the power of finite state automata, in: Proc. 38th IEEE Annu. Symp. Foundations of Computer Science, 1997, pp. 66-75
28. Lu R.Q., and Zheng H. Lattices of quantum automata. Internat. J. Theoret. Phys. 42 (2003) 1425-1449
29. Moore C., and Crutchfield J.P. Quantum automata and quantum grammars. Theoret. Comput. Sci. 237 (2000-1997) 275-306. Also quant-ph/9707031
30. Nielsen M.A., and Chuang I.L. Quantum Computation and Quantum Information (2000), Cambridge University Press, Cambridge
31. Nishimura H., and Yamakami T. An application of quantum finite automata to interactive proof system. Proc. 9th Internat. Conf. Implementation and Application of Automata. Lecture Notes in Computer Science vol. 3317 (2004), Springer, Berlin 225-236 Also quant-ph/0410040, 2004
32. Pin J. On reversible automata. Proc. Latin American Symp. Theoretical Informatics. Lecture Notes in Computer Science vol. 583 (1992), Springer, Berlin 401-415
33. Pták P., and Pulmannová S. Orthomodular Structures as Quantum Logics (1991), Kluwer, Dordrecht
34. Qiu D.W. Automata and grammars theory based on quantum logic. J. Softw. 14 (2003) 23-27
35. Qiu D.W. Characterization of sequential quantum machines. Internat. J. Theoret. Phys. 41 (2002) 811-822
36. Qiu D.W. Automata theory based on quantum logic: Some characterizations. Inform. and Comput. 190 (2004) 179-195
37. Qiu D.W., and Ying M.S. Characterization of quantum automata. Theoret. Comput. Sci. 312 (2004) 479-489
38. Rabin M.O. Probabilistic automata. Inf. Control 6 (1963) 230-244
39. Román L., and Rumbos B. Quantum logic revisited. Found. Phys. 21 (1991) 727-734
40. Salomaa A. Probabilistic and weighted grammars. Inf. Control 15 (1969) 529-544
41. Santos E.S. Probabilistic grammars and automata. Inf. Control 21 (1972) 27-47
42. Santos E. Relation of the Bell inequalities with quantum logic, hidden variable and information theory. quant-ph/0207062
43. P.W. Shor, Algorithm for quantum computation: Discrete logarithms and factoring, in: Proc. 37th IEEE Annu. Symp. on Foundations of Computer Science, 1994, pp. 124-134
44. A.C. Yao, Quantum circuit complexity, in: Proc. 34th IEEE Symp. Foundations of Computer Science, 1993, pp. 352-361
45. Ying M.S. Automata theory based on quantum logic. (I). Internat. J. Theoret. Phys. 39 (2000) 981-991
46. Ying M.S. Automata theory based on quantum logic. (II). Internat. J. Theoret. Phys. 39 (2000) 2545-2557