{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:S44OSIXLZQ6Y5DU2SVDVTDLPMR","short_pith_number":"pith:S44OSIXL","schema_version":"1.0","canonical_sha256":"9738e922ebcc3d8e8e9a9547598d6f6456f9213c43e8e5b36c1eff2bda476734","source":{"kind":"arxiv","id":"1807.07820","version":2},"attestation_state":"computed","paper":{"title":"Quantum Arnoldi and conjugate gradient iteration algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Changpeng Shao","submitted_at":"2018-07-20T12:59:03Z","abstract_excerpt":"Arnoldi method and conjugate gradient method are important classical iteration methods in solving linear systems and estimating eigenvalues. Their efficiency often affected by the high dimension of the space, where quantum computer can play a role in. In this work, we establish their corresponding quantum algorithms. To achieve high efficiency, a new method about linear combination of quantum states will be proposed. The final complexity of quantum Arnoldi iteration method is $O(m^{3+\\log (m/\\epsilon)}(\\log n)^2 /\\epsilon^4)$ and the final complexity of quantum conjugate gradient iteration met"},"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":"1807.07820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-07-20T12:59:03Z","cross_cats_sorted":[],"title_canon_sha256":"d839811c00b2f60dc8ac8769588c101b044b50d5bb80be56dcd966f80618a479","abstract_canon_sha256":"f0ae5e8d88ded5e36b8c6706a6605ca9b6aeaa7e8ebbaf9e0a8f68c4fb1a6c8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:14.397778Z","signature_b64":"z9GD6ozuCC5yRX5nMUhZjt3J1DKmm310jgo8CRZBmgJN+h1ElZ71FqFrIsR4kGRO1dUDLDxS+aJoVcHRdPqTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9738e922ebcc3d8e8e9a9547598d6f6456f9213c43e8e5b36c1eff2bda476734","last_reissued_at":"2026-05-18T00:08:14.397366Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:14.397366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Arnoldi and conjugate gradient iteration algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Changpeng Shao","submitted_at":"2018-07-20T12:59:03Z","abstract_excerpt":"Arnoldi method and conjugate gradient method are important classical iteration methods in solving linear systems and estimating eigenvalues. Their efficiency often affected by the high dimension of the space, where quantum computer can play a role in. In this work, we establish their corresponding quantum algorithms. To achieve high efficiency, a new method about linear combination of quantum states will be proposed. The final complexity of quantum Arnoldi iteration method is $O(m^{3+\\log (m/\\epsilon)}(\\log n)^2 /\\epsilon^4)$ and the final complexity of quantum conjugate gradient iteration met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07820","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":"1807.07820","created_at":"2026-05-18T00:08:14.397436+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07820v2","created_at":"2026-05-18T00:08:14.397436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07820","created_at":"2026-05-18T00:08:14.397436+00:00"},{"alias_kind":"pith_short_12","alias_value":"S44OSIXLZQ6Y","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"S44OSIXLZQ6Y5DU2","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"S44OSIXL","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S44OSIXLZQ6Y5DU2SVDVTDLPMR","json":"https://pith.science/pith/S44OSIXLZQ6Y5DU2SVDVTDLPMR.json","graph_json":"https://pith.science/api/pith-number/S44OSIXLZQ6Y5DU2SVDVTDLPMR/graph.json","events_json":"https://pith.science/api/pith-number/S44OSIXLZQ6Y5DU2SVDVTDLPMR/events.json","paper":"https://pith.science/paper/S44OSIXL"},"agent_actions":{"view_html":"https://pith.science/pith/S44OSIXLZQ6Y5DU2SVDVTDLPMR","download_json":"https://pith.science/pith/S44OSIXLZQ6Y5DU2SVDVTDLPMR.json","view_paper":"https://pith.science/paper/S44OSIXL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07820&json=true","fetch_graph":"https://pith.science/api/pith-number/S44OSIXLZQ6Y5DU2SVDVTDLPMR/graph.json","fetch_events":"https://pith.science/api/pith-number/S44OSIXLZQ6Y5DU2SVDVTDLPMR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S44OSIXLZQ6Y5DU2SVDVTDLPMR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S44OSIXLZQ6Y5DU2SVDVTDLPMR/action/storage_attestation","attest_author":"https://pith.science/pith/S44OSIXLZQ6Y5DU2SVDVTDLPMR/action/author_attestation","sign_citation":"https://pith.science/pith/S44OSIXLZQ6Y5DU2SVDVTDLPMR/action/citation_signature","submit_replication":"https://pith.science/pith/S44OSIXLZQ6Y5DU2SVDVTDLPMR/action/replication_record"}},"created_at":"2026-05-18T00:08:14.397436+00:00","updated_at":"2026-05-18T00:08:14.397436+00:00"}