Automata theory based on quantum logic: Some characterizations

Information and Computation

Volumn 190, Issue 2, 2004, Pages 179-195

  Qiu, Daowen ^a  

^a SUN YAT SEN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; FORMAL LOGIC; LINEAR ALGEBRA; PROBLEM SOLVING; QUANTUM THEORY;

QUANTUM COMPUTATION; QUANTUM LOGIC; SUBAUTOMATA; TRUTH-VALUE LATTICES;

AUTOMATA THEORY;

EID: 2342462362     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2003.11.003     Document Type: Article

References (50)

1. L.M. Adleman, Molecular computation of solutions to combinatorial problems, Science 266 (1994) 1021-1023.
2. A. Ambainis, R. Freivalds, One-way quantum finite automata: strengths, weaknesses and generalizations, in: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998, pp. 332-341
3. Z. Bavel, The source as a tool in automata, Inf. Control 18 (1971) 140-155.
4. P. Benioff, 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.
5. C. Bennett, Logical reversibility of computation, IBM J. Res. Development 17 (1979) 525-532.
6. A. Bertoni, M. Carpentieri, Regular languages accepted by quantum automata, Inform. Comput. 165 (2001) 174-182.
7. A. Broadsky, N. Pippenger, Characterizations of 1-way quantum finite automata, SIAM J. Comp. 31 (2002) 1456-1478.
8. E. Bernstein, U. Vazirani, Quantum complexity theory, SIAM J. Comp. 26 (1997) 1411-1473.
9. G. Birkhoff, J. von Neumann, The logic of quantum mechanics, Ann. Math. 37 (1936) 823-843.
10. G.D. Berman, G.D. Doolen, R. Mainieri, V.I. Tsifrinovich, Introduction to Quantum Computers, World Scientific, Singapore, 1998.
11. J.I. Cirac, P. Zoller, Quantum computations with cold trapped ions, Phys. Rev. Lett. 74 (1995) 4091-4094.
12. D. Deutsh, Quantum theory, the Church-Turing principle and the universal quantum computer, Proc. R. Soc. Lond. A 400 (1985) 97-117.
13. M.L. Dalla Chiara, Quantum logic, in: in: D.M. Gabbay, F. Guenthner (Eds.), Handbook of Philosophical Logic, vol. III, D. Reidel, Dordrecht, 1986, pp. 427-469.
14. L.M. Duan, G.G. Guo, Probabilistic cloning and identification of linearly independent quantum states, Phys. Rev. Lett. 80 (1998) 4999-5002.
15. R.P. Feynman, Simulting physics with computers, Int. J. Theor. Phys. 21 (1982) 467-488.
16. L. Grover, A fast quantum mechanical algorithms for database search, in: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, 1996, pp. 212-219.
17. J. Gruska, Quantum Computing, McGraw-Hill, London, 1999.
18. S. Gudder, Quantum Computers, Int. J. Theor. Phys. 39 (2000) 2151-2177.
19. N. Gisin, S. Massar, Optimal quantum cloning machines, Phys. Rev. Lett. 79 (1997) 2153-2156.
20. A. Kondacs, J. Watrous, On the power of finite state automata, in: Proceedings of the 38th FOCS, 1997, pp. 66-75.
21. S. Lloyd, A potentially realizable quantum computer, Science 261 (1993) 1569-1571.
22. P. Mittelstaedt, Quantum Logic, D. Reidel, Dordrecht, 1978.
23. C. Monroe, Quantum information processing with atoms and photons, Nature 416 (2002) 238-246.
24. C. Moore, J.P. Crutchfield, Quantum automata and quantum grammars, Theor. Comput. Sci. 237 (2000) 275-306.
25. M.A. Nielsen, I.L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, 2000.
26. A. Paz, Introduction to Probabilistic Automata, Academic Press, New York, 1971.
27. A.K. Pati, S.L. Braunstein, Impossibility of deleting an unknown quantum states, Nature 404 (2000) 164-165.
28. P. Pták, S. Pulmannová Orthomodular Structures as Quantum Logics, Kluwer, Dordrecht, 1991.
29. D.W. Qiu, Characterization of sequential quantum machines, Int. J. Theor. Phys. 41 (2002) 811-822.
30. D.W. Qiu, Quantum pushdown automata, Int. J. Theor. Phys. 41 (2002) 1627-1639.
31. D.W. Qiu, Some analogies between quantum cloning and quantum deleting, Phys. Rev. A 65 (2002) 052303.
32. D.W. Qiu, Combinations of probabilistic and approximate quantum cloning and deleting, Phys. Rev. A 65 (2002) 052329.
33. D.W. Qiu, Upper bound on the success probability of separation among quantum states, J. Phys. A 35 (2002) 6931-6937.
34. D.W. Qiu, Non-optimal universal quantum deleting machine, Phys. Lett. A 301 (2002) 112-116.
35. D.W. Qiu, Some general probabilistic quantum cloning and deleting machines, Phys. Lett. A 308 (2003) 335-342.
36. D.W. Qiu, Automata theory based on complete residuated lattice-valued logic(I), Sci. China (F) 44 (2002) 419-429.
37. D.W. Qiu, Automata theory based on complete residuated lattice-valued logic(II), Sci. China (F) 45 (2002) 442-452.
38. M.O. Rabin, Probabilistic automata, Inf. Control 6 (1963) 230-244.
39. L. Roman, B. Rumbos, Quantum logic revisited, Found. Phys. 21 (1991) 727-734.
40. J.B. Rosser, A.R. Turquette, Many-Valued Logics, North-Holland, Amsterdam, 1952.
41. P.W. Shor, Algorithm for quantum computation: discrete logarithms and factoring, in: Proceedings of the 37th IEEE Annunal Symposium on Foundations of Computer science, 1994, pp. 124-134.
42. K. Svozil, Quantum Logic, Springer-verlag, Berlin, 1998.
43. H. Siegelmann, E.D. Sontag, Analog computation via neural networks, Theor. Comput. Sci. 131 (1994) 331-360.
44. W. Shukla, A.K. Srivastava, A topology for automata: a note, Inf. Control 32 (1976) 163-168.
45. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addision-Wesley, Reading, MA, 1979.
46. C.P. Williams, S.H. Clearwater, Explorations in Quantum Computing, Springer-Verlag, New York, 1998.
47. W.K. Wootters, W.H. Zurek, A single quantum cannot be cloned, Nature 299 (1982) 802-803.
48. A.C. Yao, Quantum circuit complexity, in: Proceedings of the 34th IEEE Symposium on Foundations of Computer science, 1993, pp. 352-361.
49. M.S. Ying, Automata theory based on quantum logic(I), Int. J. Theor. Phys. 39 (2000) 981-991.
50. M.S. Ying, Automata theory based on quantum logic(II), Int. J. Theor. Phys. 39 (2000) 2545-2557.