{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:YZXB4G6TNDPLNQQSCYGYXDCTAC","short_pith_number":"pith:YZXB4G6T","schema_version":"1.0","canonical_sha256":"c66e1e1bd368deb6c212160d8b8c53008ec368e35bf5018a7bdb71322c94b685","source":{"kind":"arxiv","id":"quant-ph/0005055","version":1},"attestation_state":"computed","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"},"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":true,"formal_links_present":true},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0005055","created_at":"2026-05-17T23:38:49.186432+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0005055v1","created_at":"2026-05-17T23:38:49.186432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0005055","created_at":"2026-05-17T23:38:49.186432+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZXB4G6TNDPL","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZXB4G6TNDPLNQQS","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZXB4G6T","created_at":"2026-05-18T12:25:50.254431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":24,"internal_anchor_count":24,"sample":[{"citing_arxiv_id":"2505.22217","citing_title":"Benincasa-Dowker-Glaser causal set actions by quantum counting","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2605.22980","citing_title":"Automatic De-Quantization of Quantum Programs Using Constant Propagation","ref_index":44,"is_internal_anchor":true},{"citing_arxiv_id":"2111.07992","citing_title":"Query and Depth Upper Bounds for Quantum Unitaries via Grover Search","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2406.12086","citing_title":"A shortcut to an optimal quantum linear system solver","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16429","citing_title":"QuantFPFlow: Quantum Amplitude Estimation for Fokker--Planck Policy Optimisation in Continuous Reinforcement Learning","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16189","citing_title":"Quantum Solvers for Nonlinear Matrix Equations in Quantum Chemistry","ref_index":73,"is_internal_anchor":true},{"citing_arxiv_id":"2603.18222","citing_title":"An HHL-Based Quantum-Classical Solver for the Incompressible Navier-Stokes Equations with Approximate QST","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2603.26039","citing_title":"Achieving double-logarithmic precision dependence in optimization-based quantum unstructured search","ref_index":37,"is_internal_anchor":true},{"citing_arxiv_id":"2603.27858","citing_title":"Exponentially cheaper coherent phase estimation via uncontrolled unitaries","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27482","citing_title":"Finite Imaginary-Time Evolution for Polynomial Unconstrained Binary Optimization","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2604.26692","citing_title":"Towards Quantum Optimised Malware Containment","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2605.10768","citing_title":"Unitaria: Quantum Linear Algebra via Block Encodings","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2604.24742","citing_title":"Application of a Quantum Amplitude Redistribution Algorithm to the Data Filtering Problem","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2604.23451","citing_title":"Quantum Causal Discovery via Amplitude Estimation of Kullback-Leibler Divergence","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2604.22996","citing_title":"Accelerating quantum Gibbs sampling without quantum walks","ref_index":40,"is_internal_anchor":true},{"citing_arxiv_id":"2604.18754","citing_title":"Quantum embedding of graphs for subgraph counting","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2604.14275","citing_title":"Generalized Complexity Distances and Non-Invertible Symmetries","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2604.07639","citing_title":"Exponential quantum advantage in processing massive classical data","ref_index":182,"is_internal_anchor":true},{"citing_arxiv_id":"2604.05133","citing_title":"Tight Quantum Lower Bound for k-Distinctness","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2604.05776","citing_title":"A Nested Amplitude Amplification Protocol for the Binary Knapsack Problem","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2604.05452","citing_title":"A Digital Spreading Framework for Quantum Expectation Computation Without Rotation Gates or Arithmetic Circuits","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2604.14057","citing_title":"Distributed quantum-classical hybrid algorithm for solving K-SAT problem","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2604.18218","citing_title":"Quantangle-SAT: A Quantum SAT Solver Based on Entanglement and Equivalence Checking","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2605.02565","citing_title":"Sample-Based Quantum Diagonalization with Amplitude Amplification","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YZXB4G6TNDPLNQQSCYGYXDCTAC","json":"https://pith.science/pith/YZXB4G6TNDPLNQQSCYGYXDCTAC.json","graph_json":"https://pith.science/api/pith-number/YZXB4G6TNDPLNQQSCYGYXDCTAC/graph.json","events_json":"https://pith.science/api/pith-number/YZXB4G6TNDPLNQQSCYGYXDCTAC/events.json","paper":"https://pith.science/paper/YZXB4G6T"},"agent_actions":{"view_html":"https://pith.science/pith/YZXB4G6TNDPLNQQSCYGYXDCTAC","download_json":"https://pith.science/pith/YZXB4G6TNDPLNQQSCYGYXDCTAC.json","view_paper":"https://pith.science/paper/YZXB4G6T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0005055&json=true","fetch_graph":"https://pith.science/api/pith-number/YZXB4G6TNDPLNQQSCYGYXDCTAC/graph.json","fetch_events":"https://pith.science/api/pith-number/YZXB4G6TNDPLNQQSCYGYXDCTAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZXB4G6TNDPLNQQSCYGYXDCTAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZXB4G6TNDPLNQQSCYGYXDCTAC/action/storage_attestation","attest_author":"https://pith.science/pith/YZXB4G6TNDPLNQQSCYGYXDCTAC/action/author_attestation","sign_citation":"https://pith.science/pith/YZXB4G6TNDPLNQQSCYGYXDCTAC/action/citation_signature","submit_replication":"https://pith.science/pith/YZXB4G6TNDPLNQQSCYGYXDCTAC/action/replication_record"}},"created_at":"2026-05-17T23:38:49.186432+00:00","updated_at":"2026-05-17T23:38:49.186432+00:00"}