{"paper":{"title":"The Practicality of Randomized Quantum Linear Systems Solvers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daan Camps, Katherine Klymko, Roel Van Beeumen, Siddharth Hariprakash","submitted_at":"2025-10-15T17:12:55Z","abstract_excerpt":"Randomized quantum algorithms have been proposed for quantum linear algebra with the goal of constructing shallower circuits than methods based on block encodings, and have been speculated to offer benefits in the early fault-tolerant era. In this work, we derive explicit, non-asymptotic error bounds on every algorithmic parameter of a randomized quantum linear systems solver that combines sampling from a Fourier series with Hamiltonian simulation, and confirm these bounds numerically. We show that even a $4 \\times 4$ instance with condition number $\\kappa = 100$ requires on the order of $10^{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.13766","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/2510.13766/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"}