A decision procedure for well-formed linear quantum cellular automata

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

Volumn 1046, Issue , 1996, Pages 281-292

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

^a UNIVERSITÉ PARIS SACLAY   (France)

^b CNRS   (France)

^c NONE

Author keywords

Algorithms; Automata and formal languages; Computational complexity

Indexed keywords

ALGORITHMS; CELLULAR AUTOMATA; COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; QUANTUM COMPUTERS;

AUTOMATA AND FORMAL LANGUAGES; DECISION PROCEDURE; QUANTUM CELLULAR AUTOMATA; QUANTUM COMPUTING DEVICES;

ROBOTS;

EID: 84948151138     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60922-9_24     Document Type: Conference Paper

References (21)

1. [AP72] S. Amoroso and Y. Patt, Decision Procedures for Surjectivity and Injectivity of Parallel Maps for Tessellation Structures, Journal of Computer and System Sciences 6, 448-464, 1972.
2. [BB92] A. Berthiaume and G. Brassard, The Quantum Challenge to Structural Complexity Theory, Proceeding of the 7th IEEE Conference on Structure in Complexity Theory, 132-137, 1992.
3. [Bel58] R. Bellman, On a routing problem, Quarterly of Applied Mathematics, 16(l):87-90, 1958.
4. [Bia94] M. Biafore, Can Computers Have Simple Hamiltonians? MIT Physics of Computation Seminar ftp://im.lcs.mit.edu/poc/biafore, 1994.
5. [BV93] E. Bernstein and U. Vazirani, Quantum complexity theory, Proceeding of the 25th ACM Symposium on the Theory of Computing, 11-20, 1993.
6. [CLR90] T. Cormen, C. Leiserson and R. Rivest, Introduction to Algorithms, The MIT Press, 1990.
7. [Deu85] D. Deutsch, Quantum theory, the Church-Turing principle and the universal quantum computer, Proceeding of the Royal Society of London, A400:97-117, 1985.
8. [DJ92] D. Deutsch and R. Jozsa, Rapid solution of problems by quantum computation, Proceeding of the Royal Society of London, A439:553-558, 1992.
9. [Fey82] R. Feynman, Simulating physics with computers, International Journal of Theoretical Physics 21 467-488, 1982.
10. [Fey86] R. Feynman, Quantum Mechanical Computers, Foundations of Physics 16, 507, 1986.
11. [FF62] L. Ford and D. Fulkerson, Flows in Networks, Princeton University Press, 1962.
12. [Jozs91] R. Jozsa, Characterizing classes of functions computable by quantum parallelism, Proceeding of the Royal Society of London, A435:563-574, 1991.
13. [Llo93] S. Lloyd, A potentially realizable Quantum Computer, Science 261, 1569-1571, 1993.
14. [Llo94] S. Lloyd, Envisioning a Quantum Supercomputer, Science 263, 695, 1994.
15. [Mar94] N. Margolus, Parallel Quantum Computation, MIT Physics of Computation Seminar ftp://im.lcs.mit.edu/poc/margyolus, 1994.
16. [Sim94] D. Simon, On the Power of Quantum Computation, Proceeding of the 34 th IEEE Symposium on Foundations of Computer Science, 116-123, 1994.
17. [Sho94] P. Shor, Algorithms for Quantum Computation: Discrete Log and Factoring Proceeding of the 26th ACM Symposium on the Theory of Computing, 124-134, 1994.
18. [Sut9l] K. Sutner, De Bruijn graphs and cellular automata, Complex Systems, 5:1930, 19-91.
19. [Tar75] R. Tarjan, Depth first search and linear graph algorithms, SIAM Journal on Computing, 1(2):146-160, 1972.
20. [Wat95] J. Watrous, On one dimensional quantum cellular automata, Proceeding of the 36th IEEE Symposium on Foundations of Computer Science, 528-537, 1995.
21. [Yao93] A. Yao, Quantum circuit complexity, Proceeding of the 34th IEEE Symposium on Foundations of Computer Science, 352-361, 1993.