A decision procedure for well-formed linear quantum cellular automata

Random Structures and Algorithms

Volumn 11, Issue 4, 1997, Pages 381-394

  Dürr, Christoph ^a   LêThanh, Huong ^a   Santha, Miklos ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b CNRS   (France)

Author keywords

Cellular automata; De Bruijn graphs; Quantum computation

Indexed keywords

EID: 0040651784     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199712)11:4<381::AID-RSA6>3.0.CO;2-V     Document Type: Article

References (26)

1. S. Amoroso and Y. Patt, Decision Procedures for Surjectivity and Injectivity of Parallel Maps for Tesselation Structures, J. Comput. System Sci. 6, 448-464 (1972).
2. A. Berthiaume and G. Brassard, The quantum challenge to structural complexity theory, Proceedings of the 7th IEEE Conference on Structure in Complexity Theory, 1992, pp. 132-137.
3. R. Bellman, On a routing problem, Quart. Appl. Math., 16, 87-90 (1958).
4. P. Benioff, Quantum mechanical Hamiltonian models of Turing machines, J. Stat. Phys. 29, 515-546 (1982).
5. P. Benioff, Quantum mechanical Hamiltonian models of Turing machines that dissipates no energy, Phys. Rev. Lett. 48, 1581-1585 (1982).
6. M. Biafore, Can computers have simple Hamiltonians? Proceedings of the 3rd Workshop on Physics and Computation, 1994, pp. 63-69.
7. E. Bernstein and U. Vazirani, Quantum complexity theory, SIAM J. Comput., 26, 1411-1473 (1997).
8. T. Cormen, C. Leiserson and R. Rivest, Introduction to Algorithms, The MIT Press, Cambridge, MA, 1990.
9. W. van Dam, A universal quantum cellular automaton, Fourth Workshop on Physics and Computation, 1996.
10. D. Deutsch, Quantum theory, the Church-Turing principle and the universal quantum computer, Proc. Roy. Soc. London Ser. A 400, 97-117 (1985).
11. D. Deutsch and R. Jozsa, Rapid solution of problems by quantum computation, Proc. Roy. Soc. London Ser. A 439, 553-558 (1992).
12. C. Dürr and M. Santha, A decision procedure for unitary linear quantum cellular automata, Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996, pp. 38-45.
13. R. Feynman, Simulating physics with computers, Internat. J. Theoret. Phys. 21, 467-488 (1982).
14. R. Feynman, Quantum mechanical computers, Found. Phys. 16, 507 (1986).
15. L. Ford and D. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
16. P. Høyer, Note on linear quantum cellular automata, unpublished, 1996.
17. R. Jozsa, Characterizing classes of functions computable by quantum parallelism, Proc. Roy. Soc. London Ser. A 435, 563-574 (1991).
18. S. Lloyd, A potentially realizable quantum computer, Science 261, 1569-1571 (1993).
19. S. Lloyd, Envisioning a quantum supercomputer, Science 263, 695 (1994).
20. N. Margolus, Parallel quantum computation, in Complexity, Entropy and the Physics of Information, Addison-Wesley, Reading, MA, 1994, p. 273.
21. D. Simon, On the power of quantum computation, Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, 1994, pp. 116-123.
22. P. Shor, Algorithms for quantum computation: Discrete log and factoring, Proceedings of the 26th ACM Symposium on the Theory of Computing, 1994, pp. 124-134.
23. K. Sutner, De Bruijn graphs and cellular automata, Complex Systems, 5, 19-30 (1991).
24. R. Tarjan, Depth first search and linear graph algorithms, SIAM J. Comput. 1, 146-160 (1972).
25. J. Watrous, On one dimensional quantum cellular automata, Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, 1995, pp. 528-537.
26. A. Yao, Quantum circuit complexity, Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 352-361.