{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4S4NIAOROZTRKAOZHQXVJ7GGFZ","short_pith_number":"pith:4S4NIAOR","schema_version":"1.0","canonical_sha256":"e4b8d401d176671501d93c2f54fcc62e6d65350be32fa21ba9366bc636089e22","source":{"kind":"arxiv","id":"1409.3305","version":2},"attestation_state":"computed","paper":{"title":"Fixed-point quantum search with an optimal number of queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guang Hao Low, Isaac L. Chuang, Theodore J. Yoder","submitted_at":"2014-09-11T03:09:21Z","abstract_excerpt":"Grover's quantum search and its generalization, quantum amplitude amplification, provide quadratic advantage over classical algorithms for a diverse set of tasks, but are tricky to use without knowing beforehand what fraction $\\lambda$ of the initial state is comprised of the target states. In contrast, fixed-point search algorithms need only a reliable lower bound on this fraction, but, as a consequence, lose the very quadratic advantage that makes Grover's algorithm so appealing. Here we provide the first version of amplitude amplification that achieves fixed-point behavior without sacrifici"},"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":"1409.3305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-09-11T03:09:21Z","cross_cats_sorted":[],"title_canon_sha256":"d55d86b170301030eda37a2ff08f16173a96b4cb9041aa11c483102bf9fd6dfe","abstract_canon_sha256":"b4be724c0d4af942efae7a33d4260bca77d73c83e6d3798ad139b67833338c34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:53.149606Z","signature_b64":"K72OFeLLRynycA7eiG2Q1TefSbvCVWSrj19zRFhCxQgMQF3gCsl88YYlzeyZ0m76Kr5ngJJJEsqj8aOVFphiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4b8d401d176671501d93c2f54fcc62e6d65350be32fa21ba9366bc636089e22","last_reissued_at":"2026-05-18T02:32:53.149041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:53.149041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed-point quantum search with an optimal number of queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guang Hao Low, Isaac L. Chuang, Theodore J. Yoder","submitted_at":"2014-09-11T03:09:21Z","abstract_excerpt":"Grover's quantum search and its generalization, quantum amplitude amplification, provide quadratic advantage over classical algorithms for a diverse set of tasks, but are tricky to use without knowing beforehand what fraction $\\lambda$ of the initial state is comprised of the target states. In contrast, fixed-point search algorithms need only a reliable lower bound on this fraction, but, as a consequence, lose the very quadratic advantage that makes Grover's algorithm so appealing. Here we provide the first version of amplitude amplification that achieves fixed-point behavior without sacrifici"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3305","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":"1409.3305","created_at":"2026-05-18T02:32:53.149128+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.3305v2","created_at":"2026-05-18T02:32:53.149128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3305","created_at":"2026-05-18T02:32:53.149128+00:00"},{"alias_kind":"pith_short_12","alias_value":"4S4NIAOROZTR","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4S4NIAOROZTRKAOZ","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4S4NIAOR","created_at":"2026-05-18T12:28:14.216126+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2406.12086","citing_title":"A shortcut to an optimal quantum linear system solver","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27482","citing_title":"Finite Imaginary-Time Evolution for Polynomial Unconstrained Binary Optimization","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4S4NIAOROZTRKAOZHQXVJ7GGFZ","json":"https://pith.science/pith/4S4NIAOROZTRKAOZHQXVJ7GGFZ.json","graph_json":"https://pith.science/api/pith-number/4S4NIAOROZTRKAOZHQXVJ7GGFZ/graph.json","events_json":"https://pith.science/api/pith-number/4S4NIAOROZTRKAOZHQXVJ7GGFZ/events.json","paper":"https://pith.science/paper/4S4NIAOR"},"agent_actions":{"view_html":"https://pith.science/pith/4S4NIAOROZTRKAOZHQXVJ7GGFZ","download_json":"https://pith.science/pith/4S4NIAOROZTRKAOZHQXVJ7GGFZ.json","view_paper":"https://pith.science/paper/4S4NIAOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.3305&json=true","fetch_graph":"https://pith.science/api/pith-number/4S4NIAOROZTRKAOZHQXVJ7GGFZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4S4NIAOROZTRKAOZHQXVJ7GGFZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4S4NIAOROZTRKAOZHQXVJ7GGFZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4S4NIAOROZTRKAOZHQXVJ7GGFZ/action/storage_attestation","attest_author":"https://pith.science/pith/4S4NIAOROZTRKAOZHQXVJ7GGFZ/action/author_attestation","sign_citation":"https://pith.science/pith/4S4NIAOROZTRKAOZHQXVJ7GGFZ/action/citation_signature","submit_replication":"https://pith.science/pith/4S4NIAOROZTRKAOZHQXVJ7GGFZ/action/replication_record"}},"created_at":"2026-05-18T02:32:53.149128+00:00","updated_at":"2026-05-18T02:32:53.149128+00:00"}