{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4NHJBL4MQJZRH7CNVJS6HEZVB3","short_pith_number":"pith:4NHJBL4M","schema_version":"1.0","canonical_sha256":"e34e90af8c827313fc4daa65e393350ec9e0c227c81d736b62a3b55fa68ca55b","source":{"kind":"arxiv","id":"2310.07774","version":1},"attestation_state":"computed","paper":{"title":"Quantum Semidefinite Programming with Thermal Pure Quantum States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Luuk Coopmans, Oscar Watts, Yuta Kikuchi","submitted_at":"2023-10-11T18:00:53Z","abstract_excerpt":"Semidefinite programs (SDPs) are a particular class of convex optimization problems with applications in combinatorial optimization, operational research, and quantum information science. Seminal work by Brand\\~{a}o and Svore shows that a ``quantization'' of the matrix multiplicative-weight algorithm can provide approximate solutions to SDPs quadratically faster than the best classical algorithms by using a quantum computer as a Gibbs-state sampler. We propose a modification of this quantum algorithm and show that a similar speedup can be obtained by replacing the Gibbs-state sampler with the "},"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":"2310.07774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-10-11T18:00:53Z","cross_cats_sorted":[],"title_canon_sha256":"b3ac711f84969d3bd5ffb1cd9453623d876fb8a7c749b55542093e4533e91152","abstract_canon_sha256":"78a583920d59c37b85cd530c1bf60628af6999b60d24c37b3a6b57a6c83270f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:59:56.195894Z","signature_b64":"VsuVCYaW6SwOlLrMjTwOdE7O44jkJXmMg4pBAK2tPlOHtYKqM5jHbtwWKWzbfH5bCk3owM7yPDIVSmGggHtnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e34e90af8c827313fc4daa65e393350ec9e0c227c81d736b62a3b55fa68ca55b","last_reissued_at":"2026-07-05T06:59:56.195408Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:59:56.195408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Semidefinite Programming with Thermal Pure Quantum States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Luuk Coopmans, Oscar Watts, Yuta Kikuchi","submitted_at":"2023-10-11T18:00:53Z","abstract_excerpt":"Semidefinite programs (SDPs) are a particular class of convex optimization problems with applications in combinatorial optimization, operational research, and quantum information science. Seminal work by Brand\\~{a}o and Svore shows that a ``quantization'' of the matrix multiplicative-weight algorithm can provide approximate solutions to SDPs quadratically faster than the best classical algorithms by using a quantum computer as a Gibbs-state sampler. We propose a modification of this quantum algorithm and show that a similar speedup can be obtained by replacing the Gibbs-state sampler with the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.07774","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/2310.07774/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":"2310.07774","created_at":"2026-07-05T06:59:56.195468+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.07774v1","created_at":"2026-07-05T06:59:56.195468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.07774","created_at":"2026-07-05T06:59:56.195468+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NHJBL4MQJZR","created_at":"2026-07-05T06:59:56.195468+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NHJBL4MQJZRH7CN","created_at":"2026-07-05T06:59:56.195468+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NHJBL4M","created_at":"2026-07-05T06:59:56.195468+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27508","citing_title":"I-QMapper: Error-Aware Layout Optimization and Device Diagnostics for NISQ Hardware","ref_index":271,"is_internal_anchor":false},{"citing_arxiv_id":"2508.09103","citing_title":"Constrained free energy minimization for the design of thermal states and stabilizer thermodynamic systems","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12614","citing_title":"A Quantum Multi-Programming Framework to Maximize Quantum Resources for the LUCJ Ansatz","ref_index":257,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4NHJBL4MQJZRH7CNVJS6HEZVB3","json":"https://pith.science/pith/4NHJBL4MQJZRH7CNVJS6HEZVB3.json","graph_json":"https://pith.science/api/pith-number/4NHJBL4MQJZRH7CNVJS6HEZVB3/graph.json","events_json":"https://pith.science/api/pith-number/4NHJBL4MQJZRH7CNVJS6HEZVB3/events.json","paper":"https://pith.science/paper/4NHJBL4M"},"agent_actions":{"view_html":"https://pith.science/pith/4NHJBL4MQJZRH7CNVJS6HEZVB3","download_json":"https://pith.science/pith/4NHJBL4MQJZRH7CNVJS6HEZVB3.json","view_paper":"https://pith.science/paper/4NHJBL4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.07774&json=true","fetch_graph":"https://pith.science/api/pith-number/4NHJBL4MQJZRH7CNVJS6HEZVB3/graph.json","fetch_events":"https://pith.science/api/pith-number/4NHJBL4MQJZRH7CNVJS6HEZVB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NHJBL4MQJZRH7CNVJS6HEZVB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NHJBL4MQJZRH7CNVJS6HEZVB3/action/storage_attestation","attest_author":"https://pith.science/pith/4NHJBL4MQJZRH7CNVJS6HEZVB3/action/author_attestation","sign_citation":"https://pith.science/pith/4NHJBL4MQJZRH7CNVJS6HEZVB3/action/citation_signature","submit_replication":"https://pith.science/pith/4NHJBL4MQJZRH7CNVJS6HEZVB3/action/replication_record"}},"created_at":"2026-07-05T06:59:56.195468+00:00","updated_at":"2026-07-05T06:59:56.195468+00:00"}