{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XQYPDIEFBMK4FJU6DKA2ZUSLAU","short_pith_number":"pith:XQYPDIEF","schema_version":"1.0","canonical_sha256":"bc30f1a0850b15c2a69e1a81acd24b050aba23fd77340ee835e2ede4c87dd2fd","source":{"kind":"arxiv","id":"1909.07344","version":2},"attestation_state":"computed","paper":{"title":"Near-term quantum algorithms for linear systems of equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Hsin-Yuan Huang, Kishor Bharti, Patrick Rebentrost","submitted_at":"2019-09-16T17:23:52Z","abstract_excerpt":"Solving linear systems of equations is essential for many problems in science and technology, including problems in machine learning. Existing quantum algorithms have demonstrated the potential for large speedups, but the required quantum resources are not immediately available on near-term quantum devices. In this work, we study near-term quantum algorithms for linear systems of equations of the form $Ax = b$. We investigate the use of variational algorithms and analyze their optimization landscapes. There exist types of linear systems for which variational algorithms designed to avoid barren"},"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":"1909.07344","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-09-16T17:23:52Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"da03833f5e612c5ee4502b21711d4f78c43e3f2447fb53600df3e3e854833c70","abstract_canon_sha256":"9dcdb3e03fbf44e19d330164185b00f14d8bbb0da44340124ce95ea3ed6ff357"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:26:10.318524Z","signature_b64":"5M/+XlQqpPzxBxLuDkjjVDk0CZ4cd1aN7MGxGQ+z7XU3maoGXEQayn9ZBcqjzbor+Qpwz7bpIaYcgVLSkHzLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc30f1a0850b15c2a69e1a81acd24b050aba23fd77340ee835e2ede4c87dd2fd","last_reissued_at":"2026-07-05T00:26:10.318041Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:26:10.318041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-term quantum algorithms for linear systems of equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Hsin-Yuan Huang, Kishor Bharti, Patrick Rebentrost","submitted_at":"2019-09-16T17:23:52Z","abstract_excerpt":"Solving linear systems of equations is essential for many problems in science and technology, including problems in machine learning. Existing quantum algorithms have demonstrated the potential for large speedups, but the required quantum resources are not immediately available on near-term quantum devices. In this work, we study near-term quantum algorithms for linear systems of equations of the form $Ax = b$. We investigate the use of variational algorithms and analyze their optimization landscapes. There exist types of linear systems for which variational algorithms designed to avoid barren"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.07344","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/1909.07344/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":"1909.07344","created_at":"2026-07-05T00:26:10.318111+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.07344v2","created_at":"2026-07-05T00:26:10.318111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.07344","created_at":"2026-07-05T00:26:10.318111+00:00"},{"alias_kind":"pith_short_12","alias_value":"XQYPDIEFBMK4","created_at":"2026-07-05T00:26:10.318111+00:00"},{"alias_kind":"pith_short_16","alias_value":"XQYPDIEFBMK4FJU6","created_at":"2026-07-05T00:26:10.318111+00:00"},{"alias_kind":"pith_short_8","alias_value":"XQYPDIEF","created_at":"2026-07-05T00:26:10.318111+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2310.04255","citing_title":"From barren plateaus through fertile valleys: Conic extensions of parameterised quantum circuits","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2312.04023","citing_title":"A hybrid quantum-classical algorithm for Bayes-optimal quantum state discrimination using the source code","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00794","citing_title":"Quantum Simulation of Differential-Algebraic Equations with Applications to Unsteady Stokes Flow","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15813","citing_title":"Bias Analysis and Regularization of Sequential Minimal Optimization in Variational Quantum Eigensolvers","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00794","citing_title":"Quantum Simulation of Differential-Algebraic Equations with Applications to Unsteady Stokes Flow","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07909","citing_title":"A Review of Variational Quantum Algorithms: Insights into Fault-Tolerant Quantum Computing","ref_index":184,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XQYPDIEFBMK4FJU6DKA2ZUSLAU","json":"https://pith.science/pith/XQYPDIEFBMK4FJU6DKA2ZUSLAU.json","graph_json":"https://pith.science/api/pith-number/XQYPDIEFBMK4FJU6DKA2ZUSLAU/graph.json","events_json":"https://pith.science/api/pith-number/XQYPDIEFBMK4FJU6DKA2ZUSLAU/events.json","paper":"https://pith.science/paper/XQYPDIEF"},"agent_actions":{"view_html":"https://pith.science/pith/XQYPDIEFBMK4FJU6DKA2ZUSLAU","download_json":"https://pith.science/pith/XQYPDIEFBMK4FJU6DKA2ZUSLAU.json","view_paper":"https://pith.science/paper/XQYPDIEF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.07344&json=true","fetch_graph":"https://pith.science/api/pith-number/XQYPDIEFBMK4FJU6DKA2ZUSLAU/graph.json","fetch_events":"https://pith.science/api/pith-number/XQYPDIEFBMK4FJU6DKA2ZUSLAU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XQYPDIEFBMK4FJU6DKA2ZUSLAU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XQYPDIEFBMK4FJU6DKA2ZUSLAU/action/storage_attestation","attest_author":"https://pith.science/pith/XQYPDIEFBMK4FJU6DKA2ZUSLAU/action/author_attestation","sign_citation":"https://pith.science/pith/XQYPDIEFBMK4FJU6DKA2ZUSLAU/action/citation_signature","submit_replication":"https://pith.science/pith/XQYPDIEFBMK4FJU6DKA2ZUSLAU/action/replication_record"}},"created_at":"2026-07-05T00:26:10.318111+00:00","updated_at":"2026-07-05T00:26:10.318111+00:00"}