{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:S4ZQRDMQ26MAEUQBTAGGYMLGUH","short_pith_number":"pith:S4ZQRDMQ","schema_version":"1.0","canonical_sha256":"9733088d90d798025201980c6c3166a1c3082292d5cc874bc8e0cf370e59dd7d","source":{"kind":"arxiv","id":"1909.05500","version":3},"attestation_state":"computed","paper":{"title":"Quantum linear system solver based on time-optimal adiabatic quantum computing and quantum approximate optimization algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Dong An, Lin Lin","submitted_at":"2019-09-12T08:22:53Z","abstract_excerpt":"We demonstrate that with an optimally tuned scheduling function, adiabatic quantum computing (AQC) can readily solve a quantum linear system problem (QLSP) with $\\mathcal{O}(\\kappa~\\text{poly}(\\log(\\kappa/\\epsilon)))$ runtime, where $\\kappa$ is the condition number, and $\\epsilon$ is the target accuracy. This is near optimal with respect to both $\\kappa$ and $\\epsilon$. Our method is applicable to general non-Hermitian matrices, and the cost as well as the number of qubits can be reduced when restricted to Hermitian matrices, and further to Hermitian positive definite matrices. The success of "},"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.05500","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-09-12T08:22:53Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"ecac0e33502708248827508a79d4be1a57ac4e15e2e7863a9998b89ba6aff790","abstract_canon_sha256":"5bf59c423d556832019b186489e12278931e67d58d337523e9d8f42f5dbeb3d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:03:08.818784Z","signature_b64":"vlmd3Oto619bFiGowbTb6koxCL35kQUHJIhPxc1+8NwBsRCaMMXOt7/SL2MeeVr9g/0eibMfR8eOSzG4/EfGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9733088d90d798025201980c6c3166a1c3082292d5cc874bc8e0cf370e59dd7d","last_reissued_at":"2026-07-05T04:03:08.818366Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:03:08.818366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum linear system solver based on time-optimal adiabatic quantum computing and quantum approximate optimization algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Dong An, Lin Lin","submitted_at":"2019-09-12T08:22:53Z","abstract_excerpt":"We demonstrate that with an optimally tuned scheduling function, adiabatic quantum computing (AQC) can readily solve a quantum linear system problem (QLSP) with $\\mathcal{O}(\\kappa~\\text{poly}(\\log(\\kappa/\\epsilon)))$ runtime, where $\\kappa$ is the condition number, and $\\epsilon$ is the target accuracy. This is near optimal with respect to both $\\kappa$ and $\\epsilon$. Our method is applicable to general non-Hermitian matrices, and the cost as well as the number of qubits can be reduced when restricted to Hermitian matrices, and further to Hermitian positive definite matrices. The success of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.05500","kind":"arxiv","version":3},"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.05500/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.05500","created_at":"2026-07-05T04:03:08.818424+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.05500v3","created_at":"2026-07-05T04:03:08.818424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.05500","created_at":"2026-07-05T04:03:08.818424+00:00"},{"alias_kind":"pith_short_12","alias_value":"S4ZQRDMQ26MA","created_at":"2026-07-05T04:03:08.818424+00:00"},{"alias_kind":"pith_short_16","alias_value":"S4ZQRDMQ26MAEUQB","created_at":"2026-07-05T04:03:08.818424+00:00"},{"alias_kind":"pith_short_8","alias_value":"S4ZQRDMQ","created_at":"2026-07-05T04:03:08.818424+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07691","citing_title":"Faster quantum linear system solver beyond the condition number","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2604.20512","citing_title":"Nonisothermal global-pressure exactness in fractured multiphase flow with aperture feedback","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2406.12086","citing_title":"A shortcut to an optimal quantum linear system solver","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20513","citing_title":"Constrained Optimal Polynomials for Quantum Linear System Solvers","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S4ZQRDMQ26MAEUQBTAGGYMLGUH","json":"https://pith.science/pith/S4ZQRDMQ26MAEUQBTAGGYMLGUH.json","graph_json":"https://pith.science/api/pith-number/S4ZQRDMQ26MAEUQBTAGGYMLGUH/graph.json","events_json":"https://pith.science/api/pith-number/S4ZQRDMQ26MAEUQBTAGGYMLGUH/events.json","paper":"https://pith.science/paper/S4ZQRDMQ"},"agent_actions":{"view_html":"https://pith.science/pith/S4ZQRDMQ26MAEUQBTAGGYMLGUH","download_json":"https://pith.science/pith/S4ZQRDMQ26MAEUQBTAGGYMLGUH.json","view_paper":"https://pith.science/paper/S4ZQRDMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.05500&json=true","fetch_graph":"https://pith.science/api/pith-number/S4ZQRDMQ26MAEUQBTAGGYMLGUH/graph.json","fetch_events":"https://pith.science/api/pith-number/S4ZQRDMQ26MAEUQBTAGGYMLGUH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S4ZQRDMQ26MAEUQBTAGGYMLGUH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S4ZQRDMQ26MAEUQBTAGGYMLGUH/action/storage_attestation","attest_author":"https://pith.science/pith/S4ZQRDMQ26MAEUQBTAGGYMLGUH/action/author_attestation","sign_citation":"https://pith.science/pith/S4ZQRDMQ26MAEUQBTAGGYMLGUH/action/citation_signature","submit_replication":"https://pith.science/pith/S4ZQRDMQ26MAEUQBTAGGYMLGUH/action/replication_record"}},"created_at":"2026-07-05T04:03:08.818424+00:00","updated_at":"2026-07-05T04:03:08.818424+00:00"}