{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SPWLWYDXCWXECEBD2RRBQFYMEB","short_pith_number":"pith:SPWLWYDX","schema_version":"1.0","canonical_sha256":"93ecbb607715ae411023d46218170c207985d2e131f7b170e5ba2b5085d43984","source":{"kind":"arxiv","id":"2205.03445","version":2},"attestation_state":"computed","paper":{"title":"Optimal compression of quantum many-body time evolution operators into brickwall circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cond-mat.str-el","authors_text":"David J. Luitz, Dominik Hahn, Maurits S. J. Tepaske","submitted_at":"2022-05-06T18:38:51Z","abstract_excerpt":"Near term quantum computers suffer from a degree of decoherence which is prohibitive for high fidelity simulations with deep circuits. An economical use of circuit depth is therefore paramount. For digital quantum simulation of quantum many-body systems, real time evolution is typically achieved by a Trotter decomposition of the time evolution operator into circuits consisting only of two qubit gates. To match the geometry of the physical system and the CNOT connectivity of the quantum processor, additional SWAP gates are needed. We show that optimal fidelity, beyond what is achievable by simp"},"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":"2205.03445","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2022-05-06T18:38:51Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"ae2a595213a06a39a0d4eb9bce154fb2645ab69c815d3953ac28c62efcadd075","abstract_canon_sha256":"54b0cd197c4ddc82f41b1824dd767644c4fc3d682c37a872a545c920b5465879"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:20:20.753294Z","signature_b64":"2MvmK8kOKriuGJ9+MCiD95zOoEwhnl94hLDfOfr8jafVgeXk3sfxrHrYwtKHhv/BBwzRDzVUA4JpRl4X8OTvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93ecbb607715ae411023d46218170c207985d2e131f7b170e5ba2b5085d43984","last_reissued_at":"2026-07-05T08:20:20.752830Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:20:20.752830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal compression of quantum many-body time evolution operators into brickwall circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cond-mat.str-el","authors_text":"David J. Luitz, Dominik Hahn, Maurits S. J. Tepaske","submitted_at":"2022-05-06T18:38:51Z","abstract_excerpt":"Near term quantum computers suffer from a degree of decoherence which is prohibitive for high fidelity simulations with deep circuits. An economical use of circuit depth is therefore paramount. For digital quantum simulation of quantum many-body systems, real time evolution is typically achieved by a Trotter decomposition of the time evolution operator into circuits consisting only of two qubit gates. To match the geometry of the physical system and the CNOT connectivity of the quantum processor, additional SWAP gates are needed. We show that optimal fidelity, beyond what is achievable by simp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.03445","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.03445/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":"2205.03445","created_at":"2026-07-05T08:20:20.752888+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.03445v2","created_at":"2026-07-05T08:20:20.752888+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.03445","created_at":"2026-07-05T08:20:20.752888+00:00"},{"alias_kind":"pith_short_12","alias_value":"SPWLWYDXCWXE","created_at":"2026-07-05T08:20:20.752888+00:00"},{"alias_kind":"pith_short_16","alias_value":"SPWLWYDXCWXECEBD","created_at":"2026-07-05T08:20:20.752888+00:00"},{"alias_kind":"pith_short_8","alias_value":"SPWLWYDX","created_at":"2026-07-05T08:20:20.752888+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.23775","citing_title":"High-Performance Contraction of Quantum Circuits for Riemannian Optimization","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SPWLWYDXCWXECEBD2RRBQFYMEB","json":"https://pith.science/pith/SPWLWYDXCWXECEBD2RRBQFYMEB.json","graph_json":"https://pith.science/api/pith-number/SPWLWYDXCWXECEBD2RRBQFYMEB/graph.json","events_json":"https://pith.science/api/pith-number/SPWLWYDXCWXECEBD2RRBQFYMEB/events.json","paper":"https://pith.science/paper/SPWLWYDX"},"agent_actions":{"view_html":"https://pith.science/pith/SPWLWYDXCWXECEBD2RRBQFYMEB","download_json":"https://pith.science/pith/SPWLWYDXCWXECEBD2RRBQFYMEB.json","view_paper":"https://pith.science/paper/SPWLWYDX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.03445&json=true","fetch_graph":"https://pith.science/api/pith-number/SPWLWYDXCWXECEBD2RRBQFYMEB/graph.json","fetch_events":"https://pith.science/api/pith-number/SPWLWYDXCWXECEBD2RRBQFYMEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SPWLWYDXCWXECEBD2RRBQFYMEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SPWLWYDXCWXECEBD2RRBQFYMEB/action/storage_attestation","attest_author":"https://pith.science/pith/SPWLWYDXCWXECEBD2RRBQFYMEB/action/author_attestation","sign_citation":"https://pith.science/pith/SPWLWYDXCWXECEBD2RRBQFYMEB/action/citation_signature","submit_replication":"https://pith.science/pith/SPWLWYDXCWXECEBD2RRBQFYMEB/action/replication_record"}},"created_at":"2026-07-05T08:20:20.752888+00:00","updated_at":"2026-07-05T08:20:20.752888+00:00"}