{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:OS2MSZ5DF7EOCORCDYXTB26NTY","short_pith_number":"pith:OS2MSZ5D","schema_version":"1.0","canonical_sha256":"74b4c967a32fc8e13a221e2f30ebcd9e18d3121c1f16b99584da1fdce2afb1fe","source":{"kind":"arxiv","id":"2311.14823","version":1},"attestation_state":"computed","paper":{"title":"Revisiting Quantum Algorithms for Linear Regressions: Quadratic Speedups without Data-Dependent Parameters","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"quant-ph","authors_text":"Junze Yin, Ruizhe Zhang, Zhao Song","submitted_at":"2023-11-24T19:41:28Z","abstract_excerpt":"Linear regression is one of the most fundamental linear algebra problems. Given a dense matrix $A \\in \\mathbb{R}^{n \\times d}$ and a vector $b$, the goal is to find $x'$ such that\n  $ \\| Ax' - b \\|_2^2 \\leq (1+\\epsilon) \\min_{x} \\| A x - b \\|_2^2 $. The best classical algorithm takes $O(nd) + \\mathrm{poly}(d/\\epsilon)$ time [Clarkson and Woodruff STOC 2013, Nelson and Nguyen FOCS 2013]. On the other hand, quantum linear regression algorithms can achieve exponential quantum speedups, as shown in [Wang Phys. Rev. A 96, 012335, Kerenidis and Prakash ITCS 2017, Chakraborty, Gily{\\'e}n and Jeffery "},"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":"2311.14823","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-11-24T19:41:28Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"b054cd1e17a17333171b60d6a1e6f48d999fa173c550f405271abe06676efeee","abstract_canon_sha256":"2a34bbcf73086b3ba2d76f65d3111843c464ca658c5eb29d31026ce6bc494925"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:16:53.299995Z","signature_b64":"TgTyPacpLtHS3HrhzRvFWyom9atIGe+imrc/3jB6cd9INAFSPFizEWnJMWLh4D5VdlHPdgDNWquZdjk3P0v1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74b4c967a32fc8e13a221e2f30ebcd9e18d3121c1f16b99584da1fdce2afb1fe","last_reissued_at":"2026-07-05T07:16:53.299613Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:16:53.299613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting Quantum Algorithms for Linear Regressions: Quadratic Speedups without Data-Dependent Parameters","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"quant-ph","authors_text":"Junze Yin, Ruizhe Zhang, Zhao Song","submitted_at":"2023-11-24T19:41:28Z","abstract_excerpt":"Linear regression is one of the most fundamental linear algebra problems. Given a dense matrix $A \\in \\mathbb{R}^{n \\times d}$ and a vector $b$, the goal is to find $x'$ such that\n  $ \\| Ax' - b \\|_2^2 \\leq (1+\\epsilon) \\min_{x} \\| A x - b \\|_2^2 $. The best classical algorithm takes $O(nd) + \\mathrm{poly}(d/\\epsilon)$ time [Clarkson and Woodruff STOC 2013, Nelson and Nguyen FOCS 2013]. On the other hand, quantum linear regression algorithms can achieve exponential quantum speedups, as shown in [Wang Phys. Rev. A 96, 012335, Kerenidis and Prakash ITCS 2017, Chakraborty, Gily{\\'e}n and Jeffery "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.14823","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/2311.14823/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":"2311.14823","created_at":"2026-07-05T07:16:53.299667+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.14823v1","created_at":"2026-07-05T07:16:53.299667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.14823","created_at":"2026-07-05T07:16:53.299667+00:00"},{"alias_kind":"pith_short_12","alias_value":"OS2MSZ5DF7EO","created_at":"2026-07-05T07:16:53.299667+00:00"},{"alias_kind":"pith_short_16","alias_value":"OS2MSZ5DF7EOCORC","created_at":"2026-07-05T07:16:53.299667+00:00"},{"alias_kind":"pith_short_8","alias_value":"OS2MSZ5D","created_at":"2026-07-05T07:16:53.299667+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.16284","citing_title":"Only Large Weights (And Not Skip Connections) Can Prevent the Perils of Rank Collapse","ref_index":58,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OS2MSZ5DF7EOCORCDYXTB26NTY","json":"https://pith.science/pith/OS2MSZ5DF7EOCORCDYXTB26NTY.json","graph_json":"https://pith.science/api/pith-number/OS2MSZ5DF7EOCORCDYXTB26NTY/graph.json","events_json":"https://pith.science/api/pith-number/OS2MSZ5DF7EOCORCDYXTB26NTY/events.json","paper":"https://pith.science/paper/OS2MSZ5D"},"agent_actions":{"view_html":"https://pith.science/pith/OS2MSZ5DF7EOCORCDYXTB26NTY","download_json":"https://pith.science/pith/OS2MSZ5DF7EOCORCDYXTB26NTY.json","view_paper":"https://pith.science/paper/OS2MSZ5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.14823&json=true","fetch_graph":"https://pith.science/api/pith-number/OS2MSZ5DF7EOCORCDYXTB26NTY/graph.json","fetch_events":"https://pith.science/api/pith-number/OS2MSZ5DF7EOCORCDYXTB26NTY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OS2MSZ5DF7EOCORCDYXTB26NTY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OS2MSZ5DF7EOCORCDYXTB26NTY/action/storage_attestation","attest_author":"https://pith.science/pith/OS2MSZ5DF7EOCORCDYXTB26NTY/action/author_attestation","sign_citation":"https://pith.science/pith/OS2MSZ5DF7EOCORCDYXTB26NTY/action/citation_signature","submit_replication":"https://pith.science/pith/OS2MSZ5DF7EOCORCDYXTB26NTY/action/replication_record"}},"created_at":"2026-07-05T07:16:53.299667+00:00","updated_at":"2026-07-05T07:16:53.299667+00:00"}