{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:LTALAT6EHMWQTNRVSBGJ2TJFZF","short_pith_number":"pith:LTALAT6E","schema_version":"1.0","canonical_sha256":"5cc0b04fc43b2d09b635904c9d4d25c94df951a36103bc7cecce2d2eaa1a54c5","source":{"kind":"arxiv","id":"2209.12897","version":1},"attestation_state":"computed","paper":{"title":"Quantum Speedups of Optimizing Approximately Convex Functions with Applications to Logarithmic Regret Stochastic Convex Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"quant-ph","authors_text":"Ruizhe Zhang, Tongyang Li","submitted_at":"2022-09-26T03:19:40Z","abstract_excerpt":"We initiate the study of quantum algorithms for optimizing approximately convex functions. Given a convex set ${\\cal K}\\subseteq\\mathbb{R}^{n}$ and a function $F\\colon\\mathbb{R}^{n}\\to\\mathbb{R}$ such that there exists a convex function $f\\colon\\mathcal{K}\\to\\mathbb{R}$ satisfying $\\sup_{x\\in{\\cal K}}|F(x)-f(x)|\\leq \\epsilon/n$, our quantum algorithm finds an $x^{*}\\in{\\cal K}$ such that $F(x^{*})-\\min_{x\\in{\\cal K}} F(x)\\leq\\epsilon$ using $\\tilde{O}(n^{3})$ quantum evaluation queries to $F$. This achieves a polynomial quantum speedup compared to the best-known classical algorithms. As an app"},"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":"2209.12897","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-09-26T03:19:40Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"b424f2153981eb03697ef44573e703c1739f440842adec65899f7c2b28c98bf4","abstract_canon_sha256":"f8563031b6c5440831935503262140f2cea1d7db2a504eb0e6c6956462e7f58e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:01:04.314738Z","signature_b64":"Wfw2ccGRmJpFy5U3TXqlcGXYV7RkcYMBM/oCsvRWVKqAEcLxXsikQR8GiozRksnZdKNEnYeIG995hugVyz1fBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cc0b04fc43b2d09b635904c9d4d25c94df951a36103bc7cecce2d2eaa1a54c5","last_reissued_at":"2026-07-05T05:01:04.314394Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:01:04.314394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Speedups of Optimizing Approximately Convex Functions with Applications to Logarithmic Regret Stochastic Convex Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"quant-ph","authors_text":"Ruizhe Zhang, Tongyang Li","submitted_at":"2022-09-26T03:19:40Z","abstract_excerpt":"We initiate the study of quantum algorithms for optimizing approximately convex functions. Given a convex set ${\\cal K}\\subseteq\\mathbb{R}^{n}$ and a function $F\\colon\\mathbb{R}^{n}\\to\\mathbb{R}$ such that there exists a convex function $f\\colon\\mathcal{K}\\to\\mathbb{R}$ satisfying $\\sup_{x\\in{\\cal K}}|F(x)-f(x)|\\leq \\epsilon/n$, our quantum algorithm finds an $x^{*}\\in{\\cal K}$ such that $F(x^{*})-\\min_{x\\in{\\cal K}} F(x)\\leq\\epsilon$ using $\\tilde{O}(n^{3})$ quantum evaluation queries to $F$. This achieves a polynomial quantum speedup compared to the best-known classical algorithms. As an app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.12897","kind":"arxiv","version":1},"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/2209.12897/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":"2209.12897","created_at":"2026-07-05T05:01:04.314452+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.12897v1","created_at":"2026-07-05T05:01:04.314452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.12897","created_at":"2026-07-05T05:01:04.314452+00:00"},{"alias_kind":"pith_short_12","alias_value":"LTALAT6EHMWQ","created_at":"2026-07-05T05:01:04.314452+00:00"},{"alias_kind":"pith_short_16","alias_value":"LTALAT6EHMWQTNRV","created_at":"2026-07-05T05:01:04.314452+00:00"},{"alias_kind":"pith_short_8","alias_value":"LTALAT6E","created_at":"2026-07-05T05:01:04.314452+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/LTALAT6EHMWQTNRVSBGJ2TJFZF","json":"https://pith.science/pith/LTALAT6EHMWQTNRVSBGJ2TJFZF.json","graph_json":"https://pith.science/api/pith-number/LTALAT6EHMWQTNRVSBGJ2TJFZF/graph.json","events_json":"https://pith.science/api/pith-number/LTALAT6EHMWQTNRVSBGJ2TJFZF/events.json","paper":"https://pith.science/paper/LTALAT6E"},"agent_actions":{"view_html":"https://pith.science/pith/LTALAT6EHMWQTNRVSBGJ2TJFZF","download_json":"https://pith.science/pith/LTALAT6EHMWQTNRVSBGJ2TJFZF.json","view_paper":"https://pith.science/paper/LTALAT6E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.12897&json=true","fetch_graph":"https://pith.science/api/pith-number/LTALAT6EHMWQTNRVSBGJ2TJFZF/graph.json","fetch_events":"https://pith.science/api/pith-number/LTALAT6EHMWQTNRVSBGJ2TJFZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LTALAT6EHMWQTNRVSBGJ2TJFZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LTALAT6EHMWQTNRVSBGJ2TJFZF/action/storage_attestation","attest_author":"https://pith.science/pith/LTALAT6EHMWQTNRVSBGJ2TJFZF/action/author_attestation","sign_citation":"https://pith.science/pith/LTALAT6EHMWQTNRVSBGJ2TJFZF/action/citation_signature","submit_replication":"https://pith.science/pith/LTALAT6EHMWQTNRVSBGJ2TJFZF/action/replication_record"}},"created_at":"2026-07-05T05:01:04.314452+00:00","updated_at":"2026-07-05T05:01:04.314452+00:00"}