Quantum Computing
Bachelor of Science in Computer Science · University · Core Courses
In this unit you will: describe qubit states and calculate measurement probabilities; apply the Hadamard, X, and Z gates; apply CNOT, create Bell states, and understand entanglement; place the basic ideas of Grover’s and Shor’s algorithms; apply all content as on an exam.
There are 50 exercises to practice: interaktive Aufgaben. Every answer gets instant feedback, free and without signing up.
What's included
- Describe qubit states and calculate measurement probabilities
- Apply the Hadamard · X · and Z gates
- Apply CNOT · create Bell states · and understand entanglement
- Place the basic ideas of Grover’s and Shor’s algorithms
- Apply all content as on an exam
Example questions
- What distinguishes a qubit from a classical bit?
- A qubit is in the state 0.6|0⟩ + 0.8|1⟩. What is the probability of measuring 1?
- True or false? “Measuring a qubit in superposition gives both values at the same time.”