MCQOPTIONS
Saved Bookmarks
| 1. |
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 |
| Answer» D. None of the mentioned | |