{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:45QPSB32KQBQUZXQZNKLV4GVBT","short_pith_number":"pith:45QPSB32","schema_version":"1.0","canonical_sha256":"e760f9077a54030a66f0cb54baf0d50cf53b7ff8384f0acacc2faffb867ca561","source":{"kind":"arxiv","id":"2110.13086","version":2},"attestation_state":"computed","paper":{"title":"Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.LG"],"primary_cat":"quant-ph","authors_text":"CWI, CWI), Ronald de Wolf (QuSoft, University of Amsterdam), Yanlin Chen (QuSoft","submitted_at":"2021-10-25T16:26:37Z","abstract_excerpt":"Lasso and Ridge are important minimization problems in machine learning and statistics. They are versions of linear regression with squared loss where the vector $\\theta\\in\\mathbb{R}^d$ of coefficients is constrained in either $\\ell_1$-norm (for Lasso) or in $\\ell_2$-norm (for Ridge). We study the complexity of quantum algorithms for finding $\\varepsilon$-minimizers for these minimization problems. We show that for Lasso we can get a quadratic quantum speedup in terms of $d$ by speeding up the cost-per-iteration of the Frank-Wolfe algorithm, while for Ridge the best quantum algorithms are line"},"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":"2110.13086","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-10-25T16:26:37Z","cross_cats_sorted":["cs.CC","cs.DS","cs.LG"],"title_canon_sha256":"a17707e32f5bbd85770ade492cf706ffb06e63f3b15ccf07b08416a56f6dd06c","abstract_canon_sha256":"ad7c7cff3c9487e1e7faf2aa7270f4b8fb816c1b915953c705f1b99e3b827ca8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:41:26.513051Z","signature_b64":"4Zb3lFUd5OJy2gpI0VtsZ7upYpsYmgRdB1RcnboGp6HjHwBWBELia8qFhdrRoQmnSD35yM0QhMviEXHMOq5HDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e760f9077a54030a66f0cb54baf0d50cf53b7ff8384f0acacc2faffb867ca561","last_reissued_at":"2026-07-05T04:41:26.512712Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:41:26.512712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.LG"],"primary_cat":"quant-ph","authors_text":"CWI, CWI), Ronald de Wolf (QuSoft, University of Amsterdam), Yanlin Chen (QuSoft","submitted_at":"2021-10-25T16:26:37Z","abstract_excerpt":"Lasso and Ridge are important minimization problems in machine learning and statistics. They are versions of linear regression with squared loss where the vector $\\theta\\in\\mathbb{R}^d$ of coefficients is constrained in either $\\ell_1$-norm (for Lasso) or in $\\ell_2$-norm (for Ridge). We study the complexity of quantum algorithms for finding $\\varepsilon$-minimizers for these minimization problems. We show that for Lasso we can get a quadratic quantum speedup in terms of $d$ by speeding up the cost-per-iteration of the Frank-Wolfe algorithm, while for Ridge the best quantum algorithms are line"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.13086","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/2110.13086/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":"2110.13086","created_at":"2026-07-05T04:41:26.512765+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.13086v2","created_at":"2026-07-05T04:41:26.512765+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.13086","created_at":"2026-07-05T04:41:26.512765+00:00"},{"alias_kind":"pith_short_12","alias_value":"45QPSB32KQBQ","created_at":"2026-07-05T04:41:26.512765+00:00"},{"alias_kind":"pith_short_16","alias_value":"45QPSB32KQBQUZXQ","created_at":"2026-07-05T04:41:26.512765+00:00"},{"alias_kind":"pith_short_8","alias_value":"45QPSB32","created_at":"2026-07-05T04:41:26.512765+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.21369","citing_title":"Quantum Learning with Tunable Loss Functions","ref_index":59,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/45QPSB32KQBQUZXQZNKLV4GVBT","json":"https://pith.science/pith/45QPSB32KQBQUZXQZNKLV4GVBT.json","graph_json":"https://pith.science/api/pith-number/45QPSB32KQBQUZXQZNKLV4GVBT/graph.json","events_json":"https://pith.science/api/pith-number/45QPSB32KQBQUZXQZNKLV4GVBT/events.json","paper":"https://pith.science/paper/45QPSB32"},"agent_actions":{"view_html":"https://pith.science/pith/45QPSB32KQBQUZXQZNKLV4GVBT","download_json":"https://pith.science/pith/45QPSB32KQBQUZXQZNKLV4GVBT.json","view_paper":"https://pith.science/paper/45QPSB32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.13086&json=true","fetch_graph":"https://pith.science/api/pith-number/45QPSB32KQBQUZXQZNKLV4GVBT/graph.json","fetch_events":"https://pith.science/api/pith-number/45QPSB32KQBQUZXQZNKLV4GVBT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/45QPSB32KQBQUZXQZNKLV4GVBT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/45QPSB32KQBQUZXQZNKLV4GVBT/action/storage_attestation","attest_author":"https://pith.science/pith/45QPSB32KQBQUZXQZNKLV4GVBT/action/author_attestation","sign_citation":"https://pith.science/pith/45QPSB32KQBQUZXQZNKLV4GVBT/action/citation_signature","submit_replication":"https://pith.science/pith/45QPSB32KQBQUZXQZNKLV4GVBT/action/replication_record"}},"created_at":"2026-07-05T04:41:26.512765+00:00","updated_at":"2026-07-05T04:41:26.512765+00:00"}