{"query": "How many steps Grover's search needs", "count": 3, "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", "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)", "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", "generated": false}]}