1. What is wrong with saying a quantum computer tries all possible answers at once?
2. What is the crucial property of amplitudes that ordinary probabilities lack?
3. Two routes reach the same outcome with amplitudes 0.5 and minus 0.5. How often is that outcome observed?
4. Which sentence describes the shape of every quantum algorithm?
5. Why can entanglement not be used to send messages faster than light?
6. How does Shor's algorithm attack factoring?
7. Which cryptographic systems does Shor's algorithm break outright? Select all that apply.
8. Grover's algorithm searches N unstructured possibilities in roughly how many steps?
9. Why does a quadratic speedup fail to make exponentially hard problems tractable?
10. Why is simulating quantum systems considered the strongest application?
11. What is decoherence?
12. Why is circuit depth as important as qubit count?
13. Why can classical error correction not be applied to qubits? Select all that apply.
14. Roughly how many physical qubits may one logical qubit require?
15. What does operating below threshold mean?
16. Why can a quantum annealer not threaten RSA?
17. Why does quantum key distribution not address the threat Shor's algorithm creates?
18. An organisation's data must stay confidential 15 years and migration will take 5. When should it act?
19. What single feature separates a legitimate quantum pilot from theatre?
20. Which is the most defensible summary position on quantum computing?