{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SMECQPATAHE74RWHMQHXXMLR3T","short_pith_number":"pith:SMECQPAT","schema_version":"1.0","canonical_sha256":"9308283c1301c9fe46c7640f7bb171dcf39cded35e609423eb6e812f105306dc","source":{"kind":"arxiv","id":"2411.04120","version":1},"attestation_state":"computed","paper":{"title":"Second order cone relaxations for quantum Max Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Felix Huber, Kevin Thompson, Ojas Parekh, Sevag Gharibian","submitted_at":"2024-11-06T18:54:26Z","abstract_excerpt":"Quantum Max Cut (QMC), also known as the quantum anti-ferromagnetic Heisenberg model, is a QMA-complete problem relevant to quantum many-body physics and computer science. Semidefinite programming relaxations have been fruitful in designing theoretical approximation algorithms for QMC, but are computationally expensive for systems beyond tens of qubits. We give a second order cone relaxation for QMC, which optimizes over the set of mutually consistent three-qubit reduced density matrices. In combination with Pauli level-$1$ of the quantum Lasserre hierarchy, the relaxation achieves an approxim"},"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":"2411.04120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-06T18:54:26Z","cross_cats_sorted":[],"title_canon_sha256":"111c1d60655725e85db00d2dba042a26adf3741308e13dd36e05f2784f163485","abstract_canon_sha256":"9219ea17577cd9e216932b9172ceaa58237a5c6664d0e18f68f385e4b22ee4f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:32:01.354058Z","signature_b64":"nR5BKyrKb3iH2bVCVkhJBD8jZTj7dxkVnAQF64Qd4FyJzbYI99v9/wgerW+8ogPH7yhzUMhH8SX/YoMUKWNKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9308283c1301c9fe46c7640f7bb171dcf39cded35e609423eb6e812f105306dc","last_reissued_at":"2026-07-05T09:32:01.353564Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:32:01.353564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Second order cone relaxations for quantum Max Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Felix Huber, Kevin Thompson, Ojas Parekh, Sevag Gharibian","submitted_at":"2024-11-06T18:54:26Z","abstract_excerpt":"Quantum Max Cut (QMC), also known as the quantum anti-ferromagnetic Heisenberg model, is a QMA-complete problem relevant to quantum many-body physics and computer science. Semidefinite programming relaxations have been fruitful in designing theoretical approximation algorithms for QMC, but are computationally expensive for systems beyond tens of qubits. We give a second order cone relaxation for QMC, which optimizes over the set of mutually consistent three-qubit reduced density matrices. In combination with Pauli level-$1$ of the quantum Lasserre hierarchy, the relaxation achieves an approxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.04120","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/2411.04120/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":"2411.04120","created_at":"2026-07-05T09:32:01.353624+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.04120v1","created_at":"2026-07-05T09:32:01.353624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.04120","created_at":"2026-07-05T09:32:01.353624+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMECQPATAHE7","created_at":"2026-07-05T09:32:01.353624+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMECQPATAHE74RWH","created_at":"2026-07-05T09:32:01.353624+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMECQPAT","created_at":"2026-07-05T09:32:01.353624+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27224","citing_title":"A 0.651-approximation to quantum Max Cut via Rydberg atoms","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09728","citing_title":"Quantum Cut Sparsifiers","ref_index":107,"is_internal_anchor":false},{"citing_arxiv_id":"2606.04940","citing_title":"Convergence rates of Sum-of-Hermitian-Squares Hierarchies for the Pauli algebra","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14994","citing_title":"Sharp Bounds on the Eigenvalues of Kikuchi Graphs and Applications to Quantum Max Cut","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SMECQPATAHE74RWHMQHXXMLR3T","json":"https://pith.science/pith/SMECQPATAHE74RWHMQHXXMLR3T.json","graph_json":"https://pith.science/api/pith-number/SMECQPATAHE74RWHMQHXXMLR3T/graph.json","events_json":"https://pith.science/api/pith-number/SMECQPATAHE74RWHMQHXXMLR3T/events.json","paper":"https://pith.science/paper/SMECQPAT"},"agent_actions":{"view_html":"https://pith.science/pith/SMECQPATAHE74RWHMQHXXMLR3T","download_json":"https://pith.science/pith/SMECQPATAHE74RWHMQHXXMLR3T.json","view_paper":"https://pith.science/paper/SMECQPAT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.04120&json=true","fetch_graph":"https://pith.science/api/pith-number/SMECQPATAHE74RWHMQHXXMLR3T/graph.json","fetch_events":"https://pith.science/api/pith-number/SMECQPATAHE74RWHMQHXXMLR3T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMECQPATAHE74RWHMQHXXMLR3T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMECQPATAHE74RWHMQHXXMLR3T/action/storage_attestation","attest_author":"https://pith.science/pith/SMECQPATAHE74RWHMQHXXMLR3T/action/author_attestation","sign_citation":"https://pith.science/pith/SMECQPATAHE74RWHMQHXXMLR3T/action/citation_signature","submit_replication":"https://pith.science/pith/SMECQPATAHE74RWHMQHXXMLR3T/action/replication_record"}},"created_at":"2026-07-05T09:32:01.353624+00:00","updated_at":"2026-07-05T09:32:01.353624+00:00"}