{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CGPQ2PWKCXA22YJNSILIF652ME","short_pith_number":"pith:CGPQ2PWK","schema_version":"1.0","canonical_sha256":"119f0d3eca15c1ad612d921682fbba613814ee8938bc0dbe4c8391ae8f40e78c","source":{"kind":"arxiv","id":"2405.02630","version":3},"attestation_state":"computed","paper":{"title":"Validating Large-Scale Quantum Machine Learning: Efficient Simulation of Quantum Support Vector Machines Using Tensor Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.SE"],"primary_cat":"quant-ph","authors_text":"An-Cheng Yang, Chun-Chieh Wang, Chun-Yu Lin, Kuan-Cheng Chen, Nan-Yow Chen, Robert Wille, Simon See, Tai-Yue Li, Yun-Yuan Wang","submitted_at":"2024-05-04T10:37:01Z","abstract_excerpt":"We present an efficient tensor-network-based approach for simulating large-scale quantum circuits, demonstrated using Quantum Support Vector Machines (QSVMs). Our method effectively reduces exponential runtime growth to near-quadratic scaling with respect to the number of qubits in practical scenarios. Traditional state-vector simulations become computationally infeasible beyond approximately 50 qubits; in contrast, our simulator successfully handles QSVMs with up to 784 qubits, completing simulations within seconds on a single high-performance GPU. Furthermore, by employing the Message Passin"},"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":"2405.02630","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-05-04T10:37:01Z","cross_cats_sorted":["cs.DC","cs.SE"],"title_canon_sha256":"ffb89d197d8d3e82191b132fd56663bc67a57152f0ba256f00f666576a88af06","abstract_canon_sha256":"1bfa5526c56988a02ce14faaf8c9729232cc5d566d2e52dd34e62bd6cd1d50d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:41.574932Z","signature_b64":"lhO08YMhUre229kkX11pXCTdoEw0skBBSDWR0Btn/sn4SnkJIBGMatGlbXfwp8x05bOXMDWMKvdIRGsqy6MwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"119f0d3eca15c1ad612d921682fbba613814ee8938bc0dbe4c8391ae8f40e78c","last_reissued_at":"2026-07-05T09:57:41.574503Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:41.574503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Validating Large-Scale Quantum Machine Learning: Efficient Simulation of Quantum Support Vector Machines Using Tensor Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.SE"],"primary_cat":"quant-ph","authors_text":"An-Cheng Yang, Chun-Chieh Wang, Chun-Yu Lin, Kuan-Cheng Chen, Nan-Yow Chen, Robert Wille, Simon See, Tai-Yue Li, Yun-Yuan Wang","submitted_at":"2024-05-04T10:37:01Z","abstract_excerpt":"We present an efficient tensor-network-based approach for simulating large-scale quantum circuits, demonstrated using Quantum Support Vector Machines (QSVMs). Our method effectively reduces exponential runtime growth to near-quadratic scaling with respect to the number of qubits in practical scenarios. Traditional state-vector simulations become computationally infeasible beyond approximately 50 qubits; in contrast, our simulator successfully handles QSVMs with up to 784 qubits, completing simulations within seconds on a single high-performance GPU. Furthermore, by employing the Message Passin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.02630","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/2405.02630/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":"2405.02630","created_at":"2026-07-05T09:57:41.574560+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.02630v3","created_at":"2026-07-05T09:57:41.574560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.02630","created_at":"2026-07-05T09:57:41.574560+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGPQ2PWKCXA2","created_at":"2026-07-05T09:57:41.574560+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGPQ2PWKCXA22YJN","created_at":"2026-07-05T09:57:41.574560+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGPQ2PWK","created_at":"2026-07-05T09:57:41.574560+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.03092","citing_title":"STABSim: A Parallelized Clifford Simulator with Features Beyond Direct Simulation","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CGPQ2PWKCXA22YJNSILIF652ME","json":"https://pith.science/pith/CGPQ2PWKCXA22YJNSILIF652ME.json","graph_json":"https://pith.science/api/pith-number/CGPQ2PWKCXA22YJNSILIF652ME/graph.json","events_json":"https://pith.science/api/pith-number/CGPQ2PWKCXA22YJNSILIF652ME/events.json","paper":"https://pith.science/paper/CGPQ2PWK"},"agent_actions":{"view_html":"https://pith.science/pith/CGPQ2PWKCXA22YJNSILIF652ME","download_json":"https://pith.science/pith/CGPQ2PWKCXA22YJNSILIF652ME.json","view_paper":"https://pith.science/paper/CGPQ2PWK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.02630&json=true","fetch_graph":"https://pith.science/api/pith-number/CGPQ2PWKCXA22YJNSILIF652ME/graph.json","fetch_events":"https://pith.science/api/pith-number/CGPQ2PWKCXA22YJNSILIF652ME/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGPQ2PWKCXA22YJNSILIF652ME/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGPQ2PWKCXA22YJNSILIF652ME/action/storage_attestation","attest_author":"https://pith.science/pith/CGPQ2PWKCXA22YJNSILIF652ME/action/author_attestation","sign_citation":"https://pith.science/pith/CGPQ2PWKCXA22YJNSILIF652ME/action/citation_signature","submit_replication":"https://pith.science/pith/CGPQ2PWKCXA22YJNSILIF652ME/action/replication_record"}},"created_at":"2026-07-05T09:57:41.574560+00:00","updated_at":"2026-07-05T09:57:41.574560+00:00"}