TIES5700 QST2: Quantum Cellular Automata (JSS35) (1–2 cr)

The theory of quantum cellular automata can be traced back to 1982, with Feynman’s famous paper that—along with David Deutsch’s paper on the quantum Turing machine—gave birth to the idea of quantum computing. It is only in 2004, however, that a thorough algebraic theory was developed by Schumacher and Werner. In the course we will introduce the latter formulation of the notion of a quantum cellular automaton, and use it to study various aspects of the theory. We will focus in particular on the problems of classification and renormalization.   

Basic knowledge of the theory of quantum cellular automata and quantum walks

1 ECTS for completing exercises during the course +1 ECTS for a written assignment, return a few weeks after the course

Linear algebra, basic quantum theory