{"work":{"id":"fdbe1db9-85bf-47b2-be13-2717933a2ac6","openalex_id":null,"doi":null,"arxiv_id":"quant-ph/9607014","raw_key":null,"title":"A Quantum Algorithm for Finding the Minimum","authors":null,"authors_text":"A quantum algorithm for finding the minimum , author=","year":1996,"venue":"quant-ph","abstract":"We give a quantum algorithm to find the index y in a table T of size N such that in time O(c sqrt N), T[y] is minimum with probability at least 1-1/2^c.","external_url":"https://arxiv.org/abs/quant-ph/9607014","cited_by_count":null,"metadata_source":"pith","metadata_fetched_at":"2026-05-25T19:06:09.038844+00:00","pith_arxiv_id":"quant-ph/9607014","created_at":"2026-05-11T23:21:18.787275+00:00","updated_at":"2026-06-05T21:23:00.469572+00:00","title_quality_ok":true,"display_title":"A Quantum Algorithm for Finding the Minimum","render_title":"A Quantum Algorithm for Finding the Minimum"},"hub":{"state":{"work_id":"fdbe1db9-85bf-47b2-be13-2717933a2ac6","tier":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":10,"external_cited_by_count":null,"distinct_field_count":5,"first_pith_cited_at":"2019-06-21T08:52:11+00:00","last_pith_cited_at":"2026-05-19T05:35:06+00:00","author_build_status":"not_needed","summary_status":"needed","contexts_status":"needed","graph_status":"needed","ask_index_status":"not_needed","reader_status":"not_needed","recognition_status":"not_needed","updated_at":"2026-05-26T00:06:10.137340+00:00","tier_text":"hub"},"tier":"hub","role_counts":[],"polarity_counts":[],"runs":{},"summary":{},"graph":{},"authors":[]}}