{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JJFRSCN33AISZBQ26RNSKCVRJC","short_pith_number":"pith:JJFRSCN3","schema_version":"1.0","canonical_sha256":"4a4b1909bbd8112c861af45b250ab148ab816aa232e29c9df6c7d720a99c1848","source":{"kind":"arxiv","id":"2507.17470","version":1},"attestation_state":"computed","paper":{"title":"Demonstration of Efficient Predictive Surrogates for Large-scale Quantum Processors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"quant-ph","authors_text":"Bo Du, Dacheng Tao, He-Liang Huang, Tian-Ci Tian, Wei-You Liao, Xinbiao Wang, Yong Luo, Yuxuan Du","submitted_at":"2025-07-23T12:51:03Z","abstract_excerpt":"The ongoing development of quantum processors is driving breakthroughs in scientific discovery. Despite this progress, the formidable cost of fabricating large-scale quantum processors means they will remain rare for the foreseeable future, limiting their widespread application. To address this bottleneck, we introduce the concept of predictive surrogates, which are classical learning models designed to emulate the mean-value behavior of a given quantum processor with provably computational efficiency. In particular, we propose two predictive surrogates that can substantially reduce the need f"},"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":"2507.17470","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-23T12:51:03Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"fd8b8e5a334bf7f6d771aaf3684adeff04ef69d2f54b6e707193976325705081","abstract_canon_sha256":"0b3743200baf8d0d9e7e2afdf0c291ecd1714fc1282994c3e03625b655703f28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:42:08.409153Z","signature_b64":"GtG8b/OtKtD7qsfCorYEwVHvZrGZVR3i0biNQVlmsbzJUDqCdk9FFdvJuCCr+/TwoaG7eaaR/9D+QU+W4x1QCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a4b1909bbd8112c861af45b250ab148ab816aa232e29c9df6c7d720a99c1848","last_reissued_at":"2026-07-05T11:42:08.408655Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:42:08.408655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Demonstration of Efficient Predictive Surrogates for Large-scale Quantum Processors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"quant-ph","authors_text":"Bo Du, Dacheng Tao, He-Liang Huang, Tian-Ci Tian, Wei-You Liao, Xinbiao Wang, Yong Luo, Yuxuan Du","submitted_at":"2025-07-23T12:51:03Z","abstract_excerpt":"The ongoing development of quantum processors is driving breakthroughs in scientific discovery. Despite this progress, the formidable cost of fabricating large-scale quantum processors means they will remain rare for the foreseeable future, limiting their widespread application. To address this bottleneck, we introduce the concept of predictive surrogates, which are classical learning models designed to emulate the mean-value behavior of a given quantum processor with provably computational efficiency. In particular, we propose two predictive surrogates that can substantially reduce the need f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.17470","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/2507.17470/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":"2507.17470","created_at":"2026-07-05T11:42:08.408726+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.17470v1","created_at":"2026-07-05T11:42:08.408726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.17470","created_at":"2026-07-05T11:42:08.408726+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJFRSCN33AIS","created_at":"2026-07-05T11:42:08.408726+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJFRSCN33AISZBQ2","created_at":"2026-07-05T11:42:08.408726+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJFRSCN3","created_at":"2026-07-05T11:42:08.408726+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06232","citing_title":"Learning to Reconstruct Wigner Functions in Phase Space","ref_index":57,"is_internal_anchor":true},{"citing_arxiv_id":"2605.02066","citing_title":"Accelerating Noisy Variational Quantum Algorithms with Physics-Informed Denoising Networks","ref_index":59,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JJFRSCN33AISZBQ26RNSKCVRJC","json":"https://pith.science/pith/JJFRSCN33AISZBQ26RNSKCVRJC.json","graph_json":"https://pith.science/api/pith-number/JJFRSCN33AISZBQ26RNSKCVRJC/graph.json","events_json":"https://pith.science/api/pith-number/JJFRSCN33AISZBQ26RNSKCVRJC/events.json","paper":"https://pith.science/paper/JJFRSCN3"},"agent_actions":{"view_html":"https://pith.science/pith/JJFRSCN33AISZBQ26RNSKCVRJC","download_json":"https://pith.science/pith/JJFRSCN33AISZBQ26RNSKCVRJC.json","view_paper":"https://pith.science/paper/JJFRSCN3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.17470&json=true","fetch_graph":"https://pith.science/api/pith-number/JJFRSCN33AISZBQ26RNSKCVRJC/graph.json","fetch_events":"https://pith.science/api/pith-number/JJFRSCN33AISZBQ26RNSKCVRJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJFRSCN33AISZBQ26RNSKCVRJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJFRSCN33AISZBQ26RNSKCVRJC/action/storage_attestation","attest_author":"https://pith.science/pith/JJFRSCN33AISZBQ26RNSKCVRJC/action/author_attestation","sign_citation":"https://pith.science/pith/JJFRSCN33AISZBQ26RNSKCVRJC/action/citation_signature","submit_replication":"https://pith.science/pith/JJFRSCN33AISZBQ26RNSKCVRJC/action/replication_record"}},"created_at":"2026-07-05T11:42:08.408726+00:00","updated_at":"2026-07-05T11:42:08.408726+00:00"}