NarrowHighway

A card from a free library — ask anything, no account, works offline. Every card carries its source.

How many steps Grover's search needs

physical

To find one item among four with a quantum computer, Grover's algorithm needs just one iteration — ⌊π√N/4⌋ — where a classical search averages 2.5 look-ups. Worked & sealed by the engine — T = ⌊π√4 / 4⌋ = 1 iteration. [HOLDS; open the seal to re-check.]

source
The Works — worked & sealed ↗
card id
card_works_grover

related in the keeping ↗ · its seal ↗ · raw JSON ↗

adjoining cards

Is this card incomplete? Tell the library — it will call out for more ↗