{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2U2ZWJ2RI5AIFCTLRUDLVFYOV4","short_pith_number":"pith:2U2ZWJ2R","schema_version":"1.0","canonical_sha256":"d5359b27514740828a6b8d06ba970eaf35a93712f860a6cb6e7d3cf0a43bcab5","source":{"kind":"arxiv","id":"1910.14596","version":4},"attestation_state":"computed","paper":{"title":"Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Lin Lin, Yu Tong","submitted_at":"2019-10-31T16:49:53Z","abstract_excerpt":"We present a quantum eigenstate filtering algorithm based on quantum signal processing (QSP) and minimax polynomials. The algorithm allows us to efficiently prepare a target eigenstate of a given Hamiltonian, if we have access to an initial state with non-trivial overlap with the target eigenstate and have a reasonable lower bound for the spectral gap. We apply this algorithm to the quantum linear system problem (QLSP), and present two algorithms based on quantum adiabatic computing (AQC) and quantum Zeno effect respectively. Both algorithms prepare the final solution as a pure state, and achi"},"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":"1910.14596","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2019-10-31T16:49:53Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"176497dc1e5e0e4c5bdb602aa9b6c8ab44e0f551ff6cfeb9ccf0c7ea872c3636","abstract_canon_sha256":"201c7f7e3f34f2b43bdd1ebcdf5dc56aab6c67f3d97feb8887789338666fad98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:50:57.316467Z","signature_b64":"G8OcNEneNsbGMYTk3eMIK29jCVXtIWhXoaFxy2vYB04XCBcD1eqPhCjwAgSfNm9yC1VmQV1aYnszx0CFa3+VDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5359b27514740828a6b8d06ba970eaf35a93712f860a6cb6e7d3cf0a43bcab5","last_reissued_at":"2026-07-05T01:50:57.316003Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:50:57.316003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Lin Lin, Yu Tong","submitted_at":"2019-10-31T16:49:53Z","abstract_excerpt":"We present a quantum eigenstate filtering algorithm based on quantum signal processing (QSP) and minimax polynomials. The algorithm allows us to efficiently prepare a target eigenstate of a given Hamiltonian, if we have access to an initial state with non-trivial overlap with the target eigenstate and have a reasonable lower bound for the spectral gap. We apply this algorithm to the quantum linear system problem (QLSP), and present two algorithms based on quantum adiabatic computing (AQC) and quantum Zeno effect respectively. Both algorithms prepare the final solution as a pure state, and achi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.14596","kind":"arxiv","version":4},"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/1910.14596/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":"1910.14596","created_at":"2026-07-05T01:50:57.316065+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.14596v4","created_at":"2026-07-05T01:50:57.316065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.14596","created_at":"2026-07-05T01:50:57.316065+00:00"},{"alias_kind":"pith_short_12","alias_value":"2U2ZWJ2RI5AI","created_at":"2026-07-05T01:50:57.316065+00:00"},{"alias_kind":"pith_short_16","alias_value":"2U2ZWJ2RI5AIFCTL","created_at":"2026-07-05T01:50:57.316065+00:00"},{"alias_kind":"pith_short_8","alias_value":"2U2ZWJ2R","created_at":"2026-07-05T01:50:57.316065+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":9,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2607.07691","citing_title":"Faster quantum linear system solver beyond the condition number","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2604.20512","citing_title":"Nonisothermal global-pressure exactness in fractured multiphase flow with aperture feedback","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2606.12770","citing_title":"Explicit Quantum Circuit Simulation of Nonlinear 1-Dimensional Fluid with Carleman-linearized Boltzmann Method","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2404.18502","citing_title":"Towards Classical Software Verification using Quantum Computers","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2406.12086","citing_title":"A shortcut to an optimal quantum linear system solver","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24896","citing_title":"Tightening energy-based boson truncation bound using Monte Carlo-assisted methods","ref_index":171,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24896","citing_title":"Tightening energy-based boson truncation bound using Monte Carlo-assisted methods","ref_index":171,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24896","citing_title":"Tightening energy-based boson truncation bound using Monte Carlo-assisted methods","ref_index":171,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20513","citing_title":"Constrained Optimal Polynomials for Quantum Linear System Solvers","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2U2ZWJ2RI5AIFCTLRUDLVFYOV4","json":"https://pith.science/pith/2U2ZWJ2RI5AIFCTLRUDLVFYOV4.json","graph_json":"https://pith.science/api/pith-number/2U2ZWJ2RI5AIFCTLRUDLVFYOV4/graph.json","events_json":"https://pith.science/api/pith-number/2U2ZWJ2RI5AIFCTLRUDLVFYOV4/events.json","paper":"https://pith.science/paper/2U2ZWJ2R"},"agent_actions":{"view_html":"https://pith.science/pith/2U2ZWJ2RI5AIFCTLRUDLVFYOV4","download_json":"https://pith.science/pith/2U2ZWJ2RI5AIFCTLRUDLVFYOV4.json","view_paper":"https://pith.science/paper/2U2ZWJ2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.14596&json=true","fetch_graph":"https://pith.science/api/pith-number/2U2ZWJ2RI5AIFCTLRUDLVFYOV4/graph.json","fetch_events":"https://pith.science/api/pith-number/2U2ZWJ2RI5AIFCTLRUDLVFYOV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2U2ZWJ2RI5AIFCTLRUDLVFYOV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2U2ZWJ2RI5AIFCTLRUDLVFYOV4/action/storage_attestation","attest_author":"https://pith.science/pith/2U2ZWJ2RI5AIFCTLRUDLVFYOV4/action/author_attestation","sign_citation":"https://pith.science/pith/2U2ZWJ2RI5AIFCTLRUDLVFYOV4/action/citation_signature","submit_replication":"https://pith.science/pith/2U2ZWJ2RI5AIFCTLRUDLVFYOV4/action/replication_record"}},"created_at":"2026-07-05T01:50:57.316065+00:00","updated_at":"2026-07-05T01:50:57.316065+00:00"}