{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4VA6JKVK7CSG4JSJUNIESZICQQ","short_pith_number":"pith:4VA6JKVK","schema_version":"1.0","canonical_sha256":"e541e4aaaaf8a46e2649a350496502842b3e9a5562dafff8f7c1ec851b043259","source":{"kind":"arxiv","id":"1711.00465","version":3},"attestation_state":"computed","paper":{"title":"Optimizing quantum optimization algorithms via faster quantum gradient computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andr\\'as Gily\\'en, Nathan Wiebe, Srinivasan Arunachalam","submitted_at":"2017-11-01T17:59:47Z","abstract_excerpt":"We consider a generic framework of optimization algorithms based on gradient descent. We develop a quantum algorithm that computes the gradient of a multi-variate real-valued function $f:\\mathbb{R}^d\\rightarrow \\mathbb{R}$ by evaluating it at only a logarithmic number of points in superposition. Our algorithm is an improved version of Stephen Jordan's gradient computation algorithm, providing an approximation of the gradient $\\nabla f$ with quadratically better dependence on the evaluation accuracy of $f$, for an important class of smooth functions. Furthermore, we show that most objective fun"},"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":"1711.00465","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-11-01T17:59:47Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"66bd04865635ac6eb0a910a7d31c5a1f507630d05207afec9fcecbe0b18f5a7b","abstract_canon_sha256":"9145a7f6f19a71f24a13d7ebd14ada6edddcecf9045bf6cf9908e67749410886"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:51.970370Z","signature_b64":"Chf61Li1q9DjkpTlxkRC1YigMUURjHhxncwWLld/tdzdb7xhE9o5VvA4AoYWlV0dhi4+lINVIViSa2qb8yzXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e541e4aaaaf8a46e2649a350496502842b3e9a5562dafff8f7c1ec851b043259","last_reissued_at":"2026-05-17T23:53:51.969526Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:51.969526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing quantum optimization algorithms via faster quantum gradient computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andr\\'as Gily\\'en, Nathan Wiebe, Srinivasan Arunachalam","submitted_at":"2017-11-01T17:59:47Z","abstract_excerpt":"We consider a generic framework of optimization algorithms based on gradient descent. We develop a quantum algorithm that computes the gradient of a multi-variate real-valued function $f:\\mathbb{R}^d\\rightarrow \\mathbb{R}$ by evaluating it at only a logarithmic number of points in superposition. Our algorithm is an improved version of Stephen Jordan's gradient computation algorithm, providing an approximation of the gradient $\\nabla f$ with quadratically better dependence on the evaluation accuracy of $f$, for an important class of smooth functions. Furthermore, we show that most objective fun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00465","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":""},"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":"1711.00465","created_at":"2026-05-17T23:53:51.969651+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00465v3","created_at":"2026-05-17T23:53:51.969651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00465","created_at":"2026-05-17T23:53:51.969651+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VA6JKVK7CSG","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VA6JKVK7CSG4JSJ","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VA6JKVK","created_at":"2026-05-18T12:31:00.734936+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/4VA6JKVK7CSG4JSJUNIESZICQQ","json":"https://pith.science/pith/4VA6JKVK7CSG4JSJUNIESZICQQ.json","graph_json":"https://pith.science/api/pith-number/4VA6JKVK7CSG4JSJUNIESZICQQ/graph.json","events_json":"https://pith.science/api/pith-number/4VA6JKVK7CSG4JSJUNIESZICQQ/events.json","paper":"https://pith.science/paper/4VA6JKVK"},"agent_actions":{"view_html":"https://pith.science/pith/4VA6JKVK7CSG4JSJUNIESZICQQ","download_json":"https://pith.science/pith/4VA6JKVK7CSG4JSJUNIESZICQQ.json","view_paper":"https://pith.science/paper/4VA6JKVK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00465&json=true","fetch_graph":"https://pith.science/api/pith-number/4VA6JKVK7CSG4JSJUNIESZICQQ/graph.json","fetch_events":"https://pith.science/api/pith-number/4VA6JKVK7CSG4JSJUNIESZICQQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VA6JKVK7CSG4JSJUNIESZICQQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VA6JKVK7CSG4JSJUNIESZICQQ/action/storage_attestation","attest_author":"https://pith.science/pith/4VA6JKVK7CSG4JSJUNIESZICQQ/action/author_attestation","sign_citation":"https://pith.science/pith/4VA6JKVK7CSG4JSJUNIESZICQQ/action/citation_signature","submit_replication":"https://pith.science/pith/4VA6JKVK7CSG4JSJUNIESZICQQ/action/replication_record"}},"created_at":"2026-05-17T23:53:51.969651+00:00","updated_at":"2026-05-17T23:53:51.969651+00:00"}