{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CWM4EFGMQXHOJNBZHDWOHJTDRJ","short_pith_number":"pith:CWM4EFGM","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"},"canonical_sha256":"1599c214cc85cee4b43938ece3a6638a66f252be68a65201c85a631073e5935d","source":{"kind":"arxiv","id":"2504.15356","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.15356","created_at":"2026-07-05T10:52:01Z"},{"alias_kind":"arxiv_version","alias_value":"2504.15356v1","created_at":"2026-07-05T10:52:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15356","created_at":"2026-07-05T10:52:01Z"},{"alias_kind":"pith_short_12","alias_value":"CWM4EFGMQXHO","created_at":"2026-07-05T10:52:01Z"},{"alias_kind":"pith_short_16","alias_value":"CWM4EFGMQXHOJNBZ","created_at":"2026-07-05T10:52:01Z"},{"alias_kind":"pith_short_8","alias_value":"CWM4EFGM","created_at":"2026-07-05T10:52:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CWM4EFGMQXHOJNBZHDWOHJTDRJ","target":"record","payload":{"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"},"canonical_sha256":"1599c214cc85cee4b43938ece3a6638a66f252be68a65201c85a631073e5935d","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"},"source_kind":"arxiv","source_id":"2504.15356","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:52:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Edyz2wVyg68b2cSIGou2qPXFTwyiC0qaJT0oEbCsB5oPbBepCmreVzRFue6EEY1SS3/imzk14buWeWU+dZWPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:25:09.458605Z"},"content_sha256":"91b822d7519ebb65256d81d6ef7e660e4020a37611bcd6560672e3f75f4b51b7","schema_version":"1.0","event_id":"sha256:91b822d7519ebb65256d81d6ef7e660e4020a37611bcd6560672e3f75f4b51b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CWM4EFGMQXHOJNBZHDWOHJTDRJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:52:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GKEYl6FZx13K9mj6qRHR9L3pcvgFGlnWfYpGHEuAbJJCqvqumi/KnexIdFi/+mSYNlxi33P3iYSJzCy4074sCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:25:09.459116Z"},"content_sha256":"2ebdf539fdc9695989caba9b65901f9a5df4bb8910f1549c2dbd41fc846511de","schema_version":"1.0","event_id":"sha256:2ebdf539fdc9695989caba9b65901f9a5df4bb8910f1549c2dbd41fc846511de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CWM4EFGMQXHOJNBZHDWOHJTDRJ/bundle.json","state_url":"https://pith.science/pith/CWM4EFGMQXHOJNBZHDWOHJTDRJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CWM4EFGMQXHOJNBZHDWOHJTDRJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-05T13:25:09Z","links":{"resolver":"https://pith.science/pith/CWM4EFGMQXHOJNBZHDWOHJTDRJ","bundle":"https://pith.science/pith/CWM4EFGMQXHOJNBZHDWOHJTDRJ/bundle.json","state":"https://pith.science/pith/CWM4EFGMQXHOJNBZHDWOHJTDRJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CWM4EFGMQXHOJNBZHDWOHJTDRJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CWM4EFGMQXHOJNBZHDWOHJTDRJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"941fdb2fe7693cb597ba15a50777c49869d9c23f5729771112d6904fed328a9c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-21T18:02:39Z","title_canon_sha256":"9d839758d3078dc60048d8492fdd9c5c05875b1cf90d3bffedadd820c0e483fe"},"schema_version":"1.0","source":{"id":"2504.15356","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.15356","created_at":"2026-07-05T10:52:01Z"},{"alias_kind":"arxiv_version","alias_value":"2504.15356v1","created_at":"2026-07-05T10:52:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15356","created_at":"2026-07-05T10:52:01Z"},{"alias_kind":"pith_short_12","alias_value":"CWM4EFGMQXHO","created_at":"2026-07-05T10:52:01Z"},{"alias_kind":"pith_short_16","alias_value":"CWM4EFGMQXHOJNBZ","created_at":"2026-07-05T10:52:01Z"},{"alias_kind":"pith_short_8","alias_value":"CWM4EFGM","created_at":"2026-07-05T10:52:01Z"}],"graph_snapshots":[{"event_id":"sha256:2ebdf539fdc9695989caba9b65901f9a5df4bb8910f1549c2dbd41fc846511de","target":"graph","created_at":"2026-07-05T10:52:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.15356/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alexey Gorshkov, Mauro E.S. Morales, Sharoon Austin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-21T18:02:39Z","title":"Efficiently learning fermionic unitaries with few non-Gaussian gates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15356","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:91b822d7519ebb65256d81d6ef7e660e4020a37611bcd6560672e3f75f4b51b7","target":"record","created_at":"2026-07-05T10:52:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"941fdb2fe7693cb597ba15a50777c49869d9c23f5729771112d6904fed328a9c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-21T18:02:39Z","title_canon_sha256":"9d839758d3078dc60048d8492fdd9c5c05875b1cf90d3bffedadd820c0e483fe"},"schema_version":"1.0","source":{"id":"2504.15356","kind":"arxiv","version":1}},"canonical_sha256":"1599c214cc85cee4b43938ece3a6638a66f252be68a65201c85a631073e5935d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1599c214cc85cee4b43938ece3a6638a66f252be68a65201c85a631073e5935d","first_computed_at":"2026-07-05T10:52:01.346429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:52:01.346429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q9kt+cDpWoyynC0hP9WfTyCXOmgNkGj976rHAMLXUYpDEbswrovrYG24lj5VZkj7+ZPFYQnZwJ2MjaBZ8XklDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:52:01.346923Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.15356","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91b822d7519ebb65256d81d6ef7e660e4020a37611bcd6560672e3f75f4b51b7","sha256:2ebdf539fdc9695989caba9b65901f9a5df4bb8910f1549c2dbd41fc846511de"],"state_sha256":"97dac39395734380380c0589a77297dd89919e3045d478b9c47ac6fdb0f82850"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"25HARt0defiSNoyF5zO9sgYQYxMMi7IrwhPSBCwkOktkAlQ4M4XCsUvlseYXM1syyZrSwPxW9K1ojX3GPd5iBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T13:25:09.463782Z","bundle_sha256":"963c1d54c7beb90cb0cfc41cf4e5fae242aafbf520671660d00856a3e05f9138"}}