{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WUDSAEZQQ4SFKRMADY6YVOSUNM","short_pith_number":"pith:WUDSAEZQ","schema_version":"1.0","canonical_sha256":"b50720133087245545801e3d8aba546b358485fad15302e0b734d2d4f4f37b37","source":{"kind":"arxiv","id":"2411.02881","version":1},"attestation_state":"computed","paper":{"title":"Distributed Quantum Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jue Xu, Penghui Yao, Qi Zhao, Tianfeng Feng, Wenjun Yu, Zekun Ye","submitted_at":"2024-11-05T07:48:40Z","abstract_excerpt":"Quantum simulation is a promising pathway toward practical quantum advantage by simulating large-scale quantum systems. In this work, we propose communication-efficient distributed quantum simulation protocols by exploring three quantum simulation algorithms, including the product formula, the truncated Taylor series, and the processing of quantum signals over a quantum network. Our protocols are further shown to be optimal by deriving a lower bound on the quantum communication complexity for distributed quantum simulations with respect to evolution time and the number of distributed quantum p"},"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":"2411.02881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-05T07:48:40Z","cross_cats_sorted":[],"title_canon_sha256":"ca84449f7b91e236b51c8279d8ebdb1771eced566191f3a5e7fe9d95a7e6ca97","abstract_canon_sha256":"a27d0db6caf846ffde073da17b493a317579abfa9c6c74ac0a1c8d28201662a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:31:19.618155Z","signature_b64":"oL0Fltoyr80BOPfThnzFnu3gLR+rd02dkWyxo7DXhDoz++Uw1FlnDG1LkjcFebFJlM8ihqGT9Ko8vSbWnX6cAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b50720133087245545801e3d8aba546b358485fad15302e0b734d2d4f4f37b37","last_reissued_at":"2026-07-05T09:31:19.617494Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:31:19.617494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Quantum Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jue Xu, Penghui Yao, Qi Zhao, Tianfeng Feng, Wenjun Yu, Zekun Ye","submitted_at":"2024-11-05T07:48:40Z","abstract_excerpt":"Quantum simulation is a promising pathway toward practical quantum advantage by simulating large-scale quantum systems. In this work, we propose communication-efficient distributed quantum simulation protocols by exploring three quantum simulation algorithms, including the product formula, the truncated Taylor series, and the processing of quantum signals over a quantum network. Our protocols are further shown to be optimal by deriving a lower bound on the quantum communication complexity for distributed quantum simulations with respect to evolution time and the number of distributed quantum p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.02881","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/2411.02881/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":"2411.02881","created_at":"2026-07-05T09:31:19.617589+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.02881v1","created_at":"2026-07-05T09:31:19.617589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.02881","created_at":"2026-07-05T09:31:19.617589+00:00"},{"alias_kind":"pith_short_12","alias_value":"WUDSAEZQQ4SF","created_at":"2026-07-05T09:31:19.617589+00:00"},{"alias_kind":"pith_short_16","alias_value":"WUDSAEZQQ4SFKRMA","created_at":"2026-07-05T09:31:19.617589+00:00"},{"alias_kind":"pith_short_8","alias_value":"WUDSAEZQ","created_at":"2026-07-05T09:31:19.617589+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.23345","citing_title":"Trotterization, Operator Scrambling, and Entanglement","ref_index":47,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WUDSAEZQQ4SFKRMADY6YVOSUNM","json":"https://pith.science/pith/WUDSAEZQQ4SFKRMADY6YVOSUNM.json","graph_json":"https://pith.science/api/pith-number/WUDSAEZQQ4SFKRMADY6YVOSUNM/graph.json","events_json":"https://pith.science/api/pith-number/WUDSAEZQQ4SFKRMADY6YVOSUNM/events.json","paper":"https://pith.science/paper/WUDSAEZQ"},"agent_actions":{"view_html":"https://pith.science/pith/WUDSAEZQQ4SFKRMADY6YVOSUNM","download_json":"https://pith.science/pith/WUDSAEZQQ4SFKRMADY6YVOSUNM.json","view_paper":"https://pith.science/paper/WUDSAEZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.02881&json=true","fetch_graph":"https://pith.science/api/pith-number/WUDSAEZQQ4SFKRMADY6YVOSUNM/graph.json","fetch_events":"https://pith.science/api/pith-number/WUDSAEZQQ4SFKRMADY6YVOSUNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WUDSAEZQQ4SFKRMADY6YVOSUNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WUDSAEZQQ4SFKRMADY6YVOSUNM/action/storage_attestation","attest_author":"https://pith.science/pith/WUDSAEZQQ4SFKRMADY6YVOSUNM/action/author_attestation","sign_citation":"https://pith.science/pith/WUDSAEZQQ4SFKRMADY6YVOSUNM/action/citation_signature","submit_replication":"https://pith.science/pith/WUDSAEZQQ4SFKRMADY6YVOSUNM/action/replication_record"}},"created_at":"2026-07-05T09:31:19.617589+00:00","updated_at":"2026-07-05T09:31:19.617589+00:00"}