{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5UYYC2BAJBN4QXFF7XWBH6CXVR","short_pith_number":"pith:5UYYC2BA","schema_version":"1.0","canonical_sha256":"ed31816820485bc85ca5fdec13f857ac6203b3c8ed85af8aa5241a1ce72510b3","source":{"kind":"arxiv","id":"2210.14894","version":3},"attestation_state":"computed","paper":{"title":"Learning to predict arbitrary quantum processes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"primary_cat":"quant-ph","authors_text":"Hsin-Yuan Huang, John Preskill, Sitan Chen","submitted_at":"2022-10-26T17:52:59Z","abstract_excerpt":"We present an efficient machine learning (ML) algorithm for predicting any unknown quantum process $\\mathcal{E}$ over $n$ qubits. For a wide range of distributions $\\mathcal{D}$ on arbitrary $n$-qubit states, we show that this ML algorithm can learn to predict any local property of the output from the unknown process~$\\mathcal{E}$, with a small average error over input states drawn from $\\mathcal{D}$. The ML algorithm is computationally efficient even when the unknown process is a quantum circuit with exponentially many gates. Our algorithm combines efficient procedures for learning properties"},"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":"2210.14894","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-10-26T17:52:59Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"25e832596207541af82a956c2bcdfbf58d6e66ceecb81ebdcbcf58bdc07a1b16","abstract_canon_sha256":"8948f3b9c1ffca90645de4d4ada8bf7c5dd0358674b71b07dbfe06d95e7b80bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:01:14.795662Z","signature_b64":"jT9tDUL5Mw5tWjfcCwaQUqx05i7fLM+8cJifSHIPmiibgSQGCj057dJwYeeptg4d59113DMbblWviVQ34f35Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed31816820485bc85ca5fdec13f857ac6203b3c8ed85af8aa5241a1ce72510b3","last_reissued_at":"2026-07-05T06:01:14.795196Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:01:14.795196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to predict arbitrary quantum processes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"primary_cat":"quant-ph","authors_text":"Hsin-Yuan Huang, John Preskill, Sitan Chen","submitted_at":"2022-10-26T17:52:59Z","abstract_excerpt":"We present an efficient machine learning (ML) algorithm for predicting any unknown quantum process $\\mathcal{E}$ over $n$ qubits. For a wide range of distributions $\\mathcal{D}$ on arbitrary $n$-qubit states, we show that this ML algorithm can learn to predict any local property of the output from the unknown process~$\\mathcal{E}$, with a small average error over input states drawn from $\\mathcal{D}$. The ML algorithm is computationally efficient even when the unknown process is a quantum circuit with exponentially many gates. Our algorithm combines efficient procedures for learning properties"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.14894","kind":"arxiv","version":3},"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/2210.14894/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":"2210.14894","created_at":"2026-07-05T06:01:14.795255+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.14894v3","created_at":"2026-07-05T06:01:14.795255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.14894","created_at":"2026-07-05T06:01:14.795255+00:00"},{"alias_kind":"pith_short_12","alias_value":"5UYYC2BAJBN4","created_at":"2026-07-05T06:01:14.795255+00:00"},{"alias_kind":"pith_short_16","alias_value":"5UYYC2BAJBN4QXFF","created_at":"2026-07-05T06:01:14.795255+00:00"},{"alias_kind":"pith_short_8","alias_value":"5UYYC2BA","created_at":"2026-07-05T06:01:14.795255+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06472","citing_title":"Provable learning separation for predicting time-evolution of quantum many-body systems","ref_index":43,"is_internal_anchor":true},{"citing_arxiv_id":"2605.25178","citing_title":"Pseudorandom Dynamics in the SYK Model and Cryptographic Censorship in JT Gravity","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2303.12834","citing_title":"The power and limitations of learning quantum dynamics incoherently","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2501.13101","citing_title":"Simulating quantum circuits with arbitrary local noise using Pauli Propagation","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5UYYC2BAJBN4QXFF7XWBH6CXVR","json":"https://pith.science/pith/5UYYC2BAJBN4QXFF7XWBH6CXVR.json","graph_json":"https://pith.science/api/pith-number/5UYYC2BAJBN4QXFF7XWBH6CXVR/graph.json","events_json":"https://pith.science/api/pith-number/5UYYC2BAJBN4QXFF7XWBH6CXVR/events.json","paper":"https://pith.science/paper/5UYYC2BA"},"agent_actions":{"view_html":"https://pith.science/pith/5UYYC2BAJBN4QXFF7XWBH6CXVR","download_json":"https://pith.science/pith/5UYYC2BAJBN4QXFF7XWBH6CXVR.json","view_paper":"https://pith.science/paper/5UYYC2BA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.14894&json=true","fetch_graph":"https://pith.science/api/pith-number/5UYYC2BAJBN4QXFF7XWBH6CXVR/graph.json","fetch_events":"https://pith.science/api/pith-number/5UYYC2BAJBN4QXFF7XWBH6CXVR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5UYYC2BAJBN4QXFF7XWBH6CXVR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5UYYC2BAJBN4QXFF7XWBH6CXVR/action/storage_attestation","attest_author":"https://pith.science/pith/5UYYC2BAJBN4QXFF7XWBH6CXVR/action/author_attestation","sign_citation":"https://pith.science/pith/5UYYC2BAJBN4QXFF7XWBH6CXVR/action/citation_signature","submit_replication":"https://pith.science/pith/5UYYC2BAJBN4QXFF7XWBH6CXVR/action/replication_record"}},"created_at":"2026-07-05T06:01:14.795255+00:00","updated_at":"2026-07-05T06:01:14.795255+00:00"}