{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2000:YZXB4G6TNDPLNQQSCYGYXDCTAC","short_pith_number":"pith:YZXB4G6T","canonical_record":{"source":{"id":"quant-ph/0005055","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2000-05-15T18:19:59Z","cross_cats_sorted":[],"title_canon_sha256":"a7ad7296667be27d18c159bf309f34f05cfe9adedc40ff5029dbd5675b147e95","abstract_canon_sha256":"07210f9413dd2b64df518d4ff6beb29a9f396ee56692751fb5d6132a9ad8c043"},"schema_version":"1.0"},"canonical_sha256":"c66e1e1bd368deb6c212160d8b8c53008ec368e35bf5018a7bdb71322c94b685","source":{"kind":"arxiv","id":"quant-ph/0005055","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0005055","created_at":"2026-05-17T23:38:49Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0005055v1","created_at":"2026-05-17T23:38:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0005055","created_at":"2026-05-17T23:38:49Z"},{"alias_kind":"pith_short_12","alias_value":"YZXB4G6TNDPL","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"YZXB4G6TNDPLNQQS","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"YZXB4G6T","created_at":"2026-05-18T12:25:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2000:YZXB4G6TNDPLNQQSCYGYXDCTAC","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0005055","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2000-05-15T18:19:59Z","cross_cats_sorted":[],"title_canon_sha256":"a7ad7296667be27d18c159bf309f34f05cfe9adedc40ff5029dbd5675b147e95","abstract_canon_sha256":"07210f9413dd2b64df518d4ff6beb29a9f396ee56692751fb5d6132a9ad8c043"},"schema_version":"1.0"},"canonical_sha256":"c66e1e1bd368deb6c212160d8b8c53008ec368e35bf5018a7bdb71322c94b685","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:49.186850Z","signature_b64":"QFSm3/D9PeDwqVIuHgv/MqF4LLX5vPdhilhouKHgTQrP6Jx4CiOFBPYxuP8Uq4/8+OvNNjryYj7xOhXBiG82CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c66e1e1bd368deb6c212160d8b8c53008ec368e35bf5018a7bdb71322c94b685","last_reissued_at":"2026-05-17T23:38:49.186344Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:49.186344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0005055","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:38:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q1/sl85CJUOfhu/ll5lS/E0rLtjChYE9TNcEfcB1Xmr1h+fya5xkO+dDnho026OSrJsbj8SpU9CG2v6nMzsQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:12:14.979036Z"},"content_sha256":"2a6e3f9aa73c88e3553f0e61f55f30724f7c3cc8b8506e46bc1590f4c38a4b74","schema_version":"1.0","event_id":"sha256:2a6e3f9aa73c88e3553f0e61f55f30724f7c3cc8b8506e46bc1590f4c38a4b74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2000:YZXB4G6TNDPLNQQSCYGYXDCTAC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Amplitude Amplification and Estimation","license":"","headline":"Amplitude amplification finds a good element after a number of steps proportional to one over the square root of its initial probability.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"(2) BRICS University of Aarhus, (3) CACR University of Waterloo), Alain Tapp (3) ((1) DIRO Universite de Montreal, Gilles Brassard (1), Michele Mosca (3), Peter Hoyer (2)","submitted_at":"2000-05-15T18:19:59Z","abstract_excerpt":"Consider a Boolean function $\\chi: X \\to \\{0,1\\}$ that partitions set $X$ between its good and bad elements, where $x$ is good if $\\chi(x)=1$ and bad otherwise. Consider also a quantum algorithm $\\mathcal A$ such that $A |0\\rangle= \\sum_{x\\in X} \\alpha_x |x\\rangle$ is a quantum superposition of the elements of $X$, and let $a$ denote the probability that a good element is produced if $A |0\\rangle$ is measured. If we repeat the process of running $A$, measuring the output, and using $\\chi$ to check the validity of the result, we shall expect to repeat $1/a$ times on the average before a solutio"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Amplitude amplification finds a good x after expected applications of A and inverse proportional to 1/sqrt(a), generalizing Grover's algorithm.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"Algorithm A makes no measurements and is unitary.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Amplitude amplification finds solutions quadratically faster than classical methods and enables quantum estimation of solution counts.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Amplitude amplification finds a good element after a number of steps proportional to one over the square root of its initial probability.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e6b198b377f4eb56d0a1fee57edc7c51dcac51ee778ad307baddc6cd8ca3aa67"},"source":{"id":"quant-ph/0005055","kind":"arxiv","version":1},"verdict":{"id":"805e2622-963c-444d-be6a-4401743b2195","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T03:39:06.064896Z","strongest_claim":"Amplitude amplification finds a good x after expected applications of A and inverse proportional to 1/sqrt(a), generalizing Grover's algorithm.","one_line_summary":"Amplitude amplification finds solutions quadratically faster than classical methods and enables quantum estimation of solution counts.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"Algorithm A makes no measurements and is unitary.","pith_extraction_headline":"Amplitude amplification finds a good element after a number of steps proportional to one over the square root of its initial probability."},"references":{"count":15,"sample":[{"doi":"","year":1998,"title":"Quantum lower bounds by polynomials","work_id":"88db342f-2783-446b-b3f3-2d1d1daf77d5","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1988,"title":"Notes on the history of reversible computatio n","work_id":"40545b08-cdbe-4001-a34a-571c88f8cbb5","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"Tight bounds on quantum searching","work_id":"607ede23-cae8-44dd-9b38-ac66ece911bd","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1997,"title":"An exact quantum polynomial- time algorithm for Simon’s problem","work_id":"8003070e-59eb-4ca5-8ff6-093fbdc75095","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"Quantum count- ing","work_id":"c489dd43-7c82-4ea8-9fc2-4821d54d562d","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":15,"snapshot_sha256":"c34ae57493df0a2548a89c43f1abef05d49d9cbd6be30cc15068a40f290710b5","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"6b096659011d0abc58c79920dc230039088f57c2a4c10898f9c8e6c794c69bec"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"805e2622-963c-444d-be6a-4401743b2195"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:38:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G8tYJ24t+DXawwYYJP2pT0mv7GsstcmLoIDApmKh8H/eVnaiRMWCBNyJMeclwdxIP1bCghXY1WmuzEeuKuP0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:12:14.980129Z"},"content_sha256":"9904fc1679bcabc917f911969544c0a9edde30f0e4a684d3ad4be373b9ce79b9","schema_version":"1.0","event_id":"sha256:9904fc1679bcabc917f911969544c0a9edde30f0e4a684d3ad4be373b9ce79b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZXB4G6TNDPLNQQSCYGYXDCTAC/bundle.json","state_url":"https://pith.science/pith/YZXB4G6TNDPLNQQSCYGYXDCTAC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZXB4G6TNDPLNQQSCYGYXDCTAC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T12:12:14Z","links":{"resolver":"https://pith.science/pith/YZXB4G6TNDPLNQQSCYGYXDCTAC","bundle":"https://pith.science/pith/YZXB4G6TNDPLNQQSCYGYXDCTAC/bundle.json","state":"https://pith.science/pith/YZXB4G6TNDPLNQQSCYGYXDCTAC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZXB4G6TNDPLNQQSCYGYXDCTAC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2000:YZXB4G6TNDPLNQQSCYGYXDCTAC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"07210f9413dd2b64df518d4ff6beb29a9f396ee56692751fb5d6132a9ad8c043","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2000-05-15T18:19:59Z","title_canon_sha256":"a7ad7296667be27d18c159bf309f34f05cfe9adedc40ff5029dbd5675b147e95"},"schema_version":"1.0","source":{"id":"quant-ph/0005055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0005055","created_at":"2026-05-17T23:38:49Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0005055v1","created_at":"2026-05-17T23:38:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0005055","created_at":"2026-05-17T23:38:49Z"},{"alias_kind":"pith_short_12","alias_value":"YZXB4G6TNDPL","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"YZXB4G6TNDPLNQQS","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"YZXB4G6T","created_at":"2026-05-18T12:25:50Z"}],"graph_snapshots":[{"event_id":"sha256:9904fc1679bcabc917f911969544c0a9edde30f0e4a684d3ad4be373b9ce79b9","target":"graph","created_at":"2026-05-17T23:38:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Amplitude amplification finds a good x after expected applications of A and inverse proportional to 1/sqrt(a), generalizing Grover's algorithm."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"Algorithm A makes no measurements and is unitary."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Amplitude amplification finds solutions quadratically faster than classical methods and enables quantum estimation of solution counts."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Amplitude amplification finds a good element after a number of steps proportional to one over the square root of its initial probability."}],"snapshot_sha256":"e6b198b377f4eb56d0a1fee57edc7c51dcac51ee778ad307baddc6cd8ca3aa67"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"6b096659011d0abc58c79920dc230039088f57c2a4c10898f9c8e6c794c69bec"},"paper":{"abstract_excerpt":"Consider a Boolean function $\\chi: X \\to \\{0,1\\}$ that partitions set $X$ between its good and bad elements, where $x$ is good if $\\chi(x)=1$ and bad otherwise. Consider also a quantum algorithm $\\mathcal A$ such that $A |0\\rangle= \\sum_{x\\in X} \\alpha_x |x\\rangle$ is a quantum superposition of the elements of $X$, and let $a$ denote the probability that a good element is produced if $A |0\\rangle$ is measured. If we repeat the process of running $A$, measuring the output, and using $\\chi$ to check the validity of the result, we shall expect to repeat $1/a$ times on the average before a solutio","authors_text":"(2) BRICS University of Aarhus, (3) CACR University of Waterloo), Alain Tapp (3) ((1) DIRO Universite de Montreal, Gilles Brassard (1), Michele Mosca (3), Peter Hoyer (2)","cross_cats":[],"headline":"Amplitude amplification finds a good element after a number of steps proportional to one over the square root of its initial probability.","license":"","primary_cat":"quant-ph","submitted_at":"2000-05-15T18:19:59Z","title":"Quantum Amplitude Amplification and Estimation"},"references":{"count":15,"internal_anchors":1,"resolved_work":15,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Quantum lower bounds by polynomials","work_id":"88db342f-2783-446b-b3f3-2d1d1daf77d5","year":1998},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Notes on the history of reversible computatio n","work_id":"40545b08-cdbe-4001-a34a-571c88f8cbb5","year":1988},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Tight bounds on quantum searching","work_id":"607ede23-cae8-44dd-9b38-ac66ece911bd","year":1998},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"An exact quantum polynomial- time algorithm for Simon’s problem","work_id":"8003070e-59eb-4ca5-8ff6-093fbdc75095","year":1997},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Quantum count- ing","work_id":"c489dd43-7c82-4ea8-9fc2-4821d54d562d","year":1998}],"snapshot_sha256":"c34ae57493df0a2548a89c43f1abef05d49d9cbd6be30cc15068a40f290710b5"},"source":{"id":"quant-ph/0005055","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-16T03:39:06.064896Z","id":"805e2622-963c-444d-be6a-4401743b2195","model_set":{"reader":"grok-4.3"},"one_line_summary":"Amplitude amplification finds solutions quadratically faster than classical methods and enables quantum estimation of solution counts.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Amplitude amplification finds a good element after a number of steps proportional to one over the square root of its initial probability.","strongest_claim":"Amplitude amplification finds a good x after expected applications of A and inverse proportional to 1/sqrt(a), generalizing Grover's algorithm.","weakest_assumption":"Algorithm A makes no measurements and is unitary."}},"verdict_id":"805e2622-963c-444d-be6a-4401743b2195"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2a6e3f9aa73c88e3553f0e61f55f30724f7c3cc8b8506e46bc1590f4c38a4b74","target":"record","created_at":"2026-05-17T23:38:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"07210f9413dd2b64df518d4ff6beb29a9f396ee56692751fb5d6132a9ad8c043","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2000-05-15T18:19:59Z","title_canon_sha256":"a7ad7296667be27d18c159bf309f34f05cfe9adedc40ff5029dbd5675b147e95"},"schema_version":"1.0","source":{"id":"quant-ph/0005055","kind":"arxiv","version":1}},"canonical_sha256":"c66e1e1bd368deb6c212160d8b8c53008ec368e35bf5018a7bdb71322c94b685","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c66e1e1bd368deb6c212160d8b8c53008ec368e35bf5018a7bdb71322c94b685","first_computed_at":"2026-05-17T23:38:49.186344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:49.186344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QFSm3/D9PeDwqVIuHgv/MqF4LLX5vPdhilhouKHgTQrP6Jx4CiOFBPYxuP8Uq4/8+OvNNjryYj7xOhXBiG82CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:49.186850Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0005055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a6e3f9aa73c88e3553f0e61f55f30724f7c3cc8b8506e46bc1590f4c38a4b74","sha256:9904fc1679bcabc917f911969544c0a9edde30f0e4a684d3ad4be373b9ce79b9"],"state_sha256":"e19b56e79a309a71ab57ffb824a131604a22f2c4860c60e4cf0b86e732728570"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YWte9BZLEqeYZuqmB8nZT9/1JDXRj0aG8rA8F1GoYMD9OnLHu/IdJtNG0SDNnlLIgvAw9PTGX5JenNR9m0IwAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T12:12:14.985492Z","bundle_sha256":"25471c19e08529cd4f92353d0f3887878b4757816a74310d15251bde158f6a3b"}}