/ quantum courseBack to lab
PATHWAY PROGRESS0/27 passed

11 / Research practice · LESSON 24 / 27 · 25 MIN

Complexity, advantage and reproducibility.

Distinguish theoretical speedup from measured end-to-end advantage.

Specify the computational model

BQP describes bounded-error polynomial-time quantum computation. It is not known to contain all NP-complete problems. Grover gives a quadratic black-box search advantage, not a generic exponential shortcut to every hard problem.

Separate simulation and execution

This app computes small ideal circuits classically. The state-vector size is 2ⁿ; the fact it can visualize a quantum algorithm does not demonstrate hardware quantum advantage. Some structured circuits are classically tractable even at larger sizes.

Report reproducible evidence

Record circuit, basis order, gate conventions, parameters, shots, calibration and uncertainty. State the classical baseline and include data loading, oracle construction and output extraction. Disclose failed runs and limitations instead of selecting only favorable examples.

CHECK YOUR UNDERSTANDING

Lesson quiz

Answer all 2 questions correctly. Unlimited retries.

0/2 answered

1. Does BQP have a proven ability to solve all NP-complete problems efficiently?
2. An advantage claim should include…

Checking your account…