{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KV7VNLQXC6ZRFAB5NLSGJ2IWXC","short_pith_number":"pith:KV7VNLQX","schema_version":"1.0","canonical_sha256":"557f56ae1717b312803d6ae464e916b89db0a9c072b56360ba290157f541636b","source":{"kind":"arxiv","id":"1609.05537","version":5},"attestation_state":"computed","paper":{"title":"Quantum Speed-ups for Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Fernando G.S.L. Brandao, Krysta Svore","submitted_at":"2016-09-18T20:13:50Z","abstract_excerpt":"We give a quantum algorithm for solving semidefinite programs (SDPs). It has worst-case running time $n^{\\frac{1}{2}} m^{\\frac{1}{2}} s^2 \\text{poly}(\\log(n), \\log(m), R, r, 1/\\delta)$, with $n$ and $s$ the dimension and row-sparsity of the input matrices, respectively, $m$ the number of constraints, $\\delta$ the accuracy of the solution, and $R, r$ a upper bounds on the size of the optimal primal and dual solutions. This gives a square-root unconditional speed-up over any classical method for solving SDPs both in $n$ and $m$. We prove the algorithm cannot be substantially improved (in terms o"},"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":"1609.05537","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-18T20:13:50Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"14e06bb49ef83d6ae743d08d0c6a7fac6d7f1e612c02be1723428b4309df65c1","abstract_canon_sha256":"90b7139d4db3d205f7b28d512f2eb1537badd430ec31c551db24b40de7c15f41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:31.578370Z","signature_b64":"GDHJMN+/7zyJIN+dW9mlXo/Gt7BKDYMLCPiXgZd+pdffdUMFhq54IE7z5OounoiI5CDz21WpMCj1EvXodPROAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"557f56ae1717b312803d6ae464e916b89db0a9c072b56360ba290157f541636b","last_reissued_at":"2026-05-18T00:34:31.577958Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:31.577958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Speed-ups for Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Fernando G.S.L. Brandao, Krysta Svore","submitted_at":"2016-09-18T20:13:50Z","abstract_excerpt":"We give a quantum algorithm for solving semidefinite programs (SDPs). It has worst-case running time $n^{\\frac{1}{2}} m^{\\frac{1}{2}} s^2 \\text{poly}(\\log(n), \\log(m), R, r, 1/\\delta)$, with $n$ and $s$ the dimension and row-sparsity of the input matrices, respectively, $m$ the number of constraints, $\\delta$ the accuracy of the solution, and $R, r$ a upper bounds on the size of the optimal primal and dual solutions. This gives a square-root unconditional speed-up over any classical method for solving SDPs both in $n$ and $m$. We prove the algorithm cannot be substantially improved (in terms o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05537","kind":"arxiv","version":5},"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":"1609.05537","created_at":"2026-05-18T00:34:31.578008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.05537v5","created_at":"2026-05-18T00:34:31.578008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05537","created_at":"2026-05-18T00:34:31.578008+00:00"},{"alias_kind":"pith_short_12","alias_value":"KV7VNLQXC6ZR","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"KV7VNLQXC6ZRFAB5","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"KV7VNLQX","created_at":"2026-05-18T12:30:29.479603+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/KV7VNLQXC6ZRFAB5NLSGJ2IWXC","json":"https://pith.science/pith/KV7VNLQXC6ZRFAB5NLSGJ2IWXC.json","graph_json":"https://pith.science/api/pith-number/KV7VNLQXC6ZRFAB5NLSGJ2IWXC/graph.json","events_json":"https://pith.science/api/pith-number/KV7VNLQXC6ZRFAB5NLSGJ2IWXC/events.json","paper":"https://pith.science/paper/KV7VNLQX"},"agent_actions":{"view_html":"https://pith.science/pith/KV7VNLQXC6ZRFAB5NLSGJ2IWXC","download_json":"https://pith.science/pith/KV7VNLQXC6ZRFAB5NLSGJ2IWXC.json","view_paper":"https://pith.science/paper/KV7VNLQX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.05537&json=true","fetch_graph":"https://pith.science/api/pith-number/KV7VNLQXC6ZRFAB5NLSGJ2IWXC/graph.json","fetch_events":"https://pith.science/api/pith-number/KV7VNLQXC6ZRFAB5NLSGJ2IWXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KV7VNLQXC6ZRFAB5NLSGJ2IWXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KV7VNLQXC6ZRFAB5NLSGJ2IWXC/action/storage_attestation","attest_author":"https://pith.science/pith/KV7VNLQXC6ZRFAB5NLSGJ2IWXC/action/author_attestation","sign_citation":"https://pith.science/pith/KV7VNLQXC6ZRFAB5NLSGJ2IWXC/action/citation_signature","submit_replication":"https://pith.science/pith/KV7VNLQXC6ZRFAB5NLSGJ2IWXC/action/replication_record"}},"created_at":"2026-05-18T00:34:31.578008+00:00","updated_at":"2026-05-18T00:34:31.578008+00:00"}