{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:W6NDSYUZ7KLTSRUOQ5GN3YTFAH","short_pith_number":"pith:W6NDSYUZ","schema_version":"1.0","canonical_sha256":"b79a396299fa9739468e874cdde26501c67f7a1b8e94b93ff3c52e9c1d1deaf9","source":{"kind":"arxiv","id":"2605.29546","version":1},"attestation_state":"computed","paper":{"title":"Rademacher Complexity Bounds for Parameterized Quantum Circuits Generated by Pauli Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hiroshi Ohno","submitted_at":"2026-05-28T07:59:02Z","abstract_excerpt":"In this study, we analyze the Rademacher complexity $ \\mathcal{R}_{M} $ of a parameterized unitary whose generators are chosen from $ n $-qubit Pauli strings. Although generalization bounds for quantum machine learning models have been studied in several settings, explicit Rademacher-complexity bounds for parameterized unitaries generated by Pauli strings remain less transparent. We derive simple scaling bounds in terms of the number of parameters $ L $ and the number of training samples $ M $: $ \\mathcal{O}(\\frac{L^{\\frac{3}{2}}}{\\sqrt{M}}) $ for the full parameter domain and $ \\mathcal{O}(\\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":"2605.29546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-28T07:59:02Z","cross_cats_sorted":[],"title_canon_sha256":"b113aafd5a42b9f6ba63be2e5ea96a0bc1b2364c7a88093f57da126b7d1b1f66","abstract_canon_sha256":"0c1f1eb15660f18af6624697c202494aadf59682b7743cc55b1a219eee170323"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:05:46.362145Z","signature_b64":"BGCwy1k/i3U8QGgMLHVe7c1tejeg3afs3TnkSW6AnRjspk4wT3zd73Kg/veeJ23xVMDtSur9dDrOaU8Mx5MACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b79a396299fa9739468e874cdde26501c67f7a1b8e94b93ff3c52e9c1d1deaf9","last_reissued_at":"2026-05-29T01:05:46.358992Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:05:46.358992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rademacher Complexity Bounds for Parameterized Quantum Circuits Generated by Pauli Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hiroshi Ohno","submitted_at":"2026-05-28T07:59:02Z","abstract_excerpt":"In this study, we analyze the Rademacher complexity $ \\mathcal{R}_{M} $ of a parameterized unitary whose generators are chosen from $ n $-qubit Pauli strings. Although generalization bounds for quantum machine learning models have been studied in several settings, explicit Rademacher-complexity bounds for parameterized unitaries generated by Pauli strings remain less transparent. We derive simple scaling bounds in terms of the number of parameters $ L $ and the number of training samples $ M $: $ \\mathcal{O}(\\frac{L^{\\frac{3}{2}}}{\\sqrt{M}}) $ for the full parameter domain and $ \\mathcal{O}(\\f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29546","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/2605.29546/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":"2605.29546","created_at":"2026-05-29T01:05:46.359114+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.29546v1","created_at":"2026-05-29T01:05:46.359114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.29546","created_at":"2026-05-29T01:05:46.359114+00:00"},{"alias_kind":"pith_short_12","alias_value":"W6NDSYUZ7KLT","created_at":"2026-05-29T01:05:46.359114+00:00"},{"alias_kind":"pith_short_16","alias_value":"W6NDSYUZ7KLTSRUO","created_at":"2026-05-29T01:05:46.359114+00:00"},{"alias_kind":"pith_short_8","alias_value":"W6NDSYUZ","created_at":"2026-05-29T01:05:46.359114+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/W6NDSYUZ7KLTSRUOQ5GN3YTFAH","json":"https://pith.science/pith/W6NDSYUZ7KLTSRUOQ5GN3YTFAH.json","graph_json":"https://pith.science/api/pith-number/W6NDSYUZ7KLTSRUOQ5GN3YTFAH/graph.json","events_json":"https://pith.science/api/pith-number/W6NDSYUZ7KLTSRUOQ5GN3YTFAH/events.json","paper":"https://pith.science/paper/W6NDSYUZ"},"agent_actions":{"view_html":"https://pith.science/pith/W6NDSYUZ7KLTSRUOQ5GN3YTFAH","download_json":"https://pith.science/pith/W6NDSYUZ7KLTSRUOQ5GN3YTFAH.json","view_paper":"https://pith.science/paper/W6NDSYUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.29546&json=true","fetch_graph":"https://pith.science/api/pith-number/W6NDSYUZ7KLTSRUOQ5GN3YTFAH/graph.json","fetch_events":"https://pith.science/api/pith-number/W6NDSYUZ7KLTSRUOQ5GN3YTFAH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W6NDSYUZ7KLTSRUOQ5GN3YTFAH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W6NDSYUZ7KLTSRUOQ5GN3YTFAH/action/storage_attestation","attest_author":"https://pith.science/pith/W6NDSYUZ7KLTSRUOQ5GN3YTFAH/action/author_attestation","sign_citation":"https://pith.science/pith/W6NDSYUZ7KLTSRUOQ5GN3YTFAH/action/citation_signature","submit_replication":"https://pith.science/pith/W6NDSYUZ7KLTSRUOQ5GN3YTFAH/action/replication_record"}},"created_at":"2026-05-29T01:05:46.359114+00:00","updated_at":"2026-05-29T01:05:46.359114+00:00"}