{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:GCSAUE6KSUVGN5QRX6ROTHJB73","short_pith_number":"pith:GCSAUE6K","schema_version":"1.0","canonical_sha256":"30a40a13ca952a66f611bfa2e99d21fefabbdda2bca885bd6d48f261a7d30b0d","source":{"kind":"arxiv","id":"quant-ph/0304052","version":2},"attestation_state":"computed","paper":{"title":"Quantum Search on Bounded-Error Inputs","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Amsterdam), Michele Mosca (Waterloo, Perimeter Institute), Peter Hoyer (Calgary), Ronald de Wolf (CWI","submitted_at":"2003-04-07T16:11:22Z","abstract_excerpt":"Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O(sqrt{n}) repetitions of the base algorithms and with high probability finds the index of a 1-bit among these n bits (if there is such an index). This shows that it is not necessary to first significantly reduce the error probability in the base algorithms to O(1/poly(n)) (which would require O(sqrt{n}log n) repetitions in total). Our technique is a recursive interleaving of amplitude amplification and error-reduction, and may be of more g"},"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/0304052","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-04-07T16:11:22Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"83fec8e17c425daf622953af2b5bbe6bc61c6f4eb5c70d2045081d1c959d72b7","abstract_canon_sha256":"53532ba115d53623ba5f95707e1cedf924fe91d6657274b0b42b4ec12f44922d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:35.443133Z","signature_b64":"QNAO59X4eacx+39e16Pk0jfbNh8Hmf/qOOzfxrGIeCw0NhyG69cUuePeKfC3Ap0waQx6rncpTJfoN+3p56KKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30a40a13ca952a66f611bfa2e99d21fefabbdda2bca885bd6d48f261a7d30b0d","last_reissued_at":"2026-05-18T00:53:35.442700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:35.442700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Search on Bounded-Error Inputs","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Amsterdam), Michele Mosca (Waterloo, Perimeter Institute), Peter Hoyer (Calgary), Ronald de Wolf (CWI","submitted_at":"2003-04-07T16:11:22Z","abstract_excerpt":"Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O(sqrt{n}) repetitions of the base algorithms and with high probability finds the index of a 1-bit among these n bits (if there is such an index). This shows that it is not necessary to first significantly reduce the error probability in the base algorithms to O(1/poly(n)) (which would require O(sqrt{n}log n) repetitions in total). Our technique is a recursive interleaving of amplitude amplification and error-reduction, and may be of more g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0304052","kind":"arxiv","version":2},"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/0304052","created_at":"2026-05-18T00:53:35.442776+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0304052v2","created_at":"2026-05-18T00:53:35.442776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0304052","created_at":"2026-05-18T00:53:35.442776+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCSAUE6KSUVG","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCSAUE6KSUVGN5QR","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCSAUE6K","created_at":"2026-05-18T12:25:52.051335+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GCSAUE6KSUVGN5QRX6ROTHJB73","json":"https://pith.science/pith/GCSAUE6KSUVGN5QRX6ROTHJB73.json","graph_json":"https://pith.science/api/pith-number/GCSAUE6KSUVGN5QRX6ROTHJB73/graph.json","events_json":"https://pith.science/api/pith-number/GCSAUE6KSUVGN5QRX6ROTHJB73/events.json","paper":"https://pith.science/paper/GCSAUE6K"},"agent_actions":{"view_html":"https://pith.science/pith/GCSAUE6KSUVGN5QRX6ROTHJB73","download_json":"https://pith.science/pith/GCSAUE6KSUVGN5QRX6ROTHJB73.json","view_paper":"https://pith.science/paper/GCSAUE6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0304052&json=true","fetch_graph":"https://pith.science/api/pith-number/GCSAUE6KSUVGN5QRX6ROTHJB73/graph.json","fetch_events":"https://pith.science/api/pith-number/GCSAUE6KSUVGN5QRX6ROTHJB73/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCSAUE6KSUVGN5QRX6ROTHJB73/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCSAUE6KSUVGN5QRX6ROTHJB73/action/storage_attestation","attest_author":"https://pith.science/pith/GCSAUE6KSUVGN5QRX6ROTHJB73/action/author_attestation","sign_citation":"https://pith.science/pith/GCSAUE6KSUVGN5QRX6ROTHJB73/action/citation_signature","submit_replication":"https://pith.science/pith/GCSAUE6KSUVGN5QRX6ROTHJB73/action/replication_record"}},"created_at":"2026-05-18T00:53:35.442776+00:00","updated_at":"2026-05-18T00:53:35.442776+00:00"}