1. How does Shor's algorithm approach factoring?
2. Which cryptography is broken outright by Shor's algorithm? Select all that apply.
3. What is the recommended response for symmetric encryption and hash functions?
4. Why is post-quantum migration urgent despite no capable machine existing?
5. Grover's algorithm searches N unstructured possibilities in about how many steps?
6. Why does a quadratic speedup fail to make exponentially hard problems tractable?
7. Why will Grover's algorithm not usefully speed up searching a customer database? Select all that apply.
8. In what setting does Grover's algorithm genuinely help?
9. What was Feynman's 1981 argument for building quantum computers?
10. Why might useful quantum chemistry simulation arrive before cryptographically relevant machines?