4 ms·
Is there a model of a computation that stands to quantum computation in the same way a universal Turing machine stands to classical computers, or is the UTM alr
by ttctciyf 8y ago
Is there a model of a computation that stands to quantum computation in the same way a universal Turing machine stands to classical computers, or is the UTM already enough?
- ScottAaronson 8y agoYes, you can define a universal quantum Turing machine, which is a single quantum Turing machine U able to simulate any other quantum Turing machine M (at least, to arbitrary precision) given a coded description of M on its tape. This is one of the main observations David Deutsch made in his famous paper from 1985.
- ttctciyf 8y agoThanks, and thanks for spending a big chunk of your time here!