{"work":{"id":"9074c843-e00b-49a7-a670-891d26cae0bb","openalex_id":null,"doi":null,"arxiv_id":"quant-ph/9605043","raw_key":null,"title":"A fast quantum mechanical algorithm for database search","authors":null,"authors_text":"L","year":1996,"venue":"quant-ph","abstract":"Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a 50% probability, any classical algorithm (whether deterministic or probabilistic) will need to look at a minimum of N/2 names. Quantum mechanical systems can be in a superposition of states and simultaneously examine multiple names. By properly adjusting the phases of various operations, successful computations reinforce each other while others interfere randomly. As a result, the desired phone number can be obtained in only O(sqrt(N)) steps. The algorithm is within a small constant factor of the fastest possible quantum mechanical algorithm.","external_url":"https://arxiv.org/abs/quant-ph/9605043","cited_by_count":null,"metadata_source":"pith","metadata_fetched_at":"2026-07-01T14:15:47.275445+00:00","pith_arxiv_id":"quant-ph/9605043","created_at":"2026-05-10T11:35:18.646445+00:00","updated_at":"2026-07-01T14:15:47.275445+00:00","title_quality_ok":true,"display_title":"A fast quantum mechanical algorithm for database search","render_title":"A fast quantum mechanical algorithm for database search"},"hub":{"state":{"work_id":"9074c843-e00b-49a7-a670-891d26cae0bb","tier":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":15,"external_cited_by_count":null,"distinct_field_count":2,"first_pith_cited_at":"2023-11-17T10:10:46+00:00","last_pith_cited_at":"2026-06-30T08:47:36+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-08-22T05:10:05.510355+00:00","tier_text":"hub"},"tier":"hub","role_counts":[{"context_role":"background","n":2}],"polarity_counts":[{"context_polarity":"background","n":2}],"runs":{},"summary":{},"graph":{},"authors":[]}}