{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RMOHR2MSZZNLAEI7P57JVM4AKW","short_pith_number":"pith:RMOHR2MS","schema_version":"1.0","canonical_sha256":"8b1c78e992ce5ab0111f7f7e9ab3805599fa957c65b1dc753bd96868dacf6e51","source":{"kind":"arxiv","id":"2310.07528","version":2},"attestation_state":"computed","paper":{"title":"Non-asymptotic Approximation Error Bounds of Parameterized Quantum Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Jerry Zhijian Yang, Qiuhao Chen, Xiliang Lu, Xin Wang, Yinan Li, Yuling Jiao, Zhan Yu","submitted_at":"2023-10-11T14:29:11Z","abstract_excerpt":"Parameterized quantum circuits (PQCs) have emerged as a promising approach for quantum neural networks. However, understanding their expressive power in accomplishing machine learning tasks remains a crucial question. This paper investigates the expressivity of PQCs for approximating general multivariate function classes. Unlike previous Universal Approximation Theorems for PQCs, which are either nonconstructive or rely on parameterized classical data processing, we explicitly construct data re-uploading PQCs for approximating multivariate polynomials and smooth functions. We establish the fir"},"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":"2310.07528","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-10-11T14:29:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ac4ed89d1d26db76fe1f6af2dbcb0de2a00f928f92990eb108e68a89adb1bf16","abstract_canon_sha256":"688a66b7b00c28fdbb19738dae2febea04300d7f19cb3442f44aa4a3c6c2833c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:17:34.222148Z","signature_b64":"3zyHvjwFIEZpwjaJWfPZJ/2g0MsCCyk1/c12OaW0OsNaXN3cabQahlIUmuwbXkoLyynE7NHmEnQrglgJUr2bCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b1c78e992ce5ab0111f7f7e9ab3805599fa957c65b1dc753bd96868dacf6e51","last_reissued_at":"2026-07-05T09:17:34.221674Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:17:34.221674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-asymptotic Approximation Error Bounds of Parameterized Quantum Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Jerry Zhijian Yang, Qiuhao Chen, Xiliang Lu, Xin Wang, Yinan Li, Yuling Jiao, Zhan Yu","submitted_at":"2023-10-11T14:29:11Z","abstract_excerpt":"Parameterized quantum circuits (PQCs) have emerged as a promising approach for quantum neural networks. However, understanding their expressive power in accomplishing machine learning tasks remains a crucial question. This paper investigates the expressivity of PQCs for approximating general multivariate function classes. Unlike previous Universal Approximation Theorems for PQCs, which are either nonconstructive or rely on parameterized classical data processing, we explicitly construct data re-uploading PQCs for approximating multivariate polynomials and smooth functions. We establish the fir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.07528","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/2310.07528/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":"2310.07528","created_at":"2026-07-05T09:17:34.221733+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.07528v2","created_at":"2026-07-05T09:17:34.221733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.07528","created_at":"2026-07-05T09:17:34.221733+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMOHR2MSZZNL","created_at":"2026-07-05T09:17:34.221733+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMOHR2MSZZNLAEI7","created_at":"2026-07-05T09:17:34.221733+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMOHR2MS","created_at":"2026-07-05T09:17:34.221733+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25598","citing_title":"The Cost of Removing Tunability in Quantum Data Re-Uploading","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RMOHR2MSZZNLAEI7P57JVM4AKW","json":"https://pith.science/pith/RMOHR2MSZZNLAEI7P57JVM4AKW.json","graph_json":"https://pith.science/api/pith-number/RMOHR2MSZZNLAEI7P57JVM4AKW/graph.json","events_json":"https://pith.science/api/pith-number/RMOHR2MSZZNLAEI7P57JVM4AKW/events.json","paper":"https://pith.science/paper/RMOHR2MS"},"agent_actions":{"view_html":"https://pith.science/pith/RMOHR2MSZZNLAEI7P57JVM4AKW","download_json":"https://pith.science/pith/RMOHR2MSZZNLAEI7P57JVM4AKW.json","view_paper":"https://pith.science/paper/RMOHR2MS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.07528&json=true","fetch_graph":"https://pith.science/api/pith-number/RMOHR2MSZZNLAEI7P57JVM4AKW/graph.json","fetch_events":"https://pith.science/api/pith-number/RMOHR2MSZZNLAEI7P57JVM4AKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMOHR2MSZZNLAEI7P57JVM4AKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMOHR2MSZZNLAEI7P57JVM4AKW/action/storage_attestation","attest_author":"https://pith.science/pith/RMOHR2MSZZNLAEI7P57JVM4AKW/action/author_attestation","sign_citation":"https://pith.science/pith/RMOHR2MSZZNLAEI7P57JVM4AKW/action/citation_signature","submit_replication":"https://pith.science/pith/RMOHR2MSZZNLAEI7P57JVM4AKW/action/replication_record"}},"created_at":"2026-07-05T09:17:34.221733+00:00","updated_at":"2026-07-05T09:17:34.221733+00:00"}