{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:I2YWUV755T6DORCW4QRNBZP5A7","short_pith_number":"pith:I2YWUV75","schema_version":"1.0","canonical_sha256":"46b16a57fdecfc374456e422d0e5fd07dc9f0503623ae9b47c3c9d52490a1aa5","source":{"kind":"arxiv","id":"1809.00643","version":4},"attestation_state":"computed","paper":{"title":"Convex optimization using quantum oracles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"quant-ph","authors_text":"Andr\\'as Gily\\'en, Joran van Apeldoorn, Ronald de Wolf, Sander Gribling","submitted_at":"2018-09-03T16:30:24Z","abstract_excerpt":"We study to what extent quantum algorithms can speed up solving convex optimization problems. Following the classical literature we assume access to a convex set via various oracles, and we examine the efficiency of reductions between the different oracles. In particular, we show how a separation oracle can be implemented using $\\tilde{O}(1)$ quantum queries to a membership oracle, which is an exponential quantum speed-up over the $\\Omega(n)$ membership queries that are needed classically. We show that a quantum computer can very efficiently compute an approximate subgradient of a convex Lipsc"},"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.00643","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-09-03T16:30:24Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"fbafb516876e61c702a8bf34e08b0771d7089e91c96715e8725376e10b875365","abstract_canon_sha256":"60bfa62dc601802d26ac596c74d135a10a45193b7d307c76b69fceca04aa9ebb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:33:09.271099Z","signature_b64":"m41oc8XlrYSCJtUuxzYLSb8xd10aHg2eMKIsqMTmV6WDshHl9cMrK7LeQONWfj693DJWjPfo/VNx/9Gla8e3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46b16a57fdecfc374456e422d0e5fd07dc9f0503623ae9b47c3c9d52490a1aa5","last_reissued_at":"2026-07-05T00:33:09.270700Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:33:09.270700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex optimization using quantum oracles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"quant-ph","authors_text":"Andr\\'as Gily\\'en, Joran van Apeldoorn, Ronald de Wolf, Sander Gribling","submitted_at":"2018-09-03T16:30:24Z","abstract_excerpt":"We study to what extent quantum algorithms can speed up solving convex optimization problems. Following the classical literature we assume access to a convex set via various oracles, and we examine the efficiency of reductions between the different oracles. In particular, we show how a separation oracle can be implemented using $\\tilde{O}(1)$ quantum queries to a membership oracle, which is an exponential quantum speed-up over the $\\Omega(n)$ membership queries that are needed classically. We show that a quantum computer can very efficiently compute an approximate subgradient of a convex Lipsc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00643","kind":"arxiv","version":4},"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.00643/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.00643","created_at":"2026-07-05T00:33:09.270751+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.00643v4","created_at":"2026-07-05T00:33:09.270751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00643","created_at":"2026-07-05T00:33:09.270751+00:00"},{"alias_kind":"pith_short_12","alias_value":"I2YWUV755T6D","created_at":"2026-07-05T00:33:09.270751+00:00"},{"alias_kind":"pith_short_16","alias_value":"I2YWUV755T6DORCW","created_at":"2026-07-05T00:33:09.270751+00:00"},{"alias_kind":"pith_short_8","alias_value":"I2YWUV75","created_at":"2026-07-05T00:33:09.270751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04438","citing_title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I2YWUV755T6DORCW4QRNBZP5A7","json":"https://pith.science/pith/I2YWUV755T6DORCW4QRNBZP5A7.json","graph_json":"https://pith.science/api/pith-number/I2YWUV755T6DORCW4QRNBZP5A7/graph.json","events_json":"https://pith.science/api/pith-number/I2YWUV755T6DORCW4QRNBZP5A7/events.json","paper":"https://pith.science/paper/I2YWUV75"},"agent_actions":{"view_html":"https://pith.science/pith/I2YWUV755T6DORCW4QRNBZP5A7","download_json":"https://pith.science/pith/I2YWUV755T6DORCW4QRNBZP5A7.json","view_paper":"https://pith.science/paper/I2YWUV75","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.00643&json=true","fetch_graph":"https://pith.science/api/pith-number/I2YWUV755T6DORCW4QRNBZP5A7/graph.json","fetch_events":"https://pith.science/api/pith-number/I2YWUV755T6DORCW4QRNBZP5A7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I2YWUV755T6DORCW4QRNBZP5A7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I2YWUV755T6DORCW4QRNBZP5A7/action/storage_attestation","attest_author":"https://pith.science/pith/I2YWUV755T6DORCW4QRNBZP5A7/action/author_attestation","sign_citation":"https://pith.science/pith/I2YWUV755T6DORCW4QRNBZP5A7/action/citation_signature","submit_replication":"https://pith.science/pith/I2YWUV755T6DORCW4QRNBZP5A7/action/replication_record"}},"created_at":"2026-07-05T00:33:09.270751+00:00","updated_at":"2026-07-05T00:33:09.270751+00:00"}