{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LWQST7X6XIB7PCRSCS7QLQSD34","short_pith_number":"pith:LWQST7X6","schema_version":"1.0","canonical_sha256":"5da129fefeba03f78a3214bf05c243df021283124a162fd7b1832bbb16e3e667","source":{"kind":"arxiv","id":"2608.09912","version":1},"attestation_state":"computed","paper":{"title":"Learning Clifford-structured quantum unitaries and Hamiltonians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Arkopal Dutt, Dale Jacobs, John Jeang, Saeed Mehraban, Vladimir Podolskii","submitted_at":"2026-08-10T17:54:14Z","abstract_excerpt":"Learning algorithms for structured quantum unitaries and Hamiltonians have primarily considered classes of processes that are local or sparse in the Pauli basis. We turn our attention to learning $n$-qubit quantum unitaries $U$ and Hamiltonians $H$, given query access to $U$ or the unitary evolution of $H$, that may be dense in the Pauli basis but still admit concise Clifford decompositions. Specifically, we consider unitaries (or Hamiltonians) of the form $U = \\sum_i \\alpha_i C_i$ over Cliffords $C_i$ with bounded Clifford extent $\\sum_i |\\alpha_i|$. To extract this Clifford structure, we int"},"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":"2608.09912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-10T17:54:14Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4f3e0c357ef4b622de7bb6be01a14cb0acca750e6ea7b2be0d21b16c09e73a36","abstract_canon_sha256":"ced28462925786a993ef0a85c19fad415e6046b1420fca9cb89f1d377ee1bee1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T02:25:25.984159Z","signature_b64":"u9wE4lfxITY5AnQtfhPykbl3sCLuqOtmm5401P8E2sbs7gAYYSN1MEBmYr43POe96ZnpuqMSeRBFd0eS29ouDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5da129fefeba03f78a3214bf05c243df021283124a162fd7b1832bbb16e3e667","last_reissued_at":"2026-08-11T02:25:25.982722Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T02:25:25.982722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Clifford-structured quantum unitaries and Hamiltonians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Arkopal Dutt, Dale Jacobs, John Jeang, Saeed Mehraban, Vladimir Podolskii","submitted_at":"2026-08-10T17:54:14Z","abstract_excerpt":"Learning algorithms for structured quantum unitaries and Hamiltonians have primarily considered classes of processes that are local or sparse in the Pauli basis. We turn our attention to learning $n$-qubit quantum unitaries $U$ and Hamiltonians $H$, given query access to $U$ or the unitary evolution of $H$, that may be dense in the Pauli basis but still admit concise Clifford decompositions. Specifically, we consider unitaries (or Hamiltonians) of the form $U = \\sum_i \\alpha_i C_i$ over Cliffords $C_i$ with bounded Clifford extent $\\sum_i |\\alpha_i|$. To extract this Clifford structure, we int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.09912","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/2608.09912/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":"2608.09912","created_at":"2026-08-11T02:25:25.983295+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.09912v1","created_at":"2026-08-11T02:25:25.983295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.09912","created_at":"2026-08-11T02:25:25.983295+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWQST7X6XIB7","created_at":"2026-08-11T02:25:25.983295+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWQST7X6XIB7PCRS","created_at":"2026-08-11T02:25:25.983295+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWQST7X6","created_at":"2026-08-11T02:25:25.983295+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/LWQST7X6XIB7PCRSCS7QLQSD34","json":"https://pith.science/pith/LWQST7X6XIB7PCRSCS7QLQSD34.json","graph_json":"https://pith.science/api/pith-number/LWQST7X6XIB7PCRSCS7QLQSD34/graph.json","events_json":"https://pith.science/api/pith-number/LWQST7X6XIB7PCRSCS7QLQSD34/events.json","paper":"https://pith.science/paper/LWQST7X6"},"agent_actions":{"view_html":"https://pith.science/pith/LWQST7X6XIB7PCRSCS7QLQSD34","download_json":"https://pith.science/pith/LWQST7X6XIB7PCRSCS7QLQSD34.json","view_paper":"https://pith.science/paper/LWQST7X6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.09912&json=true","fetch_graph":"https://pith.science/api/pith-number/LWQST7X6XIB7PCRSCS7QLQSD34/graph.json","fetch_events":"https://pith.science/api/pith-number/LWQST7X6XIB7PCRSCS7QLQSD34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWQST7X6XIB7PCRSCS7QLQSD34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWQST7X6XIB7PCRSCS7QLQSD34/action/storage_attestation","attest_author":"https://pith.science/pith/LWQST7X6XIB7PCRSCS7QLQSD34/action/author_attestation","sign_citation":"https://pith.science/pith/LWQST7X6XIB7PCRSCS7QLQSD34/action/citation_signature","submit_replication":"https://pith.science/pith/LWQST7X6XIB7PCRSCS7QLQSD34/action/replication_record"}},"created_at":"2026-08-11T02:25:25.983295+00:00","updated_at":"2026-08-11T02:25:25.983295+00:00"}