Self-Assessment Quiz: Quantum Hype vs. Quantum Reality

Twenty questions on separating what quantum computers will do from what they are said to do. Aim for 16+.

Question 1

The most over-claimed quantum application area is:

A) Combinatorial optimization B) Quantum simulation C) Cryptanalysis D) Random number generation

Question 2

The most defensible near-term application area is:

A) Simulating quantum systems B) Machine learning on classical data C) Logistics optimization D) Financial forecasting

Question 3

"Quantum computers try all possibilities at once" is:

A) A misleading simplification that omits the interference step B) Precisely accurate C) True only for Shor's algorithm D) A rigorous statement

Question 4

The correct classical baseline for a quantum advantage claim is:

A) The best known classical algorithm, tuned, at equal wall-clock B) Brute force C) Random guessing D) An untuned implementation

Question 5

"Quantum supremacy" experiments demonstrated:

A) A contrived sampling task performed faster than the best known classical simulation B) A commercially valuable computation C) Breaking encryption D) General-purpose speedup

Question 6

Sycamore's 2019 claimed margin later:

A) Shrank substantially as better classical algorithms were found B) Grew C) Was fully confirmed D) Was retracted

Question 7

Quantum computers will replace classical computers:

A) No — they are accelerators for specific problems B) Yes, within a decade C) Yes, already D) For all workloads

Question 8

Drug discovery is often cited as a quantum application. The accurate view is:

A) Only the electronic-structure fraction is quantum-amenable; much of the pipeline is classical sampling and statistics B) It is entirely quantum-amenable C) It is unrelated D) It is already solved by quantum computers

Question 9

A "quantum winter" would mean:

A) Funding collapse after inflated expectations go unmet B) Hardware failure C) A cryogenic problem D) Regulatory shutdown

Question 10

The strongest argument that a quantum winter is possible is:

A) The gap between promised and demonstrated commercial value keeps widening B) The physics is wrong C) Classical computers are improving D) No funding exists

Question 11

The strongest argument against a quantum winter is:

A) Error-correction progress is real and measurable, and the cryptographic threat guarantees sustained government interest B) Revenue is high C) Applications are proven D) Hardware is cheap

Question 12

"Quantum-inspired" classical algorithms are:

A) Classical algorithms borrowing quantum ideas — running on ordinary computers B) Quantum algorithms C) Simulations of quantum computers D) Hybrid systems

Question 13

Their existence shows that:

A) Some claimed quantum speedups can be matched classically once the ideas are understood B) Quantum computing is useless C) Classical computers are quantum D) Nothing

Question 14

Which claim is currently defensible?

A) "A cryptographically relevant quantum computer would break RSA" B) "Quantum computers will optimize supply chains next year" C) "Quantum ML beats deep learning" D) "Quantum computers are already commercially useful"

Question 15

The most reliable indicator of genuine progress is:

A) Logical qubit count with algorithmic-grade error rates B) Physical qubit count C) Funding raised D) Press coverage

Question 16

True or false: Being skeptical of near-term quantum applications means doubting the physics.

Question 17

True or false: Quantum computers will make classical encryption obsolete entirely.

Question 18

True or false: Every quantum algorithm with a proven speedup is practically useful.

Question 19

Short answer. Distinguish informed skepticism from denialism about quantum computing.

Question 20

Short answer. Give three questions that reliably deflate an overstated quantum claim.

Answer Key

Q Ans Note
1 A Classical solvers exploit structure that black-box quantum search cannot (Ch. 13, 20).
2 A Native quantum input, genuinely exponential classical baseline (Ch. 17).
3 A It describes the setup and omits interference, which is the part that does the work (Ch. 11).
4 A Anything else is a strawman comparison.
5 A A legitimate scientific milestone, not a product.
6 A Improved tensor-network methods cut the classical time by orders of magnitude.
7 A Your laptop remains better at nearly everything.
8 A Force fields, docking, and conformational sampling dominate; electronic structure is a slice.
9 A By analogy with earlier AI winters.
10 A A decade of NISQ work has produced no commercially valuable advantage.
11 A Below-threshold error correction is measurable progress, and the PQC threat guarantees state funding regardless of commercial returns.
12 A Tang's dequantization results are the canonical example.
13 A Sometimes the quantum algorithm's insight, not the quantum hardware, was doing the work.
14 A Shor's algorithm is proven; only the hardware is missing. The others are unsupported.
15 A Physical qubits without error rates and logical encoding say little (Ch. 25, 31).
16 False The physics is not in question. Skepticism concerns engineering timelines, the strength of classical baselines, and the gap between demonstrations and applications — all empirical matters.
17 False Symmetric cryptography and hash functions survive with larger parameters, and post-quantum public-key cryptography is already standardized. Encryption changes; it does not end.
18 False Deutsch–Jozsa has a proven exponential separation and solves a problem nobody has. Grover is optimal and still loses to classical solvers on structured problems. Proven speedup and practical utility are independent.
19 — Informed skepticism accepts the physics and the proven algorithmic results, and questions engineering timelines, the adequacy of classical baselines, and whether demonstrations translate into applications — updating on evidence such as the Willow below-threshold result or the QuEra logical-qubit count. Denialism claims quantum computing cannot work at all, which contradicts well-established physics and demonstrated error correction. The distinction: a skeptic states what evidence would change their mind, and it is evidence that could plausibly arrive.
20 — (1) Compared against which classical algorithm, tuned, at equal wall-clock, on the same instances? (2) Are the qubits error-corrected, and what are the logical error rate and circuit depth? (3) What exactly is the task, and would anyone pay for it if a classical computer did it? A fourth in reserve: has it been independently reproduced? Most overstated claims fail on the first question alone.