{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:YISD4VGWR4KAZW7HZ7Q5IVF575","short_pith_number":"pith:YISD4VGW","schema_version":"1.0","canonical_sha256":"c2243e54d68f140cdbe7cfe1d454bdff4b0ae9dfd44bd561e73cac35a09a703b","source":{"kind":"arxiv","id":"quant-ph/0503205","version":1},"attestation_state":"computed","paper":{"title":"A different kind of quantum search","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lov K. Grover (Bell Labs, Lucent)","submitted_at":"2005-03-28T15:41:21Z","abstract_excerpt":"The quantum search algorithm consists of an alternating sequence of selective inversions and diffusion type operations, as a result of which it can find a target state in an unsorted database of size N in only sqrt(N) queries. This paper shows that by replacing the selective inversions by selective phase shifts of Pi/3, the algorithm gets transformed into something similar to a classical search algorithm. Just like classical search algorithms this algorithm has a fixed point in state-space toward which it preferentially converges. In contrast, the original quantum search algorithm moves unifor"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"quant-ph/0503205","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-03-28T15:41:21Z","cross_cats_sorted":[],"title_canon_sha256":"addbd9094485be47249558265d1a2936759ee78804b0a07f17799ebd9c9f0f9e","abstract_canon_sha256":"4691a3c6bfbc56fc4bdfa178aab427b8f0e3c7cc25cf1076e9ea0f4ca8a61dc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:19.875709Z","signature_b64":"6o22UgawE+TIND/CGF27Pf4xTTMk7ROzGG15vsSJdJ25U6eT5TqufmmBCp3hvxHpKUEna46EAWqQqDXVKe9TAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2243e54d68f140cdbe7cfe1d454bdff4b0ae9dfd44bd561e73cac35a09a703b","last_reissued_at":"2026-05-18T03:24:19.874974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:19.874974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A different kind of quantum search","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lov K. Grover (Bell Labs, Lucent)","submitted_at":"2005-03-28T15:41:21Z","abstract_excerpt":"The quantum search algorithm consists of an alternating sequence of selective inversions and diffusion type operations, as a result of which it can find a target state in an unsorted database of size N in only sqrt(N) queries. This paper shows that by replacing the selective inversions by selective phase shifts of Pi/3, the algorithm gets transformed into something similar to a classical search algorithm. Just like classical search algorithms this algorithm has a fixed point in state-space toward which it preferentially converges. In contrast, the original quantum search algorithm moves unifor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0503205","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0503205","created_at":"2026-05-18T03:24:19.875103+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0503205v1","created_at":"2026-05-18T03:24:19.875103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0503205","created_at":"2026-05-18T03:24:19.875103+00:00"},{"alias_kind":"pith_short_12","alias_value":"YISD4VGWR4KA","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"YISD4VGWR4KAZW7H","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"YISD4VGW","created_at":"2026-05-18T12:25:53.939244+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.27482","citing_title":"Finite Imaginary-Time Evolution for Polynomial Unconstrained Binary Optimization","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YISD4VGWR4KAZW7HZ7Q5IVF575","json":"https://pith.science/pith/YISD4VGWR4KAZW7HZ7Q5IVF575.json","graph_json":"https://pith.science/api/pith-number/YISD4VGWR4KAZW7HZ7Q5IVF575/graph.json","events_json":"https://pith.science/api/pith-number/YISD4VGWR4KAZW7HZ7Q5IVF575/events.json","paper":"https://pith.science/paper/YISD4VGW"},"agent_actions":{"view_html":"https://pith.science/pith/YISD4VGWR4KAZW7HZ7Q5IVF575","download_json":"https://pith.science/pith/YISD4VGWR4KAZW7HZ7Q5IVF575.json","view_paper":"https://pith.science/paper/YISD4VGW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0503205&json=true","fetch_graph":"https://pith.science/api/pith-number/YISD4VGWR4KAZW7HZ7Q5IVF575/graph.json","fetch_events":"https://pith.science/api/pith-number/YISD4VGWR4KAZW7HZ7Q5IVF575/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YISD4VGWR4KAZW7HZ7Q5IVF575/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YISD4VGWR4KAZW7HZ7Q5IVF575/action/storage_attestation","attest_author":"https://pith.science/pith/YISD4VGWR4KAZW7HZ7Q5IVF575/action/author_attestation","sign_citation":"https://pith.science/pith/YISD4VGWR4KAZW7HZ7Q5IVF575/action/citation_signature","submit_replication":"https://pith.science/pith/YISD4VGWR4KAZW7HZ7Q5IVF575/action/replication_record"}},"created_at":"2026-05-18T03:24:19.875103+00:00","updated_at":"2026-05-18T03:24:19.875103+00:00"}