{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CWM4EFGMQXHOJNBZHDWOHJTDRJ","short_pith_number":"pith:CWM4EFGM","schema_version":"1.0","canonical_sha256":"1599c214cc85cee4b43938ece3a6638a66f252be68a65201c85a631073e5935d","source":{"kind":"arxiv","id":"2504.15356","version":1},"attestation_state":"computed","paper":{"title":"Efficiently learning fermionic unitaries with few non-Gaussian gates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexey Gorshkov, Mauro E.S. Morales, Sharoon Austin","submitted_at":"2025-04-21T18:02:39Z","abstract_excerpt":"Fermionic Gaussian unitaries are known to be efficiently learnable and simulatable. In this paper, we present a learning algorithm that learns an $n$-mode circuit containing $t$ parity-preserving non-Gaussian gates. While circuits with $t = \\textrm{poly}(n)$ are unlikely to be efficiently learnable, for constant $t$, we present a polynomial-time algorithm for learning the description of the unknown fermionic circuit within a small diamond-distance error. Building on work that studies the state-learning version of this problem, our approach relies on learning approximate Gaussian unitaries that"},"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":"2504.15356","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-21T18:02:39Z","cross_cats_sorted":[],"title_canon_sha256":"9d839758d3078dc60048d8492fdd9c5c05875b1cf90d3bffedadd820c0e483fe","abstract_canon_sha256":"941fdb2fe7693cb597ba15a50777c49869d9c23f5729771112d6904fed328a9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:01.346923Z","signature_b64":"Q9kt+cDpWoyynC0hP9WfTyCXOmgNkGj976rHAMLXUYpDEbswrovrYG24lj5VZkj7+ZPFYQnZwJ2MjaBZ8XklDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1599c214cc85cee4b43938ece3a6638a66f252be68a65201c85a631073e5935d","last_reissued_at":"2026-07-05T10:52:01.346429Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:01.346429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiently learning fermionic unitaries with few non-Gaussian gates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexey Gorshkov, Mauro E.S. Morales, Sharoon Austin","submitted_at":"2025-04-21T18:02:39Z","abstract_excerpt":"Fermionic Gaussian unitaries are known to be efficiently learnable and simulatable. In this paper, we present a learning algorithm that learns an $n$-mode circuit containing $t$ parity-preserving non-Gaussian gates. While circuits with $t = \\textrm{poly}(n)$ are unlikely to be efficiently learnable, for constant $t$, we present a polynomial-time algorithm for learning the description of the unknown fermionic circuit within a small diamond-distance error. Building on work that studies the state-learning version of this problem, our approach relies on learning approximate Gaussian unitaries that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15356","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/2504.15356/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":"2504.15356","created_at":"2026-07-05T10:52:01.346487+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.15356v1","created_at":"2026-07-05T10:52:01.346487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15356","created_at":"2026-07-05T10:52:01.346487+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWM4EFGMQXHO","created_at":"2026-07-05T10:52:01.346487+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWM4EFGMQXHOJNBZ","created_at":"2026-07-05T10:52:01.346487+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWM4EFGM","created_at":"2026-07-05T10:52:01.346487+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CWM4EFGMQXHOJNBZHDWOHJTDRJ","json":"https://pith.science/pith/CWM4EFGMQXHOJNBZHDWOHJTDRJ.json","graph_json":"https://pith.science/api/pith-number/CWM4EFGMQXHOJNBZHDWOHJTDRJ/graph.json","events_json":"https://pith.science/api/pith-number/CWM4EFGMQXHOJNBZHDWOHJTDRJ/events.json","paper":"https://pith.science/paper/CWM4EFGM"},"agent_actions":{"view_html":"https://pith.science/pith/CWM4EFGMQXHOJNBZHDWOHJTDRJ","download_json":"https://pith.science/pith/CWM4EFGMQXHOJNBZHDWOHJTDRJ.json","view_paper":"https://pith.science/paper/CWM4EFGM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.15356&json=true","fetch_graph":"https://pith.science/api/pith-number/CWM4EFGMQXHOJNBZHDWOHJTDRJ/graph.json","fetch_events":"https://pith.science/api/pith-number/CWM4EFGMQXHOJNBZHDWOHJTDRJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWM4EFGMQXHOJNBZHDWOHJTDRJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWM4EFGMQXHOJNBZHDWOHJTDRJ/action/storage_attestation","attest_author":"https://pith.science/pith/CWM4EFGMQXHOJNBZHDWOHJTDRJ/action/author_attestation","sign_citation":"https://pith.science/pith/CWM4EFGMQXHOJNBZHDWOHJTDRJ/action/citation_signature","submit_replication":"https://pith.science/pith/CWM4EFGMQXHOJNBZHDWOHJTDRJ/action/replication_record"}},"created_at":"2026-07-05T10:52:01.346487+00:00","updated_at":"2026-07-05T10:52:01.346487+00:00"}