{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NPAENHB4VGU2UWT5IFMQT7CALD","short_pith_number":"pith:NPAENHB4","schema_version":"1.0","canonical_sha256":"6bc0469c3ca9a9aa5a7d415909fc4058d9ab66d65f152a4376ba589523af05db","source":{"kind":"arxiv","id":"2401.10095","version":1},"attestation_state":"computed","paper":{"title":"Learning shallow quantum circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"quant-ph","authors_text":"Anurag Anshu, Hsin-Yuan Huang, Isaac Kim, Jarrod R. McClean, Michael Broughton, Yunchao Liu, Zeph Landau","submitted_at":"2024-01-18T16:05:00Z","abstract_excerpt":"Despite fundamental interests in learning quantum circuits, the existence of a computationally efficient algorithm for learning shallow quantum circuits remains an open question. Because shallow quantum circuits can generate distributions that are classically hard to sample from, existing learning algorithms do not apply. In this work, we present a polynomial-time classical algorithm for learning the description of any unknown $n$-qubit shallow quantum circuit $U$ (with arbitrary unknown architecture) within a small diamond distance using single-qubit measurement data on the output states of $"},"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":"2401.10095","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-01-18T16:05:00Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"f5f1ce2beac08581d35038084d3100407cc9b990f1196a889df4342477361718","abstract_canon_sha256":"0981f76c49f8463ebbd3e7cdf87c273d4b9e9aa8b7317880da3aa955945067da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:30:31.255256Z","signature_b64":"QUtO9uXOBIzvCUpyXDx5STHNBH7r0Qznl+dtKvUyviMmAyWnZG5KWjVhzBnNUlUUX8TkwY/JxTZnf1crSyQWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bc0469c3ca9a9aa5a7d415909fc4058d9ab66d65f152a4376ba589523af05db","last_reissued_at":"2026-07-05T08:30:31.254738Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:30:31.254738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning shallow quantum circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"quant-ph","authors_text":"Anurag Anshu, Hsin-Yuan Huang, Isaac Kim, Jarrod R. McClean, Michael Broughton, Yunchao Liu, Zeph Landau","submitted_at":"2024-01-18T16:05:00Z","abstract_excerpt":"Despite fundamental interests in learning quantum circuits, the existence of a computationally efficient algorithm for learning shallow quantum circuits remains an open question. Because shallow quantum circuits can generate distributions that are classically hard to sample from, existing learning algorithms do not apply. In this work, we present a polynomial-time classical algorithm for learning the description of any unknown $n$-qubit shallow quantum circuit $U$ (with arbitrary unknown architecture) within a small diamond distance using single-qubit measurement data on the output states of $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.10095","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/2401.10095/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":"2401.10095","created_at":"2026-07-05T08:30:31.254805+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.10095v1","created_at":"2026-07-05T08:30:31.254805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.10095","created_at":"2026-07-05T08:30:31.254805+00:00"},{"alias_kind":"pith_short_12","alias_value":"NPAENHB4VGU2","created_at":"2026-07-05T08:30:31.254805+00:00"},{"alias_kind":"pith_short_16","alias_value":"NPAENHB4VGU2UWT5","created_at":"2026-07-05T08:30:31.254805+00:00"},{"alias_kind":"pith_short_8","alias_value":"NPAENHB4","created_at":"2026-07-05T08:30:31.254805+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":79,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NPAENHB4VGU2UWT5IFMQT7CALD","json":"https://pith.science/pith/NPAENHB4VGU2UWT5IFMQT7CALD.json","graph_json":"https://pith.science/api/pith-number/NPAENHB4VGU2UWT5IFMQT7CALD/graph.json","events_json":"https://pith.science/api/pith-number/NPAENHB4VGU2UWT5IFMQT7CALD/events.json","paper":"https://pith.science/paper/NPAENHB4"},"agent_actions":{"view_html":"https://pith.science/pith/NPAENHB4VGU2UWT5IFMQT7CALD","download_json":"https://pith.science/pith/NPAENHB4VGU2UWT5IFMQT7CALD.json","view_paper":"https://pith.science/paper/NPAENHB4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.10095&json=true","fetch_graph":"https://pith.science/api/pith-number/NPAENHB4VGU2UWT5IFMQT7CALD/graph.json","fetch_events":"https://pith.science/api/pith-number/NPAENHB4VGU2UWT5IFMQT7CALD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NPAENHB4VGU2UWT5IFMQT7CALD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NPAENHB4VGU2UWT5IFMQT7CALD/action/storage_attestation","attest_author":"https://pith.science/pith/NPAENHB4VGU2UWT5IFMQT7CALD/action/author_attestation","sign_citation":"https://pith.science/pith/NPAENHB4VGU2UWT5IFMQT7CALD/action/citation_signature","submit_replication":"https://pith.science/pith/NPAENHB4VGU2UWT5IFMQT7CALD/action/replication_record"}},"created_at":"2026-07-05T08:30:31.254805+00:00","updated_at":"2026-07-05T08:30:31.254805+00:00"}