{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NRDBRFDKMAKLIG6KEPV76HBONX","short_pith_number":"pith:NRDBRFDK","schema_version":"1.0","canonical_sha256":"6c4618946a6014b41bca23ebff1c2e6de10ddf20f0ea864792658247bd4dc128","source":{"kind":"arxiv","id":"2305.04198","version":2},"attestation_state":"computed","paper":{"title":"Pure Quantum Gradient Descent Algorithm and Full Quantum Variational Eigensolver","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Cong Guo, Guanru Feng, Ronghang Chen, Shi-yao Hou","submitted_at":"2023-05-07T05:52:41Z","abstract_excerpt":"Optimization problems are prevalent in various fields, and the gradient-based gradient descent algorithm is a widely adopted optimization method. However, in classical computing, computing the numerical gradient for a function with $d$ variables necessitates at least $d+1$ function evaluations, resulting in a computational complexity of $O(d)$. As the number of variables increases, the classical gradient estimation methods require substantial resources, ultimately surpassing the capabilities of classical computers. Fortunately, leveraging the principles of superposition and entanglement in qua"},"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":"2305.04198","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-05-07T05:52:41Z","cross_cats_sorted":[],"title_canon_sha256":"f27cb5720dff3f4ea1e697a127b6187b8c1e91b58ad2b5f1907ccb0c6f848247","abstract_canon_sha256":"628fb8933b1ab7f4a29684422268d840553a5590a47e86d3e5aef44fe9ff3945"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:09:10.703868Z","signature_b64":"RvYMg7yZbKlXS+CWmw/hL8X6JNED/LS9wSp32QVC99Z2ewTDmlu+XcmqhH7SmubY+kYuN1x4CVoOjmgzz92qBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c4618946a6014b41bca23ebff1c2e6de10ddf20f0ea864792658247bd4dc128","last_reissued_at":"2026-07-05T06:09:10.703399Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:09:10.703399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pure Quantum Gradient Descent Algorithm and Full Quantum Variational Eigensolver","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Cong Guo, Guanru Feng, Ronghang Chen, Shi-yao Hou","submitted_at":"2023-05-07T05:52:41Z","abstract_excerpt":"Optimization problems are prevalent in various fields, and the gradient-based gradient descent algorithm is a widely adopted optimization method. However, in classical computing, computing the numerical gradient for a function with $d$ variables necessitates at least $d+1$ function evaluations, resulting in a computational complexity of $O(d)$. As the number of variables increases, the classical gradient estimation methods require substantial resources, ultimately surpassing the capabilities of classical computers. Fortunately, leveraging the principles of superposition and entanglement in qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.04198","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/2305.04198/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":"2305.04198","created_at":"2026-07-05T06:09:10.703459+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.04198v2","created_at":"2026-07-05T06:09:10.703459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.04198","created_at":"2026-07-05T06:09:10.703459+00:00"},{"alias_kind":"pith_short_12","alias_value":"NRDBRFDKMAKL","created_at":"2026-07-05T06:09:10.703459+00:00"},{"alias_kind":"pith_short_16","alias_value":"NRDBRFDKMAKLIG6K","created_at":"2026-07-05T06:09:10.703459+00:00"},{"alias_kind":"pith_short_8","alias_value":"NRDBRFDK","created_at":"2026-07-05T06:09:10.703459+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/NRDBRFDKMAKLIG6KEPV76HBONX","json":"https://pith.science/pith/NRDBRFDKMAKLIG6KEPV76HBONX.json","graph_json":"https://pith.science/api/pith-number/NRDBRFDKMAKLIG6KEPV76HBONX/graph.json","events_json":"https://pith.science/api/pith-number/NRDBRFDKMAKLIG6KEPV76HBONX/events.json","paper":"https://pith.science/paper/NRDBRFDK"},"agent_actions":{"view_html":"https://pith.science/pith/NRDBRFDKMAKLIG6KEPV76HBONX","download_json":"https://pith.science/pith/NRDBRFDKMAKLIG6KEPV76HBONX.json","view_paper":"https://pith.science/paper/NRDBRFDK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.04198&json=true","fetch_graph":"https://pith.science/api/pith-number/NRDBRFDKMAKLIG6KEPV76HBONX/graph.json","fetch_events":"https://pith.science/api/pith-number/NRDBRFDKMAKLIG6KEPV76HBONX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NRDBRFDKMAKLIG6KEPV76HBONX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NRDBRFDKMAKLIG6KEPV76HBONX/action/storage_attestation","attest_author":"https://pith.science/pith/NRDBRFDKMAKLIG6KEPV76HBONX/action/author_attestation","sign_citation":"https://pith.science/pith/NRDBRFDKMAKLIG6KEPV76HBONX/action/citation_signature","submit_replication":"https://pith.science/pith/NRDBRFDKMAKLIG6KEPV76HBONX/action/replication_record"}},"created_at":"2026-07-05T06:09:10.703459+00:00","updated_at":"2026-07-05T06:09:10.703459+00:00"}