{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MYTTYUVQWCAWOQC2XNHK3OB5PW","short_pith_number":"pith:MYTTYUVQ","schema_version":"1.0","canonical_sha256":"66273c52b0b08167405abb4eadb83d7dba5841fd1fc42976c33eeaabe5e49f0e","source":{"kind":"arxiv","id":"2404.15397","version":1},"attestation_state":"computed","paper":{"title":"The quantum adiabatic algorithm suppresses the proliferation of errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cond-mat.str-el","physics.atom-ph"],"primary_cat":"quant-ph","authors_text":"Adrian Franco Rubio, Benjamin F. Schiffer, J. Ignacio Cirac, Rahul Trivedi","submitted_at":"2024-04-23T18:00:00Z","abstract_excerpt":"The propagation of errors severely compromises the reliability of quantum computations. The quantum adiabatic algorithm is a physically motivated method to prepare ground states of classical and quantum Hamiltonians. Here, we analyze the proliferation of a single error event in the adiabatic algorithm. We give numerical evidence using tensor network methods that the intrinsic properties of adiabatic processes effectively constrain the amplification of errors during the evolution for geometrically local Hamiltonians. Our findings indicate that low energy states could remain attainable even in t"},"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":"2404.15397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-04-23T18:00:00Z","cross_cats_sorted":["cond-mat.stat-mech","cond-mat.str-el","physics.atom-ph"],"title_canon_sha256":"80a4f4e782e453beeb24131f18682f6b129800b55464c5a797f97eb29503d164","abstract_canon_sha256":"e3e069e4ea20994f0501b27d830cf4cb95ce763497bf4dadb68f0d369db234d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:11:27.251913Z","signature_b64":"cqq4WgZrpz+WHMf8zkjzCjro9SXxQ2t5Z93wamCO0yTFcwxV5tbcCf6qkRg5vq9tYiN7UlnCVxiluSDhtusJBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66273c52b0b08167405abb4eadb83d7dba5841fd1fc42976c33eeaabe5e49f0e","last_reissued_at":"2026-07-05T08:11:27.251437Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:11:27.251437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The quantum adiabatic algorithm suppresses the proliferation of errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cond-mat.str-el","physics.atom-ph"],"primary_cat":"quant-ph","authors_text":"Adrian Franco Rubio, Benjamin F. Schiffer, J. Ignacio Cirac, Rahul Trivedi","submitted_at":"2024-04-23T18:00:00Z","abstract_excerpt":"The propagation of errors severely compromises the reliability of quantum computations. The quantum adiabatic algorithm is a physically motivated method to prepare ground states of classical and quantum Hamiltonians. Here, we analyze the proliferation of a single error event in the adiabatic algorithm. We give numerical evidence using tensor network methods that the intrinsic properties of adiabatic processes effectively constrain the amplification of errors during the evolution for geometrically local Hamiltonians. Our findings indicate that low energy states could remain attainable even in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.15397","kind":"arxiv","version":1},"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/2404.15397/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":"2404.15397","created_at":"2026-07-05T08:11:27.251499+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.15397v1","created_at":"2026-07-05T08:11:27.251499+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.15397","created_at":"2026-07-05T08:11:27.251499+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYTTYUVQWCAW","created_at":"2026-07-05T08:11:27.251499+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYTTYUVQWCAWOQC2","created_at":"2026-07-05T08:11:27.251499+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYTTYUVQ","created_at":"2026-07-05T08:11:27.251499+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20551","citing_title":"Benchmark of quantum algorithms for ground state preparation in the presence of noise","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2410.10794","citing_title":"Robustness of near-thermal dynamics on digital quantum computers","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2505.21255","citing_title":"Quantum Markov chain Monte Carlo method with programmable quantum simulators","ref_index":73,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01440","citing_title":"Spectral functions on a quantum computer through system-environment interaction","ref_index":114,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MYTTYUVQWCAWOQC2XNHK3OB5PW","json":"https://pith.science/pith/MYTTYUVQWCAWOQC2XNHK3OB5PW.json","graph_json":"https://pith.science/api/pith-number/MYTTYUVQWCAWOQC2XNHK3OB5PW/graph.json","events_json":"https://pith.science/api/pith-number/MYTTYUVQWCAWOQC2XNHK3OB5PW/events.json","paper":"https://pith.science/paper/MYTTYUVQ"},"agent_actions":{"view_html":"https://pith.science/pith/MYTTYUVQWCAWOQC2XNHK3OB5PW","download_json":"https://pith.science/pith/MYTTYUVQWCAWOQC2XNHK3OB5PW.json","view_paper":"https://pith.science/paper/MYTTYUVQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.15397&json=true","fetch_graph":"https://pith.science/api/pith-number/MYTTYUVQWCAWOQC2XNHK3OB5PW/graph.json","fetch_events":"https://pith.science/api/pith-number/MYTTYUVQWCAWOQC2XNHK3OB5PW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYTTYUVQWCAWOQC2XNHK3OB5PW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYTTYUVQWCAWOQC2XNHK3OB5PW/action/storage_attestation","attest_author":"https://pith.science/pith/MYTTYUVQWCAWOQC2XNHK3OB5PW/action/author_attestation","sign_citation":"https://pith.science/pith/MYTTYUVQWCAWOQC2XNHK3OB5PW/action/citation_signature","submit_replication":"https://pith.science/pith/MYTTYUVQWCAWOQC2XNHK3OB5PW/action/replication_record"}},"created_at":"2026-07-05T08:11:27.251499+00:00","updated_at":"2026-07-05T08:11:27.251499+00:00"}