{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OL5QRYBEUJUR4ZUFXJG3WNIAJ3","short_pith_number":"pith:OL5QRYBE","schema_version":"1.0","canonical_sha256":"72fb08e024a2691e6685ba4dbb35004edb226f96d962ed7459f6d8e5835dde49","source":{"kind":"arxiv","id":"1910.10746","version":2},"attestation_state":"computed","paper":{"title":"Optimal fermion-to-qubit mapping via ternary trees with applications to reduced quantum states learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Amir Kalev, Hartmut Neven, Wojciech Mruczkiewicz, Zhang Jiang","submitted_at":"2019-10-23T18:06:34Z","abstract_excerpt":"We introduce a fermion-to-qubit mapping defined on ternary trees, where any single Majorana operator on an $n$-mode fermionic system is mapped to a multi-qubit Pauli operator acting nontrivially on $\\lceil \\log_3(2n+1)\\rceil$ qubits. The mapping has a simple structure and is optimal in the sense that it is impossible to construct Pauli operators in any fermion-to-qubit mapping acting nontrivially on less than $\\log_3(2n)$ qubits on average. We apply it to the problem of learning $k$-fermion reduced density matrix (RDM), a problem relevant in various quantum simulation applications. We show tha"},"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":"1910.10746","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2019-10-23T18:06:34Z","cross_cats_sorted":[],"title_canon_sha256":"318b7ca45ca14fd40c98e124c111fc77cc1ff1ae1f3e5246530e96deb3c8fb2a","abstract_canon_sha256":"38aa45410f3cfda39e0bced785af6b33d1cfe75eadd7b0f8119eda1300734623"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:15:07.606535Z","signature_b64":"vNx+uKysOnSYB3l4XZFB9VOqCCW0vNiu11EY55MhUJORnIDpAfJJZOwxMWQOe7MloDeUjb4Rk9tP5WEx4LM2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72fb08e024a2691e6685ba4dbb35004edb226f96d962ed7459f6d8e5835dde49","last_reissued_at":"2026-07-05T01:15:07.606093Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:15:07.606093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal fermion-to-qubit mapping via ternary trees with applications to reduced quantum states learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Amir Kalev, Hartmut Neven, Wojciech Mruczkiewicz, Zhang Jiang","submitted_at":"2019-10-23T18:06:34Z","abstract_excerpt":"We introduce a fermion-to-qubit mapping defined on ternary trees, where any single Majorana operator on an $n$-mode fermionic system is mapped to a multi-qubit Pauli operator acting nontrivially on $\\lceil \\log_3(2n+1)\\rceil$ qubits. The mapping has a simple structure and is optimal in the sense that it is impossible to construct Pauli operators in any fermion-to-qubit mapping acting nontrivially on less than $\\log_3(2n)$ qubits on average. We apply it to the problem of learning $k$-fermion reduced density matrix (RDM), a problem relevant in various quantum simulation applications. We show tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.10746","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/1910.10746/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":"1910.10746","created_at":"2026-07-05T01:15:07.606148+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.10746v2","created_at":"2026-07-05T01:15:07.606148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.10746","created_at":"2026-07-05T01:15:07.606148+00:00"},{"alias_kind":"pith_short_12","alias_value":"OL5QRYBEUJUR","created_at":"2026-07-05T01:15:07.606148+00:00"},{"alias_kind":"pith_short_16","alias_value":"OL5QRYBEUJUR4ZUF","created_at":"2026-07-05T01:15:07.606148+00:00"},{"alias_kind":"pith_short_8","alias_value":"OL5QRYBE","created_at":"2026-07-05T01:15:07.606148+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25870","citing_title":"Evolving Quantum Error-Correcting Encodings for Molecular Simulation","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20805","citing_title":"Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2201.07254","citing_title":"Free-Fermion Subsystem Codes","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OL5QRYBEUJUR4ZUFXJG3WNIAJ3","json":"https://pith.science/pith/OL5QRYBEUJUR4ZUFXJG3WNIAJ3.json","graph_json":"https://pith.science/api/pith-number/OL5QRYBEUJUR4ZUFXJG3WNIAJ3/graph.json","events_json":"https://pith.science/api/pith-number/OL5QRYBEUJUR4ZUFXJG3WNIAJ3/events.json","paper":"https://pith.science/paper/OL5QRYBE"},"agent_actions":{"view_html":"https://pith.science/pith/OL5QRYBEUJUR4ZUFXJG3WNIAJ3","download_json":"https://pith.science/pith/OL5QRYBEUJUR4ZUFXJG3WNIAJ3.json","view_paper":"https://pith.science/paper/OL5QRYBE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.10746&json=true","fetch_graph":"https://pith.science/api/pith-number/OL5QRYBEUJUR4ZUFXJG3WNIAJ3/graph.json","fetch_events":"https://pith.science/api/pith-number/OL5QRYBEUJUR4ZUFXJG3WNIAJ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OL5QRYBEUJUR4ZUFXJG3WNIAJ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OL5QRYBEUJUR4ZUFXJG3WNIAJ3/action/storage_attestation","attest_author":"https://pith.science/pith/OL5QRYBEUJUR4ZUFXJG3WNIAJ3/action/author_attestation","sign_citation":"https://pith.science/pith/OL5QRYBEUJUR4ZUFXJG3WNIAJ3/action/citation_signature","submit_replication":"https://pith.science/pith/OL5QRYBEUJUR4ZUFXJG3WNIAJ3/action/replication_record"}},"created_at":"2026-07-05T01:15:07.606148+00:00","updated_at":"2026-07-05T01:15:07.606148+00:00"}