{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:772UXICZHDKTJYE7ZIQ34VVHJT","short_pith_number":"pith:772UXICZ","schema_version":"1.0","canonical_sha256":"fff54ba05938d534e09fca21be56a74ce5ea3e9eb8fa052dd150dbb83bfc9de3","source":{"kind":"arxiv","id":"2203.00031","version":2},"attestation_state":"computed","paper":{"title":"The complexity of quantum support vector machines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Arne Thomsen, David Sutter, Gian Gentinetta, Stefan Woerner","submitted_at":"2022-02-28T19:01:17Z","abstract_excerpt":"Quantum support vector machines employ quantum circuits to define the kernel function. It has been shown that this approach offers a provable exponential speedup compared to any known classical algorithm for certain data sets. The training of such models corresponds to solving a convex optimization problem either via its primal or dual formulation. Due to the probabilistic nature of quantum mechanics, the training algorithms are affected by statistical uncertainty, which has a major impact on their complexity. We show that the dual problem can be solved in $O(M^{4.67}/\\varepsilon^2)$ quantum c"},"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":"2203.00031","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-02-28T19:01:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c6a29cd51623c03b09df35fc79b8a92df753395435056c944204f6196fe74b45","abstract_canon_sha256":"b2529ad328aff3b7c1ab3aff96cab725f5e41adaadf2949f0bd91a1e8e1f9b4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:33:46.836286Z","signature_b64":"44Jn7XwxrUXV5edOxwwhgKDE+1OiS0UsmgVrx0vgUFVU9M30piRzVQvwmq7cFdHP7T5ZpHyMwUCAVgsXdPbtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fff54ba05938d534e09fca21be56a74ce5ea3e9eb8fa052dd150dbb83bfc9de3","last_reissued_at":"2026-07-05T07:33:46.835875Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:33:46.835875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of quantum support vector machines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Arne Thomsen, David Sutter, Gian Gentinetta, Stefan Woerner","submitted_at":"2022-02-28T19:01:17Z","abstract_excerpt":"Quantum support vector machines employ quantum circuits to define the kernel function. It has been shown that this approach offers a provable exponential speedup compared to any known classical algorithm for certain data sets. The training of such models corresponds to solving a convex optimization problem either via its primal or dual formulation. Due to the probabilistic nature of quantum mechanics, the training algorithms are affected by statistical uncertainty, which has a major impact on their complexity. We show that the dual problem can be solved in $O(M^{4.67}/\\varepsilon^2)$ quantum c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.00031","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/2203.00031/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":"2203.00031","created_at":"2026-07-05T07:33:46.835929+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.00031v2","created_at":"2026-07-05T07:33:46.835929+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.00031","created_at":"2026-07-05T07:33:46.835929+00:00"},{"alias_kind":"pith_short_12","alias_value":"772UXICZHDKT","created_at":"2026-07-05T07:33:46.835929+00:00"},{"alias_kind":"pith_short_16","alias_value":"772UXICZHDKTJYE7","created_at":"2026-07-05T07:33:46.835929+00:00"},{"alias_kind":"pith_short_8","alias_value":"772UXICZ","created_at":"2026-07-05T07:33:46.835929+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.19625","citing_title":"Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems","ref_index":113,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/772UXICZHDKTJYE7ZIQ34VVHJT","json":"https://pith.science/pith/772UXICZHDKTJYE7ZIQ34VVHJT.json","graph_json":"https://pith.science/api/pith-number/772UXICZHDKTJYE7ZIQ34VVHJT/graph.json","events_json":"https://pith.science/api/pith-number/772UXICZHDKTJYE7ZIQ34VVHJT/events.json","paper":"https://pith.science/paper/772UXICZ"},"agent_actions":{"view_html":"https://pith.science/pith/772UXICZHDKTJYE7ZIQ34VVHJT","download_json":"https://pith.science/pith/772UXICZHDKTJYE7ZIQ34VVHJT.json","view_paper":"https://pith.science/paper/772UXICZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.00031&json=true","fetch_graph":"https://pith.science/api/pith-number/772UXICZHDKTJYE7ZIQ34VVHJT/graph.json","fetch_events":"https://pith.science/api/pith-number/772UXICZHDKTJYE7ZIQ34VVHJT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/772UXICZHDKTJYE7ZIQ34VVHJT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/772UXICZHDKTJYE7ZIQ34VVHJT/action/storage_attestation","attest_author":"https://pith.science/pith/772UXICZHDKTJYE7ZIQ34VVHJT/action/author_attestation","sign_citation":"https://pith.science/pith/772UXICZHDKTJYE7ZIQ34VVHJT/action/citation_signature","submit_replication":"https://pith.science/pith/772UXICZHDKTJYE7ZIQ34VVHJT/action/replication_record"}},"created_at":"2026-07-05T07:33:46.835929+00:00","updated_at":"2026-07-05T07:33:46.835929+00:00"}