A decision procedure for unitary linear quantum cellular automata

SIAM Journal on Computing

Volumn 31, Issue 4, 2002, Pages 1076-1089

  Dürr, Christoph ^a   Santha, Miklos ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Quantum computation; Reversible cellular automata

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; CONSTRAINT THEORY; POLYNOMIALS; QUANTUM THEORY; TURING MACHINES;

QUANTUM COMPUTATION; REVERSIBLE CELLULAR AUTOMATA;

AUTOMATA THEORY;

EID: 0036520620     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797327702     Document Type: Article

References (19)

1. Quantum mechanical Hamiltonian models of Turing machines
2. Quantum mechanical Hamiltonian models of Turing machines that dissipate no energy
3. Quantum complexity theory
4. Can computers have simple Hamiltonians?
5. Quantum theory, the Church-Turing principle and the universal quantum computer
6. Quantum computational networks
7. A decision procedure for well-formed linear quantum cellular automata
8. Simulating physics with computers
9. Quantum mechanical computers
10. Algorithms in number theory
11. A potentially realizable quantum computer
12. Envisioning a quantum supercomputer
13. Parallel quantum computation
14. De Bruijn graphs and linear cellular automata
15. Motion planning among time-dependent obstacles
16. A universal quantum cellular automaton
17. On one dimensional quantum cellular automata
18. Quantum circuit complexity