QPRIMORA · QUANTUM COMPUTING DEMO

Grover Search

Grover Search · Amplitude Amplification

Suppose there are many possible candidates and only one is the target. You can verify whether a candidate is correct, but you do not know where the target is. How can it be found?

Grover Search is a quantum algorithm for unstructured search. Under the oracle-query model, classical search requires O(N) queries in the worst case, while Grover Search requires O(√N) oracle calls. This demo shows how the same search problem is processed through a classical path and a quantum-computing path.
01 · YOUR PROBLEM

Set your search problem

4

q qubits represent N = 2^q candidate states.

7

|0111⟩

1000

The final quantum state is measured repeatedly.

CURRENT SEARCH SPACE
N 16 candidates
TARGET 7 0111
QUBITS 4 N = 2^q
Find target 7 among 16 candidates.
02 · QPRIMORA TRANSFORMATION

How QPRIMORA transforms the problem

The important step is not simply asking a quantum computer to “find the answer.” The search problem must first be represented as quantum states, and the target condition must become an Oracle that can mark the desired state.

REAL-WORLD PROBLEM Find one target among 16 candidates
↓
SEARCH FUNCTION f(x)=1 only for target Define how a candidate is verified
↓
QUANTUM REPRESENTATION 4 Qubits → 16 States
↓
TARGET STATE 7 → |0111⟩
↓
QUANTUM ALGORITHM Oracle + Diffusion Grover Amplitude Amplification
↓
VIRTUAL QPU Measurement → Answer
QPRIMORA · INSIDE THE TRANSFORMATION

See the transformation step by step

Open each layer to see how an ordinary search request becomes a quantum-state representation and then a Grover computation.

A
REAL PROBLEM What exactly are we searching?
+

There are 16 numbered candidates. Exactly one is the target.

N 16
→
TARGET 7
B
SEARCH PREDICATE How is the target recognized?
+

We define a predicate f(x). It returns 1 only when x is the target.

f(7)=1 · f(x≠7)=0

Grover's complexity advantage assumes that this predicate can be accessed as an Oracle.

C
ENCODING How do candidates become quantum states?
+

q qubits provide 2^q computational-basis states.

4 Qubits → 2⁴ = 16 states
7
→
0111
→
|0111⟩
D
SUPERPOSITION How are all candidates represented together?
+

The register begins in |00...0⟩. Hadamard gates create a uniform superposition over all N candidate states.

H⊗4 |0000⟩ → 1/√16 Σ|x⟩
E
ORACLE + DIFFUSION How does Grover amplify the target?
+

The Oracle phase-marks the target. The diffusion operation then increases its amplitude relative to the other states. Repeating these operations concentrates measurement probability on the target.

Superposition → Oracle → Diffusion → Repeat → Measurement
F
RETURN TO REALITY How does measurement become the answer?
+

The Virtual QPU is measured repeatedly. The most frequently observed bitstring is decoded back into the candidate number.

BITSTRING 0111
→
ANSWER 7
03 · SAME PROBLEM · TWO COMPUTATIONAL PATHS

The same problem, two computational paths

Both paths receive exactly the same problem: find target 7 among 16 candidates.

CLASSICAL

Classical search

Candidate 0 ↓ 1 ↓ 2 ↓ … ↓ Target 7
QUANTUM PATH

Grover Search

16 Candidate States ↓ 4 Qubits ↓ Superposition ↓ Oracle ↓ Diffusion ↓ Virtual QPU ↓ Measurement
WHY SCALE MATTERS

Why Grover Search matters

For an unstructured search problem, classical query complexity grows linearly with N, while Grover's query complexity grows approximately with √N under the Oracle model.

N CLASSICAL GROVER
16 16 ≈ 4
256 256 ≈ 16
10,000 10,000 ≈ 100
1,000,000 1,000,000 ≈ 1,000
1,000,000,000 1,000,000,000 ≈ 31,623
Scientific interpretation

The comparison above concerns Oracle-query complexity. It does not mean that one billion ordinary real-world objects can automatically be searched with only 31,623 simple physical operations. Real implementations must also account for Oracle construction, state preparation, circuit depth, gate errors, error correction, data loading and hardware cost. The Virtual QPU on this website is simulated on classical hardware, so webpage runtime is not evidence of quantum hardware speedup.

QPRIMORA ARCHITECTURE

From real-world intent to quantum computation

Problem → Representation → Oracle → Grover → Virtual QPU → Measurement → Answer

The purpose of this demo is to make the entire path visible: from a simple search request, through quantum representation and computation, and finally back to an understandable answer.