{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1996:MCD6GF7MZI6S6LFXI2VB6GFIND","short_pith_number":"pith:MCD6GF7M","schema_version":"1.0","canonical_sha256":"6087e317ecca3d2f2cb746aa1f18a868da8b7836926ef18f8f9e0e4b9e048203","source":{"kind":"arxiv","id":"quant-ph/9605043","version":3},"attestation_state":"computed","paper":{"title":"A fast quantum mechanical algorithm for database search","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lov K. Grover (Bell Labs, Murray Hill NJ)","submitted_at":"1996-05-29T19:09:06Z","abstract_excerpt":"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 "},"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/9605043","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1996-05-29T19:09:06Z","cross_cats_sorted":[],"title_canon_sha256":"6d347ac05f7034ba7d3a47651aaebfd30257a821da01c90f1a3dbd667b7b9c15","abstract_canon_sha256":"d109d7247ae598938e3b1b4877d1687c5902e420e6ae84997aac5cc0bce22bf5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:07:57.826979Z","signature_b64":"TWRFbJV3BWAm68/uHEjHP2v+mlS/jZvE0pl41vKOsZlfFrqQL295DJ9gmKrLNfVBjcmG1eA57g7H39POz4oACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6087e317ecca3d2f2cb746aa1f18a868da8b7836926ef18f8f9e0e4b9e048203","last_reissued_at":"2026-07-04T15:07:57.826569Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:07:57.826569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A fast quantum mechanical algorithm for database search","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lov K. Grover (Bell Labs, Murray Hill NJ)","submitted_at":"1996-05-29T19:09:06Z","abstract_excerpt":"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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9605043","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/9605043/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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/9605043","created_at":"2026-07-04T15:07:57.826620+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9605043v3","created_at":"2026-07-04T15:07:57.826620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9605043","created_at":"2026-07-04T15:07:57.826620+00:00"},{"alias_kind":"pith_short_12","alias_value":"MCD6GF7MZI6S","created_at":"2026-07-04T15:07:57.826620+00:00"},{"alias_kind":"pith_short_16","alias_value":"MCD6GF7MZI6S6LFX","created_at":"2026-07-04T15:07:57.826620+00:00"},{"alias_kind":"pith_short_8","alias_value":"MCD6GF7M","created_at":"2026-07-04T15:07:57.826620+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":17,"internal_anchor_count":13,"sample":[{"citing_arxiv_id":"2605.12675","citing_title":"Answer Partitions and Oracle Access Determine Quantum Query Complexity","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2606.31351","citing_title":"A Quantum-Classical Surrogate Model for the Collision Operator of the Lattice Boltzmann Method","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2606.29962","citing_title":"BPBO: Blindness-Preserving Brickwork Optimization by Certified Region Resynthesis","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2606.04817","citing_title":"Effect of isotropic errors on the complexity of Grover's algorithm","ref_index":41,"is_internal_anchor":true},{"citing_arxiv_id":"2605.23442","citing_title":"Ancilla-Efficient QSAMPLE Preparation for Reversible Markov Chains","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2311.10433","citing_title":"Task Scheduling Optimization with Direct Constraints from a Tensor Network Perspective","ref_index":64,"is_internal_anchor":true},{"citing_arxiv_id":"2406.12086","citing_title":"A shortcut to an optimal quantum linear system solver","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2605.22392","citing_title":"The relative entropy of magic and its nonadditivity","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12675","citing_title":"Answer Partitions and Oracle Access Determine Quantum Query Complexity","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2507.04337","citing_title":"Efficient Simulation of High-Level Quantum Gates","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2508.02855","citing_title":"A resource-efficient quantum-walker Quantum RAM","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2508.09103","citing_title":"Constrained free energy minimization for the design of thermal states and stabilizer thermodynamic systems","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12675","citing_title":"Answer Partitions and Oracle Access Determine Quantum Query Complexity","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2604.24869","citing_title":"Network Impact of Post-Quantum Certificate Chain sizes on Time to First Byte in TLS Deployments","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24297","citing_title":"Exhaustive and feasible parametrisation with applications to the travelling salesperson problem","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00312","citing_title":"Quantum Decoding Algorithms: Quantum Speedups in Optimization","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14757","citing_title":"Activating entanglement and EPR steering from continuous-variable resources using witness-based measures","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MCD6GF7MZI6S6LFXI2VB6GFIND","json":"https://pith.science/pith/MCD6GF7MZI6S6LFXI2VB6GFIND.json","graph_json":"https://pith.science/api/pith-number/MCD6GF7MZI6S6LFXI2VB6GFIND/graph.json","events_json":"https://pith.science/api/pith-number/MCD6GF7MZI6S6LFXI2VB6GFIND/events.json","paper":"https://pith.science/paper/MCD6GF7M"},"agent_actions":{"view_html":"https://pith.science/pith/MCD6GF7MZI6S6LFXI2VB6GFIND","download_json":"https://pith.science/pith/MCD6GF7MZI6S6LFXI2VB6GFIND.json","view_paper":"https://pith.science/paper/MCD6GF7M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9605043&json=true","fetch_graph":"https://pith.science/api/pith-number/MCD6GF7MZI6S6LFXI2VB6GFIND/graph.json","fetch_events":"https://pith.science/api/pith-number/MCD6GF7MZI6S6LFXI2VB6GFIND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MCD6GF7MZI6S6LFXI2VB6GFIND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MCD6GF7MZI6S6LFXI2VB6GFIND/action/storage_attestation","attest_author":"https://pith.science/pith/MCD6GF7MZI6S6LFXI2VB6GFIND/action/author_attestation","sign_citation":"https://pith.science/pith/MCD6GF7MZI6S6LFXI2VB6GFIND/action/citation_signature","submit_replication":"https://pith.science/pith/MCD6GF7MZI6S6LFXI2VB6GFIND/action/replication_record"}},"created_at":"2026-07-04T15:07:57.826620+00:00","updated_at":"2026-07-04T15:07:57.826620+00:00"}