{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FMINR5QZBGTDIX6BZURV3RLKQP","short_pith_number":"pith:FMINR5QZ","schema_version":"1.0","canonical_sha256":"2b10d8f61909a6345fc1cd235dc56a83dc846684c3191ad7cd8024c797177e14","source":{"kind":"arxiv","id":"1808.09266","version":1},"attestation_state":"computed","paper":{"title":"A Quantum Interior Point Method for LPs and SDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Anupam Prakash, Iordanis Kerenidis","submitted_at":"2018-08-28T13:10:03Z","abstract_excerpt":"We present a quantum interior point method with worst case running time $\\widetilde{O}(\\frac{n^{2.5}}{\\xi^{2}} \\mu \\kappa^3 \\log (1/\\epsilon))$ for SDPs and $\\widetilde{O}(\\frac{n^{1.5}}{\\xi^{2}} \\mu \\kappa^3 \\log (1/\\epsilon))$ for LPs, where the output of our algorithm is a pair of matrices $(S,Y)$ that are $\\epsilon$-optimal $\\xi$-approximate SDP solutions. The factor $\\mu$ is at most $\\sqrt{2}n$ for SDPs and $\\sqrt{2n}$ for LP's, and $\\kappa$ is an upper bound on the condition number of the intermediate solution matrices. For the case where the intermediate matrices for the interior point "},"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":"1808.09266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-08-28T13:10:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7e63d0146bf8dd2ce7a0bba36d8f06699c3c45dbf58e25c35cb573482719046c","abstract_canon_sha256":"5e8a7915f6e3a487c293f9d5576c3ea159a177d634f9169a98e0a0b1ded8a242"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:01.872247Z","signature_b64":"H95LJyp2mNQoDv1Sd4cK/5JH3nPd06x08e2jgl7nd44HycP1+iD3FxFUi0vBxa5tL/NXSxoL8lEHYwqfpymWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b10d8f61909a6345fc1cd235dc56a83dc846684c3191ad7cd8024c797177e14","last_reissued_at":"2026-05-18T00:07:01.871740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:01.871740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Quantum Interior Point Method for LPs and SDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Anupam Prakash, Iordanis Kerenidis","submitted_at":"2018-08-28T13:10:03Z","abstract_excerpt":"We present a quantum interior point method with worst case running time $\\widetilde{O}(\\frac{n^{2.5}}{\\xi^{2}} \\mu \\kappa^3 \\log (1/\\epsilon))$ for SDPs and $\\widetilde{O}(\\frac{n^{1.5}}{\\xi^{2}} \\mu \\kappa^3 \\log (1/\\epsilon))$ for LPs, where the output of our algorithm is a pair of matrices $(S,Y)$ that are $\\epsilon$-optimal $\\xi$-approximate SDP solutions. The factor $\\mu$ is at most $\\sqrt{2}n$ for SDPs and $\\sqrt{2n}$ for LP's, and $\\kappa$ is an upper bound on the condition number of the intermediate solution matrices. For the case where the intermediate matrices for the interior point "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09266","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":""},"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":"1808.09266","created_at":"2026-05-18T00:07:01.871822+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.09266v1","created_at":"2026-05-18T00:07:01.871822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09266","created_at":"2026-05-18T00:07:01.871822+00:00"},{"alias_kind":"pith_short_12","alias_value":"FMINR5QZBGTD","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FMINR5QZBGTDIX6B","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FMINR5QZ","created_at":"2026-05-18T12:32:22.470017+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/FMINR5QZBGTDIX6BZURV3RLKQP","json":"https://pith.science/pith/FMINR5QZBGTDIX6BZURV3RLKQP.json","graph_json":"https://pith.science/api/pith-number/FMINR5QZBGTDIX6BZURV3RLKQP/graph.json","events_json":"https://pith.science/api/pith-number/FMINR5QZBGTDIX6BZURV3RLKQP/events.json","paper":"https://pith.science/paper/FMINR5QZ"},"agent_actions":{"view_html":"https://pith.science/pith/FMINR5QZBGTDIX6BZURV3RLKQP","download_json":"https://pith.science/pith/FMINR5QZBGTDIX6BZURV3RLKQP.json","view_paper":"https://pith.science/paper/FMINR5QZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.09266&json=true","fetch_graph":"https://pith.science/api/pith-number/FMINR5QZBGTDIX6BZURV3RLKQP/graph.json","fetch_events":"https://pith.science/api/pith-number/FMINR5QZBGTDIX6BZURV3RLKQP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FMINR5QZBGTDIX6BZURV3RLKQP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FMINR5QZBGTDIX6BZURV3RLKQP/action/storage_attestation","attest_author":"https://pith.science/pith/FMINR5QZBGTDIX6BZURV3RLKQP/action/author_attestation","sign_citation":"https://pith.science/pith/FMINR5QZBGTDIX6BZURV3RLKQP/action/citation_signature","submit_replication":"https://pith.science/pith/FMINR5QZBGTDIX6BZURV3RLKQP/action/replication_record"}},"created_at":"2026-05-18T00:07:01.871822+00:00","updated_at":"2026-05-18T00:07:01.871822+00:00"}