{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DMTW2U3RZPDOWY5OIBNI6F26NZ","short_pith_number":"pith:DMTW2U3R","schema_version":"1.0","canonical_sha256":"1b276d5371cbc6eb63ae405a8f175e6e6ff996902e89859a7ad93428de14dfed","source":{"kind":"arxiv","id":"1710.02581","version":3},"attestation_state":"computed","paper":{"title":"Quantum SDP Solvers: Large Speed-ups, Optimality, and Applications to Quantum Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Amir Kalev, Cedric Yen-Yu Lin, Fernando G. S. L. Brand\\~ao, Krysta M. Svore, Tongyang Li, Xiaodi Wu","submitted_at":"2017-10-06T20:43:14Z","abstract_excerpt":"We give two quantum algorithms for solving semidefinite programs (SDPs) providing quantum speed-ups. We consider SDP instances with $m$ constraint matrices, each of dimension $n$, rank at most $r$, and sparsity $s$. The first algorithm assumes access to an oracle to the matrices at unit cost. We show that it has run time $\\tilde{O}(s^2(\\sqrt{m}\\epsilon^{-10}+\\sqrt{n}\\epsilon^{-12}))$, with $\\epsilon$ the error of the solution. This gives an optimal dependence in terms of $m, n$ and quadratic improvement over previous quantum algorithms when $m\\approx n$. The second algorithm assumes a fully qu"},"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":"1710.02581","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-06T20:43:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"34bc13f2a840337e165e8ea310ed8044d71a0e864368ede6ab55aaf22cb066d2","abstract_canon_sha256":"83f76b53df65afa42ae3cb7a7b6f84c4ef24907c1bc2207077a7967c00af38ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:02.267463Z","signature_b64":"3lCqUpQ6Uh+fDDUk7Ksd3pmYuwz3nwBI0LlNfOCWIAv1haAgi1KK+y1RjNq1KbouuWw9Y4BJmDVG/FalptN+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b276d5371cbc6eb63ae405a8f175e6e6ff996902e89859a7ad93428de14dfed","last_reissued_at":"2026-05-17T23:48:02.266921Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:02.266921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum SDP Solvers: Large Speed-ups, Optimality, and Applications to Quantum Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Amir Kalev, Cedric Yen-Yu Lin, Fernando G. S. L. Brand\\~ao, Krysta M. Svore, Tongyang Li, Xiaodi Wu","submitted_at":"2017-10-06T20:43:14Z","abstract_excerpt":"We give two quantum algorithms for solving semidefinite programs (SDPs) providing quantum speed-ups. We consider SDP instances with $m$ constraint matrices, each of dimension $n$, rank at most $r$, and sparsity $s$. The first algorithm assumes access to an oracle to the matrices at unit cost. We show that it has run time $\\tilde{O}(s^2(\\sqrt{m}\\epsilon^{-10}+\\sqrt{n}\\epsilon^{-12}))$, with $\\epsilon$ the error of the solution. This gives an optimal dependence in terms of $m, n$ and quadratic improvement over previous quantum algorithms when $m\\approx n$. The second algorithm assumes a fully qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02581","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":"1710.02581","created_at":"2026-05-17T23:48:02.266997+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02581v3","created_at":"2026-05-17T23:48:02.266997+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02581","created_at":"2026-05-17T23:48:02.266997+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMTW2U3RZPDO","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMTW2U3RZPDOWY5O","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMTW2U3R","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.22996","citing_title":"Accelerating quantum Gibbs sampling without quantum walks","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07214","citing_title":"Quantum Gibbs sampling through the detectability lemma","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DMTW2U3RZPDOWY5OIBNI6F26NZ","json":"https://pith.science/pith/DMTW2U3RZPDOWY5OIBNI6F26NZ.json","graph_json":"https://pith.science/api/pith-number/DMTW2U3RZPDOWY5OIBNI6F26NZ/graph.json","events_json":"https://pith.science/api/pith-number/DMTW2U3RZPDOWY5OIBNI6F26NZ/events.json","paper":"https://pith.science/paper/DMTW2U3R"},"agent_actions":{"view_html":"https://pith.science/pith/DMTW2U3RZPDOWY5OIBNI6F26NZ","download_json":"https://pith.science/pith/DMTW2U3RZPDOWY5OIBNI6F26NZ.json","view_paper":"https://pith.science/paper/DMTW2U3R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02581&json=true","fetch_graph":"https://pith.science/api/pith-number/DMTW2U3RZPDOWY5OIBNI6F26NZ/graph.json","fetch_events":"https://pith.science/api/pith-number/DMTW2U3RZPDOWY5OIBNI6F26NZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMTW2U3RZPDOWY5OIBNI6F26NZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMTW2U3RZPDOWY5OIBNI6F26NZ/action/storage_attestation","attest_author":"https://pith.science/pith/DMTW2U3RZPDOWY5OIBNI6F26NZ/action/author_attestation","sign_citation":"https://pith.science/pith/DMTW2U3RZPDOWY5OIBNI6F26NZ/action/citation_signature","submit_replication":"https://pith.science/pith/DMTW2U3RZPDOWY5OIBNI6F26NZ/action/replication_record"}},"created_at":"2026-05-17T23:48:02.266997+00:00","updated_at":"2026-05-17T23:48:02.266997+00:00"}