{"query": "How many steps Grover's search needs", "count": 4, "results": [{"id": "card_works_grover", "title": "How many steps Grover's search needs", "shelf": "the-works", "surface": "secular", "snippet": "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 /", "authority_tier": "verified", "source": "The Works — worked & sealed", "readable": false, "generated": false}, {"id": "card_floor_quantum_computing", "title": "Quantum computing — qubits and superposition", "shelf": "codex", "surface": "secular", "snippet": "A qubit is a superposition of 0 and 1, so n qubits hold 2^n amplitudes; the power is interference (Grover, Shor). Pillars rest on quantum mechanics (superposition, entanglement) and computer science (", "authority_tier": "engine_derived", "source": "Narrow Highway — qc", "readable": false, "generated": false}, {"id": "card_alm_almanac_quantum_grover_search", "title": "Almanac: Grover's search -- square-root, not linear (and not magic)", "shelf": "almanac", "surface": "secular", "snippet": "SITUATION\n  To find one marked item among N with no structure to exploit, a classical search needs about N/2 looks on average. Grover's quantum algorithm (1996) needs about T = floor(pi*sqrt(N)/4) -- ", "authority_tier": "reference", "source": "The Almanac — verified-only practical wisdom (sealed)", "readable": false, "generated": false}, {"id": "card_src_pron_grover_s", "title": "grover's", "shelf": "pronunciation", "surface": "secular", "snippet": "grover's: pronounced (ARPABET) G R OW1 V ER0 Z. From the CMU Pronouncing Dictionary — the standard machine-readable pronunciations of North American English.", "authority_tier": "reference", "source": "CMU Pronouncing Dictionary (cmudict) — BSD-2-Clause, Carnegie Mellon", "readable": false, "generated": false}], "house": {"door": "FIND", "kind": "cards", "trail": "results", "seal": null, "next_step": {"do": "open the top card", "door": "FIND", "tool": "card_get", "params": {"id": "card_works_grover"}}, "ends": "a verdict or a card · the trail · a seal · one next step"}}