{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:3LJ3O5BW4FNIDIFNELRIODIDDD","short_pith_number":"pith:3LJ3O5BW","schema_version":"1.0","canonical_sha256":"dad3b77436e15a81a0ad22e2870d0318ceb8890e5a3263ac10e41e25beb1bbb3","source":{"kind":"arxiv","id":"2103.10309","version":2},"attestation_state":"computed","paper":{"title":"Faster quantum-inspired algorithms for solving linear systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Ashley Montanaro, Changpeng Shao","submitted_at":"2021-03-18T15:12:44Z","abstract_excerpt":"We establish an improved classical algorithm for solving linear systems in a model analogous to the QRAM that is used by quantum linear solvers. Precisely, for the linear system $A\\x = \\b$, we show that there is a classical algorithm that outputs a data structure for $\\x$ allowing sampling and querying to the entries, where $\\x$ is such that $\\|\\x - A^{+}\\b\\|\\leq \\epsilon \\|A^{+}\\b\\|$. This output can be viewed as a classical analogue to the output of quantum linear solvers. The complexity of our algorithm is $\\widetilde{O}(\\kappa_F^4 \\kappa^2/\\epsilon^2 )$, where $\\kappa_F = \\|A\\|_F\\|A^{+}\\|$"},"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":"2103.10309","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-03-18T15:12:44Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"7c13dbbce50729413acc809f6c15852161290a5c2fd1a4a2a02b698a9b10bd63","abstract_canon_sha256":"72ab8d97d5ba9218dbb63fa95b7be01103bb4fcebe0303066136ac4b17eea2b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:01:08.873840Z","signature_b64":"pNQaJPbPsyFdx02ANq81l2Ij3nJ6j5yIFivWCxEp3hkMmXqi8MH6lgrwO81YJUUjskFNS7DmjYwwi1FNizGSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dad3b77436e15a81a0ad22e2870d0318ceb8890e5a3263ac10e41e25beb1bbb3","last_reissued_at":"2026-07-05T06:01:08.873361Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:01:08.873361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster quantum-inspired algorithms for solving linear systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Ashley Montanaro, Changpeng Shao","submitted_at":"2021-03-18T15:12:44Z","abstract_excerpt":"We establish an improved classical algorithm for solving linear systems in a model analogous to the QRAM that is used by quantum linear solvers. Precisely, for the linear system $A\\x = \\b$, we show that there is a classical algorithm that outputs a data structure for $\\x$ allowing sampling and querying to the entries, where $\\x$ is such that $\\|\\x - A^{+}\\b\\|\\leq \\epsilon \\|A^{+}\\b\\|$. This output can be viewed as a classical analogue to the output of quantum linear solvers. The complexity of our algorithm is $\\widetilde{O}(\\kappa_F^4 \\kappa^2/\\epsilon^2 )$, where $\\kappa_F = \\|A\\|_F\\|A^{+}\\|$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.10309","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/2103.10309/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":"2103.10309","created_at":"2026-07-05T06:01:08.873426+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.10309v2","created_at":"2026-07-05T06:01:08.873426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.10309","created_at":"2026-07-05T06:01:08.873426+00:00"},{"alias_kind":"pith_short_12","alias_value":"3LJ3O5BW4FNI","created_at":"2026-07-05T06:01:08.873426+00:00"},{"alias_kind":"pith_short_16","alias_value":"3LJ3O5BW4FNIDIFN","created_at":"2026-07-05T06:01:08.873426+00:00"},{"alias_kind":"pith_short_8","alias_value":"3LJ3O5BW","created_at":"2026-07-05T06:01:08.873426+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22502","citing_title":"Assessing Quantum Advantage for Gaussian Process Regression","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3LJ3O5BW4FNIDIFNELRIODIDDD","json":"https://pith.science/pith/3LJ3O5BW4FNIDIFNELRIODIDDD.json","graph_json":"https://pith.science/api/pith-number/3LJ3O5BW4FNIDIFNELRIODIDDD/graph.json","events_json":"https://pith.science/api/pith-number/3LJ3O5BW4FNIDIFNELRIODIDDD/events.json","paper":"https://pith.science/paper/3LJ3O5BW"},"agent_actions":{"view_html":"https://pith.science/pith/3LJ3O5BW4FNIDIFNELRIODIDDD","download_json":"https://pith.science/pith/3LJ3O5BW4FNIDIFNELRIODIDDD.json","view_paper":"https://pith.science/paper/3LJ3O5BW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.10309&json=true","fetch_graph":"https://pith.science/api/pith-number/3LJ3O5BW4FNIDIFNELRIODIDDD/graph.json","fetch_events":"https://pith.science/api/pith-number/3LJ3O5BW4FNIDIFNELRIODIDDD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3LJ3O5BW4FNIDIFNELRIODIDDD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3LJ3O5BW4FNIDIFNELRIODIDDD/action/storage_attestation","attest_author":"https://pith.science/pith/3LJ3O5BW4FNIDIFNELRIODIDDD/action/author_attestation","sign_citation":"https://pith.science/pith/3LJ3O5BW4FNIDIFNELRIODIDDD/action/citation_signature","submit_replication":"https://pith.science/pith/3LJ3O5BW4FNIDIFNELRIODIDDD/action/replication_record"}},"created_at":"2026-07-05T06:01:08.873426+00:00","updated_at":"2026-07-05T06:01:08.873426+00:00"}