{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7O23GNPYWU7FOKVKEUOWL3WD6E","short_pith_number":"pith:7O23GNPY","schema_version":"1.0","canonical_sha256":"fbb5b335f8b53e572aaa251d65eec3f12d6685c203c205578b46e89568d41fd4","source":{"kind":"arxiv","id":"2312.11253","version":1},"attestation_state":"computed","paper":{"title":"Quantum Computing Inspired Iterative Refinement for Semidefinite Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Brandon Augustino, Mohammadhossein Mohammadisiahroudi, Pouya Sampourmahani, Tam\\'as Terlaky","submitted_at":"2023-12-18T14:51:15Z","abstract_excerpt":"Iterative Refinement (IR) is a classical computing technique for obtaining highly precise solutions to linear systems of equations, as well as linear optimization problems. In this paper, motivated by the limited precision of quantum solvers, we develop the first IR scheme for solving semidefinite optimization (SDO) problems and explore two major impacts of the proposed IR scheme. First, we prove that the proposed IR scheme exhibits quadratic convergence toward an optimal solution without any assumption on problem characteristics. We also show that using IR with Quantum Interior Point Methods "},"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":"2312.11253","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-12-18T14:51:15Z","cross_cats_sorted":[],"title_canon_sha256":"d53f9c41405bbbc1ea3a35c5c58b7723c8fc6896c691b07234458193bcfb32bd","abstract_canon_sha256":"1cc7599ba50607f38721a23deeb1d8bc515af9cb56f52dc13cbd9b62caf53ee5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:25:30.467589Z","signature_b64":"1ujo2wh6S/gDbbS5sW8j3t2VfNGe0fkgK19vzGhijzBiFoJPZ7zV3Qpihvz8FhFK9TW9QV83BvbR0v3uy4n1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbb5b335f8b53e572aaa251d65eec3f12d6685c203c205578b46e89568d41fd4","last_reissued_at":"2026-07-05T07:25:30.467090Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:25:30.467090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Computing Inspired Iterative Refinement for Semidefinite Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Brandon Augustino, Mohammadhossein Mohammadisiahroudi, Pouya Sampourmahani, Tam\\'as Terlaky","submitted_at":"2023-12-18T14:51:15Z","abstract_excerpt":"Iterative Refinement (IR) is a classical computing technique for obtaining highly precise solutions to linear systems of equations, as well as linear optimization problems. In this paper, motivated by the limited precision of quantum solvers, we develop the first IR scheme for solving semidefinite optimization (SDO) problems and explore two major impacts of the proposed IR scheme. First, we prove that the proposed IR scheme exhibits quadratic convergence toward an optimal solution without any assumption on problem characteristics. We also show that using IR with Quantum Interior Point Methods "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.11253","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.11253/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":"2312.11253","created_at":"2026-07-05T07:25:30.467147+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.11253v1","created_at":"2026-07-05T07:25:30.467147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.11253","created_at":"2026-07-05T07:25:30.467147+00:00"},{"alias_kind":"pith_short_12","alias_value":"7O23GNPYWU7F","created_at":"2026-07-05T07:25:30.467147+00:00"},{"alias_kind":"pith_short_16","alias_value":"7O23GNPYWU7FOKVK","created_at":"2026-07-05T07:25:30.467147+00:00"},{"alias_kind":"pith_short_8","alias_value":"7O23GNPY","created_at":"2026-07-05T07:25:30.467147+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.15977","citing_title":"A quantum dual logarithmic barrier method for linear optimization","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7O23GNPYWU7FOKVKEUOWL3WD6E","json":"https://pith.science/pith/7O23GNPYWU7FOKVKEUOWL3WD6E.json","graph_json":"https://pith.science/api/pith-number/7O23GNPYWU7FOKVKEUOWL3WD6E/graph.json","events_json":"https://pith.science/api/pith-number/7O23GNPYWU7FOKVKEUOWL3WD6E/events.json","paper":"https://pith.science/paper/7O23GNPY"},"agent_actions":{"view_html":"https://pith.science/pith/7O23GNPYWU7FOKVKEUOWL3WD6E","download_json":"https://pith.science/pith/7O23GNPYWU7FOKVKEUOWL3WD6E.json","view_paper":"https://pith.science/paper/7O23GNPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.11253&json=true","fetch_graph":"https://pith.science/api/pith-number/7O23GNPYWU7FOKVKEUOWL3WD6E/graph.json","fetch_events":"https://pith.science/api/pith-number/7O23GNPYWU7FOKVKEUOWL3WD6E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7O23GNPYWU7FOKVKEUOWL3WD6E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7O23GNPYWU7FOKVKEUOWL3WD6E/action/storage_attestation","attest_author":"https://pith.science/pith/7O23GNPYWU7FOKVKEUOWL3WD6E/action/author_attestation","sign_citation":"https://pith.science/pith/7O23GNPYWU7FOKVKEUOWL3WD6E/action/citation_signature","submit_replication":"https://pith.science/pith/7O23GNPYWU7FOKVKEUOWL3WD6E/action/replication_record"}},"created_at":"2026-07-05T07:25:30.467147+00:00","updated_at":"2026-07-05T07:25:30.467147+00:00"}