{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:US4ULNX5ZSCWOBB4ULYO2HR3XP","short_pith_number":"pith:US4ULNX5","schema_version":"1.0","canonical_sha256":"a4b945b6fdcc8567043ca2f0ed1e3bbbfd388ac159827db1e2a10e91335a40e6","source":{"kind":"arxiv","id":"2403.03992","version":3},"attestation_state":"computed","paper":{"title":"Treespilation: Architecture- and State-Optimised Fermion-to-Qubit Mappings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aaron Miller, Adam Glos, Zolt\\'an Zimbor\\'as","submitted_at":"2024-03-06T19:05:53Z","abstract_excerpt":"Quantum computers hold great promise for efficiently simulating Fermionic systems, benefiting fields like quantum chemistry and materials science. To achieve this, algorithms typically begin by choosing a Fermion-to-qubit mapping to encode the Fermioinc problem in the qubits of a quantum computer. In this work, we introduce \"treespilation,\" a technique for efficiently mapping Fermionic systems using a large family of favourable tree-based mappings previously introduced by some of the authors. We use this technique to minimise the number of CNOT gates required to simulate chemical groundstates "},"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":"2403.03992","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-03-06T19:05:53Z","cross_cats_sorted":[],"title_canon_sha256":"165f68274fe5a92183a5c0508b5847a1d1daf84239e37456008567bf02af1980","abstract_canon_sha256":"d52a829878d67fc051a88115c8a1416038ca35a741b0f4aef3a35ff9ffc44faa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:49:31.181978Z","signature_b64":"c+47rry+C5SuUftfzX7NhJDVYVnBJufNPpVs7h6iZ6C7QUu4pJlhK9gUh6nhywVSacJi1LstIKbBDwkTkmz/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4b945b6fdcc8567043ca2f0ed1e3bbbfd388ac159827db1e2a10e91335a40e6","last_reissued_at":"2026-07-05T08:49:31.181510Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:49:31.181510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Treespilation: Architecture- and State-Optimised Fermion-to-Qubit Mappings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aaron Miller, Adam Glos, Zolt\\'an Zimbor\\'as","submitted_at":"2024-03-06T19:05:53Z","abstract_excerpt":"Quantum computers hold great promise for efficiently simulating Fermionic systems, benefiting fields like quantum chemistry and materials science. To achieve this, algorithms typically begin by choosing a Fermion-to-qubit mapping to encode the Fermioinc problem in the qubits of a quantum computer. In this work, we introduce \"treespilation,\" a technique for efficiently mapping Fermionic systems using a large family of favourable tree-based mappings previously introduced by some of the authors. We use this technique to minimise the number of CNOT gates required to simulate chemical groundstates "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.03992","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/2403.03992/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":"2403.03992","created_at":"2026-07-05T08:49:31.181567+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.03992v3","created_at":"2026-07-05T08:49:31.181567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.03992","created_at":"2026-07-05T08:49:31.181567+00:00"},{"alias_kind":"pith_short_12","alias_value":"US4ULNX5ZSCW","created_at":"2026-07-05T08:49:31.181567+00:00"},{"alias_kind":"pith_short_16","alias_value":"US4ULNX5ZSCWOBB4","created_at":"2026-07-05T08:49:31.181567+00:00"},{"alias_kind":"pith_short_8","alias_value":"US4ULNX5","created_at":"2026-07-05T08:49:31.181567+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20805","citing_title":"Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2504.03237","citing_title":"Improved Strategies for Fermionic Quantum Simulation with Global Interactions","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2507.23679","citing_title":"Swap Network Augmented Ans\\\"atze on Arbitrary Connectivity","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/US4ULNX5ZSCWOBB4ULYO2HR3XP","json":"https://pith.science/pith/US4ULNX5ZSCWOBB4ULYO2HR3XP.json","graph_json":"https://pith.science/api/pith-number/US4ULNX5ZSCWOBB4ULYO2HR3XP/graph.json","events_json":"https://pith.science/api/pith-number/US4ULNX5ZSCWOBB4ULYO2HR3XP/events.json","paper":"https://pith.science/paper/US4ULNX5"},"agent_actions":{"view_html":"https://pith.science/pith/US4ULNX5ZSCWOBB4ULYO2HR3XP","download_json":"https://pith.science/pith/US4ULNX5ZSCWOBB4ULYO2HR3XP.json","view_paper":"https://pith.science/paper/US4ULNX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.03992&json=true","fetch_graph":"https://pith.science/api/pith-number/US4ULNX5ZSCWOBB4ULYO2HR3XP/graph.json","fetch_events":"https://pith.science/api/pith-number/US4ULNX5ZSCWOBB4ULYO2HR3XP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/US4ULNX5ZSCWOBB4ULYO2HR3XP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/US4ULNX5ZSCWOBB4ULYO2HR3XP/action/storage_attestation","attest_author":"https://pith.science/pith/US4ULNX5ZSCWOBB4ULYO2HR3XP/action/author_attestation","sign_citation":"https://pith.science/pith/US4ULNX5ZSCWOBB4ULYO2HR3XP/action/citation_signature","submit_replication":"https://pith.science/pith/US4ULNX5ZSCWOBB4ULYO2HR3XP/action/replication_record"}},"created_at":"2026-07-05T08:49:31.181567+00:00","updated_at":"2026-07-05T08:49:31.181567+00:00"}