{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JSK2BZGGWLU2HH3SXKPWN7ETOV","short_pith_number":"pith:JSK2BZGG","schema_version":"1.0","canonical_sha256":"4c95a0e4c6b2e9a39f72ba9f66fc9375666a0634d44907d5cb45ac516f968390","source":{"kind":"arxiv","id":"2210.15687","version":3},"attestation_state":"computed","paper":{"title":"Lower Bounds on Quantum Annealing Times","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jacob Bringewatt, Lucas T. Brady, Luis Pedro Garc\\'ia-Pintos, Yi-Kai Liu","submitted_at":"2022-10-27T18:00:04Z","abstract_excerpt":"The adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more general quantum annealing protocols, rigorous results beyond the adiabatic regime are rare. Here, we provide such a result, deriving lower bounds on the time needed to successfully perform quantum annealing. The bounds are asymptotically saturated by three toy models where fast annealing schedules are known: the Roland and Cerf unstructured search model, the Hamming spike problem, and the ferromagnetic p-spin model. Our "},"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":"2210.15687","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2022-10-27T18:00:04Z","cross_cats_sorted":[],"title_canon_sha256":"a0b992b5bda222fbb59b3ae2533055c1efe0ab8275fd78e8546a3c08b3fc444c","abstract_canon_sha256":"fb08537609ab618758eb0ddcc729439322cbd59fa214332f75bdbe56b5978aa7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:16:34.628340Z","signature_b64":"XZEmKDZMAEc4J26bvLhODv7HR9Ef8oe0LJm7roPgnoOQP3W5n8q6q6lAK6KGvkIPvon4kAdil1BFBC0L4RKyDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c95a0e4c6b2e9a39f72ba9f66fc9375666a0634d44907d5cb45ac516f968390","last_reissued_at":"2026-07-05T07:16:34.627827Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:16:34.627827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds on Quantum Annealing Times","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jacob Bringewatt, Lucas T. Brady, Luis Pedro Garc\\'ia-Pintos, Yi-Kai Liu","submitted_at":"2022-10-27T18:00:04Z","abstract_excerpt":"The adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more general quantum annealing protocols, rigorous results beyond the adiabatic regime are rare. Here, we provide such a result, deriving lower bounds on the time needed to successfully perform quantum annealing. The bounds are asymptotically saturated by three toy models where fast annealing schedules are known: the Roland and Cerf unstructured search model, the Hamming spike problem, and the ferromagnetic p-spin model. Our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.15687","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.15687/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2210.15687","created_at":"2026-07-05T07:16:34.627899+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.15687v3","created_at":"2026-07-05T07:16:34.627899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.15687","created_at":"2026-07-05T07:16:34.627899+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSK2BZGGWLU2","created_at":"2026-07-05T07:16:34.627899+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSK2BZGGWLU2HH3S","created_at":"2026-07-05T07:16:34.627899+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSK2BZGG","created_at":"2026-07-05T07:16:34.627899+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/JSK2BZGGWLU2HH3SXKPWN7ETOV","json":"https://pith.science/pith/JSK2BZGGWLU2HH3SXKPWN7ETOV.json","graph_json":"https://pith.science/api/pith-number/JSK2BZGGWLU2HH3SXKPWN7ETOV/graph.json","events_json":"https://pith.science/api/pith-number/JSK2BZGGWLU2HH3SXKPWN7ETOV/events.json","paper":"https://pith.science/paper/JSK2BZGG"},"agent_actions":{"view_html":"https://pith.science/pith/JSK2BZGGWLU2HH3SXKPWN7ETOV","download_json":"https://pith.science/pith/JSK2BZGGWLU2HH3SXKPWN7ETOV.json","view_paper":"https://pith.science/paper/JSK2BZGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.15687&json=true","fetch_graph":"https://pith.science/api/pith-number/JSK2BZGGWLU2HH3SXKPWN7ETOV/graph.json","fetch_events":"https://pith.science/api/pith-number/JSK2BZGGWLU2HH3SXKPWN7ETOV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSK2BZGGWLU2HH3SXKPWN7ETOV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSK2BZGGWLU2HH3SXKPWN7ETOV/action/storage_attestation","attest_author":"https://pith.science/pith/JSK2BZGGWLU2HH3SXKPWN7ETOV/action/author_attestation","sign_citation":"https://pith.science/pith/JSK2BZGGWLU2HH3SXKPWN7ETOV/action/citation_signature","submit_replication":"https://pith.science/pith/JSK2BZGGWLU2HH3SXKPWN7ETOV/action/replication_record"}},"created_at":"2026-07-05T07:16:34.627899+00:00","updated_at":"2026-07-05T07:16:34.627899+00:00"}