{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ML4IK2AKBAPNQWF4WWONZYY43G","short_pith_number":"pith:ML4IK2AK","schema_version":"1.0","canonical_sha256":"62f885680a081ed858bcb59cdce31cd985d7df0a0a1a0474ec362c5f5d4a896d","source":{"kind":"arxiv","id":"1810.04686","version":2},"attestation_state":"computed","paper":{"title":"Quantum adiabatic optimization without heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Aike Liu, Brad Lackey, Kianna Wan, Michael Jarret","submitted_at":"2018-10-10T18:01:02Z","abstract_excerpt":"Quantum adiabatic optimization (QAO) is performed using a time-dependent Hamiltonian $H(s)$ with spectral gap $\\gamma(s)$. Assuming the existence of an oracle $\\Gamma$ such that $\\gamma_\\min = \\Theta\\left(\\min_s\\Gamma(s)\\right)$, we provide an algorithm that reliably performs QAO in time $O\\left(\\gamma_\\min^{-1}\\right)$ with $O\\left(\\log(\\gamma_\\min^{-1})\\right)$ oracle queries, where $\\gamma_\\min = \\min_s \\gamma(s)$. Our strategy is not heuristic and does not require guessing time parameters or annealing paths. Rather, our algorithm naturally produces an annealing path such that $\\|dH/ds\\| \\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":"1810.04686","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-10T18:01:02Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9e8b9f10db70468f3c6534dfca52f574b5aa5512172bf820aeb99d4b1c60d576","abstract_canon_sha256":"b58b00d2401d8745d976b0e058152ce85973bbc3a10d06677d6fb81d8cebb9e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:17.024110Z","signature_b64":"MzVkXZtlG65hhmWScuWW3NexbzDijizicmPwF+xXI4HYRp4lF7QRk76m1SLMTLfjDVWp2oFKkLU/uwybg45XDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62f885680a081ed858bcb59cdce31cd985d7df0a0a1a0474ec362c5f5d4a896d","last_reissued_at":"2026-05-17T23:48:17.023562Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:17.023562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum adiabatic optimization without heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Aike Liu, Brad Lackey, Kianna Wan, Michael Jarret","submitted_at":"2018-10-10T18:01:02Z","abstract_excerpt":"Quantum adiabatic optimization (QAO) is performed using a time-dependent Hamiltonian $H(s)$ with spectral gap $\\gamma(s)$. Assuming the existence of an oracle $\\Gamma$ such that $\\gamma_\\min = \\Theta\\left(\\min_s\\Gamma(s)\\right)$, we provide an algorithm that reliably performs QAO in time $O\\left(\\gamma_\\min^{-1}\\right)$ with $O\\left(\\log(\\gamma_\\min^{-1})\\right)$ oracle queries, where $\\gamma_\\min = \\min_s \\gamma(s)$. Our strategy is not heuristic and does not require guessing time parameters or annealing paths. Rather, our algorithm naturally produces an annealing path such that $\\|dH/ds\\| \\a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04686","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":"1810.04686","created_at":"2026-05-17T23:48:17.023651+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.04686v2","created_at":"2026-05-17T23:48:17.023651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04686","created_at":"2026-05-17T23:48:17.023651+00:00"},{"alias_kind":"pith_short_12","alias_value":"ML4IK2AKBAPN","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"ML4IK2AKBAPNQWF4","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"ML4IK2AK","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2510.01923","citing_title":"The Constant Geometric Speed Schedule for Adiabatic State Preparation","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ML4IK2AKBAPNQWF4WWONZYY43G","json":"https://pith.science/pith/ML4IK2AKBAPNQWF4WWONZYY43G.json","graph_json":"https://pith.science/api/pith-number/ML4IK2AKBAPNQWF4WWONZYY43G/graph.json","events_json":"https://pith.science/api/pith-number/ML4IK2AKBAPNQWF4WWONZYY43G/events.json","paper":"https://pith.science/paper/ML4IK2AK"},"agent_actions":{"view_html":"https://pith.science/pith/ML4IK2AKBAPNQWF4WWONZYY43G","download_json":"https://pith.science/pith/ML4IK2AKBAPNQWF4WWONZYY43G.json","view_paper":"https://pith.science/paper/ML4IK2AK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.04686&json=true","fetch_graph":"https://pith.science/api/pith-number/ML4IK2AKBAPNQWF4WWONZYY43G/graph.json","fetch_events":"https://pith.science/api/pith-number/ML4IK2AKBAPNQWF4WWONZYY43G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ML4IK2AKBAPNQWF4WWONZYY43G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ML4IK2AKBAPNQWF4WWONZYY43G/action/storage_attestation","attest_author":"https://pith.science/pith/ML4IK2AKBAPNQWF4WWONZYY43G/action/author_attestation","sign_citation":"https://pith.science/pith/ML4IK2AKBAPNQWF4WWONZYY43G/action/citation_signature","submit_replication":"https://pith.science/pith/ML4IK2AKBAPNQWF4WWONZYY43G/action/replication_record"}},"created_at":"2026-05-17T23:48:17.023651+00:00","updated_at":"2026-05-17T23:48:17.023651+00:00"}