Skip to content
ExperimentsExperiment 9 Β· Quantum search

Search Problems

Hidden number & database search with a pluggable oracle framework.

  1. 1. Learn
  2. 2. Watch
  3. 3. Interact
  4. 4. Predict
  5. 5. Run
  6. 6. Observe
  7. 7. Record
  8. 8. Answer
  9. 9. Research
β‘  What is the problem?

How do real problems become Grover searches?

β‘‘ How does a classical computer approach it?

Evaluate the check function on candidates until one passes.

β‘’ How does the quantum approach differ?

Encode the check function as an oracle circuit that flips the phase of solutions, then run Grover.

β‘£ What is happening mathematically?
Oracle: |x⟩ β†’ (βˆ’1)^{f(x)}|x⟩. In this simulator f(x) is evaluated classically to build the oracle β€” on hardware it must be a reversible circuit.
β‘€ What does the simulation show?
Candidates, the predicate, and the real Grover probability distribution.
β‘₯ What did we learn?
The hard part in practice is building an efficient oracle.
⑦ What can you experiment with?
Search the database for a phone number and compare the classical scan length.
πŸ““ Record: my lab notebook