{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5TO6XHDZLUJARFOGJER7USF7UU","short_pith_number":"pith:5TO6XHDZ","schema_version":"1.0","canonical_sha256":"ecddeb9c795d120895c64923fa48bfa51d54f8c97041c21e562031fe3875489d","source":{"kind":"arxiv","id":"2505.08226","version":1},"attestation_state":"computed","paper":{"title":"Bang-bang preparation of a quantum many-body ground state in a finite lattice: optimization of the algorithm with a tensor network","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.quant-gas"],"primary_cat":"quant-ph","authors_text":"Ihor Sokolov, Jacek Dziarmaga","submitted_at":"2025-05-13T05:01:49Z","abstract_excerpt":"A bang-bang (BB) algorithm prepares the ground state of a lattice quantum many-body Hamiltonian $H=H_1+H_2$ by evolving an initial product state alternating between $H_1$ and $H_2$. We optimize the algorithm with tensor networks in one and two dimensions. The optimization has two stages. In stage one, a shallow translationally-invariant circuit is optimized in an infinite lattice. In stage two, the infinite-lattice gate sequence is used as a starting point for a finite lattice where it remains optimal in the bulk. The prepared state requires optimization only at its boundary, within a healing "},"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":"2505.08226","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-05-13T05:01:49Z","cross_cats_sorted":["cond-mat.quant-gas"],"title_canon_sha256":"75ed69c1379f7af345ae72e90bc1952f49bed9d49f538cd6ca1046550b6f778c","abstract_canon_sha256":"b2ede310619eb833d1cff88ceadf2b983fb60e2f5409f8d970c03791c537740f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:08.237923Z","signature_b64":"+mJD66+jNQK2HMbcROcgmMyHhyFMTAY6J0Wdv6YV+xKqi0G4jOrboHwr/jveoMwef4tA1IIh9hhf49DL1VFKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecddeb9c795d120895c64923fa48bfa51d54f8c97041c21e562031fe3875489d","last_reissued_at":"2026-07-05T11:34:08.237485Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:08.237485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bang-bang preparation of a quantum many-body ground state in a finite lattice: optimization of the algorithm with a tensor network","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.quant-gas"],"primary_cat":"quant-ph","authors_text":"Ihor Sokolov, Jacek Dziarmaga","submitted_at":"2025-05-13T05:01:49Z","abstract_excerpt":"A bang-bang (BB) algorithm prepares the ground state of a lattice quantum many-body Hamiltonian $H=H_1+H_2$ by evolving an initial product state alternating between $H_1$ and $H_2$. We optimize the algorithm with tensor networks in one and two dimensions. The optimization has two stages. In stage one, a shallow translationally-invariant circuit is optimized in an infinite lattice. In stage two, the infinite-lattice gate sequence is used as a starting point for a finite lattice where it remains optimal in the bulk. The prepared state requires optimization only at its boundary, within a healing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.08226","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/2505.08226/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":"2505.08226","created_at":"2026-07-05T11:34:08.237541+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.08226v1","created_at":"2026-07-05T11:34:08.237541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.08226","created_at":"2026-07-05T11:34:08.237541+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TO6XHDZLUJA","created_at":"2026-07-05T11:34:08.237541+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TO6XHDZLUJARFOG","created_at":"2026-07-05T11:34:08.237541+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TO6XHDZ","created_at":"2026-07-05T11:34:08.237541+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.02105","citing_title":"Learning Circuits with Infinite Tensor Networks","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5TO6XHDZLUJARFOGJER7USF7UU","json":"https://pith.science/pith/5TO6XHDZLUJARFOGJER7USF7UU.json","graph_json":"https://pith.science/api/pith-number/5TO6XHDZLUJARFOGJER7USF7UU/graph.json","events_json":"https://pith.science/api/pith-number/5TO6XHDZLUJARFOGJER7USF7UU/events.json","paper":"https://pith.science/paper/5TO6XHDZ"},"agent_actions":{"view_html":"https://pith.science/pith/5TO6XHDZLUJARFOGJER7USF7UU","download_json":"https://pith.science/pith/5TO6XHDZLUJARFOGJER7USF7UU.json","view_paper":"https://pith.science/paper/5TO6XHDZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.08226&json=true","fetch_graph":"https://pith.science/api/pith-number/5TO6XHDZLUJARFOGJER7USF7UU/graph.json","fetch_events":"https://pith.science/api/pith-number/5TO6XHDZLUJARFOGJER7USF7UU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TO6XHDZLUJARFOGJER7USF7UU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TO6XHDZLUJARFOGJER7USF7UU/action/storage_attestation","attest_author":"https://pith.science/pith/5TO6XHDZLUJARFOGJER7USF7UU/action/author_attestation","sign_citation":"https://pith.science/pith/5TO6XHDZLUJARFOGJER7USF7UU/action/citation_signature","submit_replication":"https://pith.science/pith/5TO6XHDZLUJARFOGJER7USF7UU/action/replication_record"}},"created_at":"2026-07-05T11:34:08.237541+00:00","updated_at":"2026-07-05T11:34:08.237541+00:00"}