{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:Z5TOQKWCGQXUVNMC63AF45JXIO","short_pith_number":"pith:Z5TOQKWC","schema_version":"1.0","canonical_sha256":"cf66e82ac2342f4ab582f6c05e753743b6f05c3c016fbef65d048f8d5818a6d7","source":{"kind":"arxiv","id":"2312.14786","version":3},"attestation_state":"computed","paper":{"title":"Improved Quantum Algorithms for Eigenvalues Finding and Gradient Descent","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Nhat A. Nghiem, Tzu-Chieh Wei","submitted_at":"2023-12-22T15:59:03Z","abstract_excerpt":"Block encoding is a key ingredient in the recently developed quantum singular value transformation (QSVT) framework, which provides a unifying description for many quantum algorithms. Initially introduced to simplify and optimize resource utilization in various problems, such as searching, amplitude estimation, and Hamiltonian simulation, it is reasonable to expect that the capabilities of QSVT extend beyond these applications and offer untapped potential for designing new quantum algorithms. In this article, we affirm this perspective by leveraging block encoding to substantially enhance two "},"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":"2312.14786","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"quant-ph","submitted_at":"2023-12-22T15:59:03Z","cross_cats_sorted":[],"title_canon_sha256":"d2d378405b126dae41044854a53c08884535336df4a415195109f302e39e5e67","abstract_canon_sha256":"be70fd7fcc2e8e5d6ba2b0ecc9827851c888d44981a03b96f23496b5b5a3b4b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:41:11.278483Z","signature_b64":"NwBJgVVR7WcGfZ7XZSm/sJZmf7zpXs6cVo/Q69uKw9VBnRIDT13A1KqcV06Rb8aGLCuEF1MpLb4BI1qJPSpJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf66e82ac2342f4ab582f6c05e753743b6f05c3c016fbef65d048f8d5818a6d7","last_reissued_at":"2026-07-05T10:41:11.277827Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:41:11.277827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Quantum Algorithms for Eigenvalues Finding and Gradient Descent","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Nhat A. Nghiem, Tzu-Chieh Wei","submitted_at":"2023-12-22T15:59:03Z","abstract_excerpt":"Block encoding is a key ingredient in the recently developed quantum singular value transformation (QSVT) framework, which provides a unifying description for many quantum algorithms. Initially introduced to simplify and optimize resource utilization in various problems, such as searching, amplitude estimation, and Hamiltonian simulation, it is reasonable to expect that the capabilities of QSVT extend beyond these applications and offer untapped potential for designing new quantum algorithms. In this article, we affirm this perspective by leveraging block encoding to substantially enhance two "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.14786","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/2312.14786/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":"2312.14786","created_at":"2026-07-05T10:41:11.277901+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.14786v3","created_at":"2026-07-05T10:41:11.277901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.14786","created_at":"2026-07-05T10:41:11.277901+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z5TOQKWCGQXU","created_at":"2026-07-05T10:41:11.277901+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z5TOQKWCGQXUVNMC","created_at":"2026-07-05T10:41:11.277901+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z5TOQKWC","created_at":"2026-07-05T10:41:11.277901+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.06355","citing_title":"Quantum Algorithm for Estimating Intrinsic Geometry","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z5TOQKWCGQXUVNMC63AF45JXIO","json":"https://pith.science/pith/Z5TOQKWCGQXUVNMC63AF45JXIO.json","graph_json":"https://pith.science/api/pith-number/Z5TOQKWCGQXUVNMC63AF45JXIO/graph.json","events_json":"https://pith.science/api/pith-number/Z5TOQKWCGQXUVNMC63AF45JXIO/events.json","paper":"https://pith.science/paper/Z5TOQKWC"},"agent_actions":{"view_html":"https://pith.science/pith/Z5TOQKWCGQXUVNMC63AF45JXIO","download_json":"https://pith.science/pith/Z5TOQKWCGQXUVNMC63AF45JXIO.json","view_paper":"https://pith.science/paper/Z5TOQKWC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.14786&json=true","fetch_graph":"https://pith.science/api/pith-number/Z5TOQKWCGQXUVNMC63AF45JXIO/graph.json","fetch_events":"https://pith.science/api/pith-number/Z5TOQKWCGQXUVNMC63AF45JXIO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z5TOQKWCGQXUVNMC63AF45JXIO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z5TOQKWCGQXUVNMC63AF45JXIO/action/storage_attestation","attest_author":"https://pith.science/pith/Z5TOQKWCGQXUVNMC63AF45JXIO/action/author_attestation","sign_citation":"https://pith.science/pith/Z5TOQKWCGQXUVNMC63AF45JXIO/action/citation_signature","submit_replication":"https://pith.science/pith/Z5TOQKWCGQXUVNMC63AF45JXIO/action/replication_record"}},"created_at":"2026-07-05T10:41:11.277901+00:00","updated_at":"2026-07-05T10:41:11.277901+00:00"}