{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AIIQQLDCDVECQ7PZ2BXAICT7QQ","short_pith_number":"pith:AIIQQLDC","schema_version":"1.0","canonical_sha256":"0211082c621d48287df9d06e040a7f842ff5e33260703b764db0f33d0a4c8731","source":{"kind":"arxiv","id":"1609.03603","version":2},"attestation_state":"computed","paper":{"title":"Fixed-Point Adiabatic Quantum Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander M. Dalzell, Isaac L. Chuang, Theodore J. Yoder","submitted_at":"2016-09-12T21:03:29Z","abstract_excerpt":"Fixed-point quantum search algorithms succeed at finding one of $M$ target items among $N$ total items even when the run time of the algorithm is longer than necessary. While the famous Grover's algorithm can search quadratically faster than a classical computer, it lacks the fixed-point property --- the fraction of target items must be known precisely to know when to terminate the algorithm. Recently, Yoder, Low, and Chuang gave an optimal gate-model search algorithm with the fixed-point property. Meanwhile, it is known that an adiabatic quantum algorithm, operating by continuously varying a "},"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":"1609.03603","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-12T21:03:29Z","cross_cats_sorted":[],"title_canon_sha256":"40ef48bb72cc823d0b1edf3b5cb267200a522cde0de0096d1483ab230408147d","abstract_canon_sha256":"6c8e2bda1262f45508d7e86cf483b537520083a26574d1c03382dd9d55b600f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:25.334174Z","signature_b64":"MTjrrfYABTRtKRjW0NaX3WgAEtspK0+/vR2g6PHhDEjdcVLlgoJb9OtKb78h80sIMyyf94PJeYqE81g+w/dfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0211082c621d48287df9d06e040a7f842ff5e33260703b764db0f33d0a4c8731","last_reissued_at":"2026-05-18T00:51:25.333678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:25.333678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed-Point Adiabatic Quantum Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander M. Dalzell, Isaac L. Chuang, Theodore J. Yoder","submitted_at":"2016-09-12T21:03:29Z","abstract_excerpt":"Fixed-point quantum search algorithms succeed at finding one of $M$ target items among $N$ total items even when the run time of the algorithm is longer than necessary. While the famous Grover's algorithm can search quadratically faster than a classical computer, it lacks the fixed-point property --- the fraction of target items must be known precisely to know when to terminate the algorithm. Recently, Yoder, Low, and Chuang gave an optimal gate-model search algorithm with the fixed-point property. Meanwhile, it is known that an adiabatic quantum algorithm, operating by continuously varying a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03603","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":"1609.03603","created_at":"2026-05-18T00:51:25.333753+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.03603v2","created_at":"2026-05-18T00:51:25.333753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03603","created_at":"2026-05-18T00:51:25.333753+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIIQQLDCDVEC","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIIQQLDCDVECQ7PZ","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIIQQLDC","created_at":"2026-05-18T12:30:07.202191+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/AIIQQLDCDVECQ7PZ2BXAICT7QQ","json":"https://pith.science/pith/AIIQQLDCDVECQ7PZ2BXAICT7QQ.json","graph_json":"https://pith.science/api/pith-number/AIIQQLDCDVECQ7PZ2BXAICT7QQ/graph.json","events_json":"https://pith.science/api/pith-number/AIIQQLDCDVECQ7PZ2BXAICT7QQ/events.json","paper":"https://pith.science/paper/AIIQQLDC"},"agent_actions":{"view_html":"https://pith.science/pith/AIIQQLDCDVECQ7PZ2BXAICT7QQ","download_json":"https://pith.science/pith/AIIQQLDCDVECQ7PZ2BXAICT7QQ.json","view_paper":"https://pith.science/paper/AIIQQLDC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.03603&json=true","fetch_graph":"https://pith.science/api/pith-number/AIIQQLDCDVECQ7PZ2BXAICT7QQ/graph.json","fetch_events":"https://pith.science/api/pith-number/AIIQQLDCDVECQ7PZ2BXAICT7QQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIIQQLDCDVECQ7PZ2BXAICT7QQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIIQQLDCDVECQ7PZ2BXAICT7QQ/action/storage_attestation","attest_author":"https://pith.science/pith/AIIQQLDCDVECQ7PZ2BXAICT7QQ/action/author_attestation","sign_citation":"https://pith.science/pith/AIIQQLDCDVECQ7PZ2BXAICT7QQ/action/citation_signature","submit_replication":"https://pith.science/pith/AIIQQLDCDVECQ7PZ2BXAICT7QQ/action/replication_record"}},"created_at":"2026-05-18T00:51:25.333753+00:00","updated_at":"2026-05-18T00:51:25.333753+00:00"}