{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:GHFWTKTZHUH2457UMBTDDRSO2O","short_pith_number":"pith:GHFWTKTZ","schema_version":"1.0","canonical_sha256":"31cb69aa793d0fae77f4606631c64ed3870f08cb47719cea297ba153b670d666","source":{"kind":"arxiv","id":"2207.11154","version":2},"attestation_state":"computed","paper":{"title":"A Faster Quantum Algorithm for Semidefinite Programming via Robust IPM Framework","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Baihe Huang, Ruizhe Zhang, Runzhou Tao, Shunhua Jiang, Zhao Song","submitted_at":"2022-07-22T15:51:02Z","abstract_excerpt":"This paper studies a fundamental problem in convex optimization, which is to solve semidefinite programming (SDP) with high accuracy. This paper follows from the existing robust SDP-based interior point method analysis due to [Huang, Jiang, Song, Tao and Zhang, FOCS 2022]. While, the previous work only provides an efficient implementation in the classical setting. This work provides a novel quantum implementation.\n  We give a quantum second-order algorithm with high-accuracy in both the optimality and the feasibility of its output, and its running time depending on $\\log(1/\\epsilon)$ on well-c"},"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":"2207.11154","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-07-22T15:51:02Z","cross_cats_sorted":[],"title_canon_sha256":"949cc26459693f27d583e95f9ba740983a560390b10babaa333b73c5fdd87747","abstract_canon_sha256":"2006791915e6fe3f13610944b9bd8fc6d267ce0d748ebebe532729592fda16d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:39:17.238974Z","signature_b64":"4wkG2ZtpSiTJqreP887YocDruzKNTAvzslqE6qiJ9Ty0vZF9QoowMWZB/LEVvVzRLgCOhhK4vG7xu6dFO8G3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31cb69aa793d0fae77f4606631c64ed3870f08cb47719cea297ba153b670d666","last_reissued_at":"2026-07-05T05:39:17.238577Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:39:17.238577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Faster Quantum Algorithm for Semidefinite Programming via Robust IPM Framework","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Baihe Huang, Ruizhe Zhang, Runzhou Tao, Shunhua Jiang, Zhao Song","submitted_at":"2022-07-22T15:51:02Z","abstract_excerpt":"This paper studies a fundamental problem in convex optimization, which is to solve semidefinite programming (SDP) with high accuracy. This paper follows from the existing robust SDP-based interior point method analysis due to [Huang, Jiang, Song, Tao and Zhang, FOCS 2022]. While, the previous work only provides an efficient implementation in the classical setting. This work provides a novel quantum implementation.\n  We give a quantum second-order algorithm with high-accuracy in both the optimality and the feasibility of its output, and its running time depending on $\\log(1/\\epsilon)$ on well-c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.11154","kind":"arxiv","version":2},"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/2207.11154/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":"2207.11154","created_at":"2026-07-05T05:39:17.238641+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.11154v2","created_at":"2026-07-05T05:39:17.238641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.11154","created_at":"2026-07-05T05:39:17.238641+00:00"},{"alias_kind":"pith_short_12","alias_value":"GHFWTKTZHUH2","created_at":"2026-07-05T05:39:17.238641+00:00"},{"alias_kind":"pith_short_16","alias_value":"GHFWTKTZHUH2457U","created_at":"2026-07-05T05:39:17.238641+00:00"},{"alias_kind":"pith_short_8","alias_value":"GHFWTKTZ","created_at":"2026-07-05T05:39:17.238641+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.20141","citing_title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GHFWTKTZHUH2457UMBTDDRSO2O","json":"https://pith.science/pith/GHFWTKTZHUH2457UMBTDDRSO2O.json","graph_json":"https://pith.science/api/pith-number/GHFWTKTZHUH2457UMBTDDRSO2O/graph.json","events_json":"https://pith.science/api/pith-number/GHFWTKTZHUH2457UMBTDDRSO2O/events.json","paper":"https://pith.science/paper/GHFWTKTZ"},"agent_actions":{"view_html":"https://pith.science/pith/GHFWTKTZHUH2457UMBTDDRSO2O","download_json":"https://pith.science/pith/GHFWTKTZHUH2457UMBTDDRSO2O.json","view_paper":"https://pith.science/paper/GHFWTKTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.11154&json=true","fetch_graph":"https://pith.science/api/pith-number/GHFWTKTZHUH2457UMBTDDRSO2O/graph.json","fetch_events":"https://pith.science/api/pith-number/GHFWTKTZHUH2457UMBTDDRSO2O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GHFWTKTZHUH2457UMBTDDRSO2O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GHFWTKTZHUH2457UMBTDDRSO2O/action/storage_attestation","attest_author":"https://pith.science/pith/GHFWTKTZHUH2457UMBTDDRSO2O/action/author_attestation","sign_citation":"https://pith.science/pith/GHFWTKTZHUH2457UMBTDDRSO2O/action/citation_signature","submit_replication":"https://pith.science/pith/GHFWTKTZHUH2457UMBTDDRSO2O/action/replication_record"}},"created_at":"2026-07-05T05:39:17.238641+00:00","updated_at":"2026-07-05T05:39:17.238641+00:00"}