{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6CEVN2P2YRA22DRQWS3UJ5DUL3","short_pith_number":"pith:6CEVN2P2","schema_version":"1.0","canonical_sha256":"f08956e9fac441ad0e30b4b744f4745edebdc8cdd5e9fcd93c4382348801a783","source":{"kind":"arxiv","id":"2410.16693","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2410.16693","created_at":"2026-07-05T11:18:39.906337+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.16693v2","created_at":"2026-07-05T11:18:39.906337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.16693","created_at":"2026-07-05T11:18:39.906337+00:00"},{"alias_kind":"pith_short_12","alias_value":"6CEVN2P2YRA2","created_at":"2026-07-05T11:18:39.906337+00:00"},{"alias_kind":"pith_short_16","alias_value":"6CEVN2P2YRA22DRQ","created_at":"2026-07-05T11:18:39.906337+00:00"},{"alias_kind":"pith_short_8","alias_value":"6CEVN2P2","created_at":"2026-07-05T11:18:39.906337+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22743","citing_title":"Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood","ref_index":114,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6CEVN2P2YRA22DRQWS3UJ5DUL3","json":"https://pith.science/pith/6CEVN2P2YRA22DRQWS3UJ5DUL3.json","graph_json":"https://pith.science/api/pith-number/6CEVN2P2YRA22DRQWS3UJ5DUL3/graph.json","events_json":"https://pith.science/api/pith-number/6CEVN2P2YRA22DRQWS3UJ5DUL3/events.json","paper":"https://pith.science/paper/6CEVN2P2"},"agent_actions":{"view_html":"https://pith.science/pith/6CEVN2P2YRA22DRQWS3UJ5DUL3","download_json":"https://pith.science/pith/6CEVN2P2YRA22DRQWS3UJ5DUL3.json","view_paper":"https://pith.science/paper/6CEVN2P2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.16693&json=true","fetch_graph":"https://pith.science/api/pith-number/6CEVN2P2YRA22DRQWS3UJ5DUL3/graph.json","fetch_events":"https://pith.science/api/pith-number/6CEVN2P2YRA22DRQWS3UJ5DUL3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6CEVN2P2YRA22DRQWS3UJ5DUL3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6CEVN2P2YRA22DRQWS3UJ5DUL3/action/storage_attestation","attest_author":"https://pith.science/pith/6CEVN2P2YRA22DRQWS3UJ5DUL3/action/author_attestation","sign_citation":"https://pith.science/pith/6CEVN2P2YRA22DRQWS3UJ5DUL3/action/citation_signature","submit_replication":"https://pith.science/pith/6CEVN2P2YRA22DRQWS3UJ5DUL3/action/replication_record"}},"created_at":"2026-07-05T11:18:39.906337+00:00","updated_at":"2026-07-05T11:18:39.906337+00:00"}