{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1997:MRJPQNOVDATH75YPM3JCA2ZIFJ","short_pith_number":"pith:MRJPQNOV","schema_version":"1.0","canonical_sha256":"6452f835d518267ff70f66d2206b282a673b4c599365e7e3a35a28843d1b56c7","source":{"kind":"arxiv","id":"quant-ph/9712011","version":1},"attestation_state":"computed","paper":{"title":"Quantum computers can search rapidly by using almost any transformation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lov K. Grover (Bell Labs, Murray Hill, NJ)","submitted_at":"1997-12-03T22:06:53Z","abstract_excerpt":"A quantum computer has a clear advantage over a classical computer for exhaustive search. The quantum mechanical algorithm for exhaustive search was originally derived by using subtle properties of a particular quantum mechanical operation called the Walsh-Hadamard (W-H) transform. This paper shows that this algorithm can be implemented by replacing the W-H transform by almost any quantum mechanical operation. This leads to several new applications where it improves the number of steps by a square-root. It also broadens the scope for implementation since it demonstrates quantum mechanical algo"},"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/9712011","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1997-12-03T22:06:53Z","cross_cats_sorted":[],"title_canon_sha256":"47531a8e32c88ac1022d7b6c95ba440d3c926c8fca359d42c8a7a6d3bf8ef784","abstract_canon_sha256":"ab68411d679bbb71279d42c919de29e68f58a15e26f7ad9e616d3f881fee0947"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:36:42.242044Z","signature_b64":"+S/P41pu6OELB5RYvbiJheU29afqWA6J7dedlkEVY6mQB6XJAAnqEO/jbGvJjq2SPHl+GmEcXZVhvdPp+dv7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6452f835d518267ff70f66d2206b282a673b4c599365e7e3a35a28843d1b56c7","last_reissued_at":"2026-07-04T15:36:42.241618Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:36:42.241618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum computers can search rapidly by using almost any transformation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lov K. Grover (Bell Labs, Murray Hill, NJ)","submitted_at":"1997-12-03T22:06:53Z","abstract_excerpt":"A quantum computer has a clear advantage over a classical computer for exhaustive search. The quantum mechanical algorithm for exhaustive search was originally derived by using subtle properties of a particular quantum mechanical operation called the Walsh-Hadamard (W-H) transform. This paper shows that this algorithm can be implemented by replacing the W-H transform by almost any quantum mechanical operation. This leads to several new applications where it improves the number of steps by a square-root. It also broadens the scope for implementation since it demonstrates quantum mechanical algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9712011","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/9712011/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/9712011","created_at":"2026-07-04T15:36:42.241685+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9712011v1","created_at":"2026-07-04T15:36:42.241685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9712011","created_at":"2026-07-04T15:36:42.241685+00:00"},{"alias_kind":"pith_short_12","alias_value":"MRJPQNOVDATH","created_at":"2026-07-04T15:36:42.241685+00:00"},{"alias_kind":"pith_short_16","alias_value":"MRJPQNOVDATH75YP","created_at":"2026-07-04T15:36:42.241685+00:00"},{"alias_kind":"pith_short_8","alias_value":"MRJPQNOV","created_at":"2026-07-04T15:36:42.241685+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.12385","citing_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","ref_index":246,"is_internal_anchor":true},{"citing_arxiv_id":"2605.10768","citing_title":"Unitaria: Quantum Linear Algebra via Block Encodings","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MRJPQNOVDATH75YPM3JCA2ZIFJ","json":"https://pith.science/pith/MRJPQNOVDATH75YPM3JCA2ZIFJ.json","graph_json":"https://pith.science/api/pith-number/MRJPQNOVDATH75YPM3JCA2ZIFJ/graph.json","events_json":"https://pith.science/api/pith-number/MRJPQNOVDATH75YPM3JCA2ZIFJ/events.json","paper":"https://pith.science/paper/MRJPQNOV"},"agent_actions":{"view_html":"https://pith.science/pith/MRJPQNOVDATH75YPM3JCA2ZIFJ","download_json":"https://pith.science/pith/MRJPQNOVDATH75YPM3JCA2ZIFJ.json","view_paper":"https://pith.science/paper/MRJPQNOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9712011&json=true","fetch_graph":"https://pith.science/api/pith-number/MRJPQNOVDATH75YPM3JCA2ZIFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/MRJPQNOVDATH75YPM3JCA2ZIFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MRJPQNOVDATH75YPM3JCA2ZIFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MRJPQNOVDATH75YPM3JCA2ZIFJ/action/storage_attestation","attest_author":"https://pith.science/pith/MRJPQNOVDATH75YPM3JCA2ZIFJ/action/author_attestation","sign_citation":"https://pith.science/pith/MRJPQNOVDATH75YPM3JCA2ZIFJ/action/citation_signature","submit_replication":"https://pith.science/pith/MRJPQNOVDATH75YPM3JCA2ZIFJ/action/replication_record"}},"created_at":"2026-07-04T15:36:42.241685+00:00","updated_at":"2026-07-04T15:36:42.241685+00:00"}