In 1938, in a famous paper, Alan Turing proved that you could simulate any Turing machine with the following six primitive operations:
1. Move one square to the right 2. Move one square to the left 3. Write a symbol on the current square 4. Read any symbols on the current square 5. Erase any symbols on the current square 6. Do nothing
Is there an analogous set of minimum primitive operations for a quantum computer? Or is it the same set?