{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:6CEVN2P2YRA22DRQWS3UJ5DUL3","short_pith_number":"pith:6CEVN2P2","canonical_record":{"source":{"id":"2410.16693","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-22T04:48:36Z","cross_cats_sorted":[],"title_canon_sha256":"9b2a97bf31ba547b6d78a6d2759393dd7aef4b2d09d2ede78b71a30fac9d50be","abstract_canon_sha256":"9cc7fa1ad6e013f7e3d7c7a8d220769e6e624f8a1835c4531dd8e8335fd5fa41"},"schema_version":"1.0"},"canonical_sha256":"f08956e9fac441ad0e30b4b744f4745edebdc8cdd5e9fcd93c4382348801a783","source":{"kind":"arxiv","id":"2410.16693","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.16693","created_at":"2026-07-05T11:18:39Z"},{"alias_kind":"arxiv_version","alias_value":"2410.16693v2","created_at":"2026-07-05T11:18:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.16693","created_at":"2026-07-05T11:18:39Z"},{"alias_kind":"pith_short_12","alias_value":"6CEVN2P2YRA2","created_at":"2026-07-05T11:18:39Z"},{"alias_kind":"pith_short_16","alias_value":"6CEVN2P2YRA22DRQ","created_at":"2026-07-05T11:18:39Z"},{"alias_kind":"pith_short_8","alias_value":"6CEVN2P2","created_at":"2026-07-05T11:18:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:6CEVN2P2YRA22DRQWS3UJ5DUL3","target":"record","payload":{"canonical_record":{"source":{"id":"2410.16693","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-22T04:48:36Z","cross_cats_sorted":[],"title_canon_sha256":"9b2a97bf31ba547b6d78a6d2759393dd7aef4b2d09d2ede78b71a30fac9d50be","abstract_canon_sha256":"9cc7fa1ad6e013f7e3d7c7a8d220769e6e624f8a1835c4531dd8e8335fd5fa41"},"schema_version":"1.0"},"canonical_sha256":"f08956e9fac441ad0e30b4b744f4745edebdc8cdd5e9fcd93c4382348801a783","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:39.906731Z","signature_b64":"JIVYTIF/pUuKhhUXIXPGmeJQsLmnoyHhqlhUh56lmo3t6R7vJZGrlndOocPzkoieaFGVuy1QZExGEPRL+XLbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f08956e9fac441ad0e30b4b744f4745edebdc8cdd5e9fcd93c4382348801a783","last_reissued_at":"2026-07-05T11:18:39.906270Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:39.906270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.16693","source_version":2,"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-05T11:18:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7FJVY/tkjYvc8Vd9S1+aoRbwTY782PZoH4h9Z8taSBfVFUYqQGGxt8YHh1beL8H9j7X88Zg9B6KKFqDsD/bOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:43:17.391183Z"},"content_sha256":"faddbbdaf9fb4ffd4674e1bb3957778d1600961e4926d6bb35b65fea40d5d42d","schema_version":"1.0","event_id":"sha256:faddbbdaf9fb4ffd4674e1bb3957778d1600961e4926d6bb35b65fea40d5d42d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:6CEVN2P2YRA22DRQWS3UJ5DUL3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning shallow quantum circuits with many-qubit gates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Francisca Vasconcelos, Hsin-Yuan Huang","submitted_at":"2024-10-22T04:48:36Z","abstract_excerpt":"We present the first computationally-efficient algorithm for average-case learning of shallow quantum circuits with many-qubit gates. Specifically, we provide a quasi-polynomial time and sample complexity algorithm for learning unknown QAC$^0$ circuits -- constant-depth circuits with arbitrary single-qubit gates and polynomially many $CZ$ gates of unbounded width -- with at most logarithmic ancilla, up to inverse-polynomially small error. Furthermore, we show that the learned unitary can be efficiently synthesized in poly-logarithmic depth. This work expands the family of efficiently learnable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.16693","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/2410.16693/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-05T11:18:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bpNKJ9KYJtXfnFN7T5uWAdFlWY3AbROEYzw0IIXAr7hOamVLC+JaV9SIuSK5NQnMuoUYOUEMWNcA3eNtMulOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:43:17.391696Z"},"content_sha256":"1cd6e2681865e7a909306680bee3f1e3c8e52cc872075fac0544b2d26286c2c4","schema_version":"1.0","event_id":"sha256:1cd6e2681865e7a909306680bee3f1e3c8e52cc872075fac0544b2d26286c2c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CEVN2P2YRA22DRQWS3UJ5DUL3/bundle.json","state_url":"https://pith.science/pith/6CEVN2P2YRA22DRQWS3UJ5DUL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CEVN2P2YRA22DRQWS3UJ5DUL3/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-13T01:43:17Z","links":{"resolver":"https://pith.science/pith/6CEVN2P2YRA22DRQWS3UJ5DUL3","bundle":"https://pith.science/pith/6CEVN2P2YRA22DRQWS3UJ5DUL3/bundle.json","state":"https://pith.science/pith/6CEVN2P2YRA22DRQWS3UJ5DUL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CEVN2P2YRA22DRQWS3UJ5DUL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:6CEVN2P2YRA22DRQWS3UJ5DUL3","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":"9cc7fa1ad6e013f7e3d7c7a8d220769e6e624f8a1835c4531dd8e8335fd5fa41","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-22T04:48:36Z","title_canon_sha256":"9b2a97bf31ba547b6d78a6d2759393dd7aef4b2d09d2ede78b71a30fac9d50be"},"schema_version":"1.0","source":{"id":"2410.16693","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.16693","created_at":"2026-07-05T11:18:39Z"},{"alias_kind":"arxiv_version","alias_value":"2410.16693v2","created_at":"2026-07-05T11:18:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.16693","created_at":"2026-07-05T11:18:39Z"},{"alias_kind":"pith_short_12","alias_value":"6CEVN2P2YRA2","created_at":"2026-07-05T11:18:39Z"},{"alias_kind":"pith_short_16","alias_value":"6CEVN2P2YRA22DRQ","created_at":"2026-07-05T11:18:39Z"},{"alias_kind":"pith_short_8","alias_value":"6CEVN2P2","created_at":"2026-07-05T11:18:39Z"}],"graph_snapshots":[{"event_id":"sha256:1cd6e2681865e7a909306680bee3f1e3c8e52cc872075fac0544b2d26286c2c4","target":"graph","created_at":"2026-07-05T11:18:39Z","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/2410.16693/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present the first computationally-efficient algorithm for average-case learning of shallow quantum circuits with many-qubit gates. Specifically, we provide a quasi-polynomial time and sample complexity algorithm for learning unknown QAC$^0$ circuits -- constant-depth circuits with arbitrary single-qubit gates and polynomially many $CZ$ gates of unbounded width -- with at most logarithmic ancilla, up to inverse-polynomially small error. Furthermore, we show that the learned unitary can be efficiently synthesized in poly-logarithmic depth. This work expands the family of efficiently learnable","authors_text":"Francisca Vasconcelos, Hsin-Yuan Huang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-22T04:48:36Z","title":"Learning shallow quantum circuits with many-qubit gates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.16693","kind":"arxiv","version":2},"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:faddbbdaf9fb4ffd4674e1bb3957778d1600961e4926d6bb35b65fea40d5d42d","target":"record","created_at":"2026-07-05T11:18:39Z","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":"9cc7fa1ad6e013f7e3d7c7a8d220769e6e624f8a1835c4531dd8e8335fd5fa41","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-22T04:48:36Z","title_canon_sha256":"9b2a97bf31ba547b6d78a6d2759393dd7aef4b2d09d2ede78b71a30fac9d50be"},"schema_version":"1.0","source":{"id":"2410.16693","kind":"arxiv","version":2}},"canonical_sha256":"f08956e9fac441ad0e30b4b744f4745edebdc8cdd5e9fcd93c4382348801a783","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f08956e9fac441ad0e30b4b744f4745edebdc8cdd5e9fcd93c4382348801a783","first_computed_at":"2026-07-05T11:18:39.906270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:18:39.906270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JIVYTIF/pUuKhhUXIXPGmeJQsLmnoyHhqlhUh56lmo3t6R7vJZGrlndOocPzkoieaFGVuy1QZExGEPRL+XLbBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:18:39.906731Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.16693","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:faddbbdaf9fb4ffd4674e1bb3957778d1600961e4926d6bb35b65fea40d5d42d","sha256:1cd6e2681865e7a909306680bee3f1e3c8e52cc872075fac0544b2d26286c2c4"],"state_sha256":"97111db9f566eee88f57ecd4169f4e737aac0f0fcb22f01ede27fad1c86b9d8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GAo6S5ngxgWSiBhuPyr3aWDFadHancFe/KPSAAdeoU8B6FxLeM3dp6/ZQsb/q7CDpo1TGw9QG8teDuL8eW8jCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T01:43:17.396777Z","bundle_sha256":"8308f6c456c29aad9d7487d503e31768179452b67b65b9c075b0dcd1bf8cfe89"}}