{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MRKQLPG2SRFVLPQEYQ5WRSRPOD","short_pith_number":"pith:MRKQLPG2","schema_version":"1.0","canonical_sha256":"645505bcda944b55be04c43b68ca2f70dbbebbe70a3231ea47e07ab2dcd73bf7","source":{"kind":"arxiv","id":"1511.02306","version":2},"attestation_state":"computed","paper":{"title":"Quantum algorithm for systems of linear equations with exponentially improved dependence on precision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Robin Kothari, Rolando D. Somma","submitted_at":"2015-11-07T05:42:01Z","abstract_excerpt":"Harrow, Hassidim, and Lloyd showed that for a suitably specified $N \\times N$ matrix $A$ and $N$-dimensional vector $\\vec{b}$, there is a quantum algorithm that outputs a quantum state proportional to the solution of the linear system of equations $A\\vec{x}=\\vec{b}$. If $A$ is sparse and well-conditioned, their algorithm runs in time $\\mathrm{poly}(\\log N, 1/\\epsilon)$, where $\\epsilon$ is the desired precision in the output state. We improve this to an algorithm whose running time is polynomial in $\\log(1/\\epsilon)$, exponentially improving the dependence on precision while keeping essentiall"},"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":"1511.02306","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-11-07T05:42:01Z","cross_cats_sorted":[],"title_canon_sha256":"a75f647f5a8f2fa13471de85f0fe611f6219cd17bd63d456c51a599a7c3b4138","abstract_canon_sha256":"07797a0c4fb68ed2b903ca800a0fb4c40650f3dade2411d3068ffbaacf26069b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:22.517203Z","signature_b64":"vEOAODCYpTXOoDJoe0+pM3MOQnUkGAgalVsQjJtc9dNrwGg8ooTaNzgRvq3hc1dxQ4BXn4NLE7kdbtqfXd24CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"645505bcda944b55be04c43b68ca2f70dbbebbe70a3231ea47e07ab2dcd73bf7","last_reissued_at":"2026-05-18T00:27:22.516683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:22.516683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum algorithm for systems of linear equations with exponentially improved dependence on precision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Robin Kothari, Rolando D. Somma","submitted_at":"2015-11-07T05:42:01Z","abstract_excerpt":"Harrow, Hassidim, and Lloyd showed that for a suitably specified $N \\times N$ matrix $A$ and $N$-dimensional vector $\\vec{b}$, there is a quantum algorithm that outputs a quantum state proportional to the solution of the linear system of equations $A\\vec{x}=\\vec{b}$. If $A$ is sparse and well-conditioned, their algorithm runs in time $\\mathrm{poly}(\\log N, 1/\\epsilon)$, where $\\epsilon$ is the desired precision in the output state. We improve this to an algorithm whose running time is polynomial in $\\log(1/\\epsilon)$, exponentially improving the dependence on precision while keeping essentiall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02306","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":""},"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":"1511.02306","created_at":"2026-05-18T00:27:22.516765+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02306v2","created_at":"2026-05-18T00:27:22.516765+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02306","created_at":"2026-05-18T00:27:22.516765+00:00"},{"alias_kind":"pith_short_12","alias_value":"MRKQLPG2SRFV","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MRKQLPG2SRFVLPQE","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MRKQLPG2","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":15,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.16195","citing_title":"Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems","ref_index":91,"is_internal_anchor":true},{"citing_arxiv_id":"2507.04253","citing_title":"Optimizing Quantum Chemistry Simulations with a Hybrid Quantization Scheme","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2511.01736","citing_title":"Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2511.10267","citing_title":"Quantum Simulation of Non-Hermitian Special Functions and Dynamics via Contour-based Matrix Decomposition","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13979","citing_title":"Winning Lottery Tickets in Neural Networks via a Quantum-Inspired Classical Algorithm","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2604.02874","citing_title":"A Unified Poisson Summation Framework for Generalized Quantum Matrix Transformations","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00302","citing_title":"Quantum Data Loading for Carleman Linearized Systems: Application to the Lattice-Boltzmann Equation","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04861","citing_title":"Quantum algorithm for solving differential equations using SLAC derivatives","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20513","citing_title":"Constrained Optimal Polynomials for Quantum Linear System Solvers","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18276","citing_title":"Block-encodings as programming abstractions: The Eclipse Qrisp BlockEncoding Interface","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00302","citing_title":"Quantum Data Loading for Carleman Linearized Systems: Application to the Lattice-Boltzmann Equation","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03685","citing_title":"Quantum Multi-Level Estimation of Functionals of Discrete Distributions","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24362","citing_title":"Practical lower bounds for hybrid quantum interior point methods in linear programming","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24133","citing_title":"Quantum algorithm for solving high-dimensional linear stochastic differential equations via amplitude encoding of the noise term","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05321","citing_title":"Analytical Angle-Finding and Series Expansions for Quantum Signal Processing via Orthogonal Polynomial Theory","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MRKQLPG2SRFVLPQEYQ5WRSRPOD","json":"https://pith.science/pith/MRKQLPG2SRFVLPQEYQ5WRSRPOD.json","graph_json":"https://pith.science/api/pith-number/MRKQLPG2SRFVLPQEYQ5WRSRPOD/graph.json","events_json":"https://pith.science/api/pith-number/MRKQLPG2SRFVLPQEYQ5WRSRPOD/events.json","paper":"https://pith.science/paper/MRKQLPG2"},"agent_actions":{"view_html":"https://pith.science/pith/MRKQLPG2SRFVLPQEYQ5WRSRPOD","download_json":"https://pith.science/pith/MRKQLPG2SRFVLPQEYQ5WRSRPOD.json","view_paper":"https://pith.science/paper/MRKQLPG2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02306&json=true","fetch_graph":"https://pith.science/api/pith-number/MRKQLPG2SRFVLPQEYQ5WRSRPOD/graph.json","fetch_events":"https://pith.science/api/pith-number/MRKQLPG2SRFVLPQEYQ5WRSRPOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MRKQLPG2SRFVLPQEYQ5WRSRPOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MRKQLPG2SRFVLPQEYQ5WRSRPOD/action/storage_attestation","attest_author":"https://pith.science/pith/MRKQLPG2SRFVLPQEYQ5WRSRPOD/action/author_attestation","sign_citation":"https://pith.science/pith/MRKQLPG2SRFVLPQEYQ5WRSRPOD/action/citation_signature","submit_replication":"https://pith.science/pith/MRKQLPG2SRFVLPQEYQ5WRSRPOD/action/replication_record"}},"created_at":"2026-05-18T00:27:22.516765+00:00","updated_at":"2026-05-18T00:27:22.516765+00:00"}