{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N2ETSPFDCD2ZPLN7ZFV56IDEWZ","short_pith_number":"pith:N2ETSPFD","schema_version":"1.0","canonical_sha256":"6e89393ca310f597adbfc96bdf2064b66c170e13a2925f2b3d612276951718b0","source":{"kind":"arxiv","id":"1809.01731","version":3},"attestation_state":"computed","paper":{"title":"Quantum algorithms and lower bounds for convex optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Shouvanik Chakrabarti, Tongyang Li, Xiaodi Wu","submitted_at":"2018-09-04T14:05:38Z","abstract_excerpt":"While recent work suggests that quantum computers can speed up the solution of semidefinite programs, little is known about the quantum complexity of more general convex optimization. We present a quantum algorithm that can optimize a convex function over an $n$-dimensional convex body using $\\tilde{O}(n)$ queries to oracles that evaluate the objective function and determine membership in the convex body. This represents a quadratic improvement over the best-known classical algorithm. We also study limitations on the power of quantum computers for general convex optimization, showing that it r"},"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":"1809.01731","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-09-04T14:05:38Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"f88094014f35557e00a573293b9dc7bfbf875d00cf060b259e7b77aaef7ddcfa","abstract_canon_sha256":"6e8dd92cd21be70ed0e9c15a1c66590a86a4d95db1777433b34c98cc6e2b9740"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:33:09.303993Z","signature_b64":"6FKHU59tci3n7/zSwgBhqzdWs7Rn9PXz7hexXqvPEmu+8hmmb325jHYDdO1eWJkLZen4WYumLOraa0Z+zlrRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e89393ca310f597adbfc96bdf2064b66c170e13a2925f2b3d612276951718b0","last_reissued_at":"2026-07-05T00:33:09.303414Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:33:09.303414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum algorithms and lower bounds for convex optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Shouvanik Chakrabarti, Tongyang Li, Xiaodi Wu","submitted_at":"2018-09-04T14:05:38Z","abstract_excerpt":"While recent work suggests that quantum computers can speed up the solution of semidefinite programs, little is known about the quantum complexity of more general convex optimization. We present a quantum algorithm that can optimize a convex function over an $n$-dimensional convex body using $\\tilde{O}(n)$ queries to oracles that evaluate the objective function and determine membership in the convex body. This represents a quadratic improvement over the best-known classical algorithm. We also study limitations on the power of quantum computers for general convex optimization, showing that it r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01731","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/1809.01731/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":"1809.01731","created_at":"2026-07-05T00:33:09.303495+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.01731v3","created_at":"2026-07-05T00:33:09.303495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01731","created_at":"2026-07-05T00:33:09.303495+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2ETSPFDCD2Z","created_at":"2026-07-05T00:33:09.303495+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2ETSPFDCD2ZPLN7","created_at":"2026-07-05T00:33:09.303495+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2ETSPFD","created_at":"2026-07-05T00:33:09.303495+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/N2ETSPFDCD2ZPLN7ZFV56IDEWZ","json":"https://pith.science/pith/N2ETSPFDCD2ZPLN7ZFV56IDEWZ.json","graph_json":"https://pith.science/api/pith-number/N2ETSPFDCD2ZPLN7ZFV56IDEWZ/graph.json","events_json":"https://pith.science/api/pith-number/N2ETSPFDCD2ZPLN7ZFV56IDEWZ/events.json","paper":"https://pith.science/paper/N2ETSPFD"},"agent_actions":{"view_html":"https://pith.science/pith/N2ETSPFDCD2ZPLN7ZFV56IDEWZ","download_json":"https://pith.science/pith/N2ETSPFDCD2ZPLN7ZFV56IDEWZ.json","view_paper":"https://pith.science/paper/N2ETSPFD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.01731&json=true","fetch_graph":"https://pith.science/api/pith-number/N2ETSPFDCD2ZPLN7ZFV56IDEWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/N2ETSPFDCD2ZPLN7ZFV56IDEWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2ETSPFDCD2ZPLN7ZFV56IDEWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2ETSPFDCD2ZPLN7ZFV56IDEWZ/action/storage_attestation","attest_author":"https://pith.science/pith/N2ETSPFDCD2ZPLN7ZFV56IDEWZ/action/author_attestation","sign_citation":"https://pith.science/pith/N2ETSPFDCD2ZPLN7ZFV56IDEWZ/action/citation_signature","submit_replication":"https://pith.science/pith/N2ETSPFDCD2ZPLN7ZFV56IDEWZ/action/replication_record"}},"created_at":"2026-07-05T00:33:09.303495+00:00","updated_at":"2026-07-05T00:33:09.303495+00:00"}