{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ISHYOHKHLV7JVLBGYKM6WOZ5AV","short_pith_number":"pith:ISHYOHKH","schema_version":"1.0","canonical_sha256":"448f871d475d7e9aac26c299eb3b3d0570fd64642951eda75eea57b4314ba8a7","source":{"kind":"arxiv","id":"1707.09524","version":5},"attestation_state":"computed","paper":{"title":"An improved quantum algorithm for ridge regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chao-Hua Yu, Fei Gao, Qiao-Yan Wen","submitted_at":"2017-07-29T15:09:46Z","abstract_excerpt":"Ridge regression (RR) is an important machine learning technique which introduces a regularization hyperparameter $\\alpha$ to ordinary multiple linear regression for analyzing data suffering from multicollinearity. In this paper, we present a quantum algorithm for RR, where the technique of parallel Hamiltonian simulation to simulate a number of Hermitian matrices in parallel is proposed and used to develop a quantum version of $K$-fold cross-validation approach, which can efficiently estimate the predictive performance of RR. Our algorithm consists of two phases: (1) using quantum $K$-fold cr"},"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":"1707.09524","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-07-29T15:09:46Z","cross_cats_sorted":[],"title_canon_sha256":"fc0cd01b243a32522ca9d8290490e96d821caba39c88da3504d908f219c31931","abstract_canon_sha256":"050202f5ab1a7ecb61bf479244323ca8cc548293c2c618db62caa0bdefed2d5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:02:04.714719Z","signature_b64":"yvwT1WsLV4F9fKeRmWeo2K3ieL5QFGS0pvkAmfqRXk63o8EbkzPo/RC14we5v/ZScSglc8vjr+3QX3ammyWSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"448f871d475d7e9aac26c299eb3b3d0570fd64642951eda75eea57b4314ba8a7","last_reissued_at":"2026-07-05T03:02:04.714239Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:02:04.714239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An improved quantum algorithm for ridge regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chao-Hua Yu, Fei Gao, Qiao-Yan Wen","submitted_at":"2017-07-29T15:09:46Z","abstract_excerpt":"Ridge regression (RR) is an important machine learning technique which introduces a regularization hyperparameter $\\alpha$ to ordinary multiple linear regression for analyzing data suffering from multicollinearity. In this paper, we present a quantum algorithm for RR, where the technique of parallel Hamiltonian simulation to simulate a number of Hermitian matrices in parallel is proposed and used to develop a quantum version of $K$-fold cross-validation approach, which can efficiently estimate the predictive performance of RR. Our algorithm consists of two phases: (1) using quantum $K$-fold cr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09524","kind":"arxiv","version":5},"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/1707.09524/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":"1707.09524","created_at":"2026-07-05T03:02:04.714298+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.09524v5","created_at":"2026-07-05T03:02:04.714298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09524","created_at":"2026-07-05T03:02:04.714298+00:00"},{"alias_kind":"pith_short_12","alias_value":"ISHYOHKHLV7J","created_at":"2026-07-05T03:02:04.714298+00:00"},{"alias_kind":"pith_short_16","alias_value":"ISHYOHKHLV7JVLBG","created_at":"2026-07-05T03:02:04.714298+00:00"},{"alias_kind":"pith_short_8","alias_value":"ISHYOHKH","created_at":"2026-07-05T03:02:04.714298+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1907.06949","citing_title":"Quantum Data Fitting Algorithm for Non-sparse Matrices","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ISHYOHKHLV7JVLBGYKM6WOZ5AV","json":"https://pith.science/pith/ISHYOHKHLV7JVLBGYKM6WOZ5AV.json","graph_json":"https://pith.science/api/pith-number/ISHYOHKHLV7JVLBGYKM6WOZ5AV/graph.json","events_json":"https://pith.science/api/pith-number/ISHYOHKHLV7JVLBGYKM6WOZ5AV/events.json","paper":"https://pith.science/paper/ISHYOHKH"},"agent_actions":{"view_html":"https://pith.science/pith/ISHYOHKHLV7JVLBGYKM6WOZ5AV","download_json":"https://pith.science/pith/ISHYOHKHLV7JVLBGYKM6WOZ5AV.json","view_paper":"https://pith.science/paper/ISHYOHKH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.09524&json=true","fetch_graph":"https://pith.science/api/pith-number/ISHYOHKHLV7JVLBGYKM6WOZ5AV/graph.json","fetch_events":"https://pith.science/api/pith-number/ISHYOHKHLV7JVLBGYKM6WOZ5AV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ISHYOHKHLV7JVLBGYKM6WOZ5AV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ISHYOHKHLV7JVLBGYKM6WOZ5AV/action/storage_attestation","attest_author":"https://pith.science/pith/ISHYOHKHLV7JVLBGYKM6WOZ5AV/action/author_attestation","sign_citation":"https://pith.science/pith/ISHYOHKHLV7JVLBGYKM6WOZ5AV/action/citation_signature","submit_replication":"https://pith.science/pith/ISHYOHKHLV7JVLBGYKM6WOZ5AV/action/replication_record"}},"created_at":"2026-07-05T03:02:04.714298+00:00","updated_at":"2026-07-05T03:02:04.714298+00:00"}