Fill in the blank. To specify a gate in a quantum computer, it is enough to specify its action on an arbitrary pure state or its action on a(n) _________________ state.

🎲 Try a Random Question  |  Total Questions in Quiz: 100  |  🧠 Study this quiz with Flashcards
This question is part of a full practice quiz:
CS411 Final Exam - Non-Standard Computing — practice the complete quiz, review flashcards, or try a random question.

MCQs on several prominent 'unconventional' computational methods and theories, including quantum computation, DNA and molecular computation, genetic algorithms, and cellular automata.
 


Fill in the blank. To specify a gate in a quantum computer, it is enough to specify its action on an arbitrary pure state or its action on a(n) _________________ state.