Which of the following is false for Quantum Turing machine?
(a) Abstract machine
(b) Any quantum algorithm can be expressed formally as a particular quantum turing machine
(c) Gives a solution to ‘Is a universal quantum computer sufficient’
(d) None of the mentioned
The question was asked in an internship interview.
Enquiry is from Multitape Turing Machines topic in chapter Introduction to Turing Machines of Automata Theory