{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4DHCEOIOAIKZTL5XGLQAIJY6FU","short_pith_number":"pith:4DHCEOIO","schema_version":"1.0","canonical_sha256":"e0ce22390e021599afb732e004271e2d3defeb8d7fa76604405b00df23f4e3d9","source":{"kind":"arxiv","id":"2504.15276","version":1},"attestation_state":"computed","paper":{"title":"Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anuj Apte, Eunou Lee, James Sud, Kunal Marwaha, Ojas Parekh","submitted_at":"2025-04-21T17:59:02Z","abstract_excerpt":"We introduce a $0.611$-approximation algorithm for Quantum MaxCut and a $\\frac{1+\\sqrt{5}}{4} \\approx 0.809$-approximation algorithm for the EPR Hamiltonian of [arXiv:2209.02589]. A novel ingredient in both of these algorithms is to partially entangle pairs of qubits associated to edges in a matching, while preserving the direction of their single-qubit Bloch vectors. This allows us to interpolate between product states and matching-based states with a tunable parameter."},"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":"2504.15276","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-21T17:59:02Z","cross_cats_sorted":[],"title_canon_sha256":"4fd325993423c8ede9204b93a28795c84df50e5b8b7f090b0757077dbf35b83e","abstract_canon_sha256":"89833882e0b976ccc73edb507c054f71d8ee3c25ee4687c9366b22cdd3e3a6ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:51:59.160069Z","signature_b64":"gfaddO5D7cdUtFPsRvOKxs3h26kgNg+LSCvDrArIs/RhqmiRs4N5CpSxb7hYe0hSbtjtSnx/SIkNugweRC8rCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0ce22390e021599afb732e004271e2d3defeb8d7fa76604405b00df23f4e3d9","last_reissued_at":"2026-07-05T10:51:59.159581Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:51:59.159581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anuj Apte, Eunou Lee, James Sud, Kunal Marwaha, Ojas Parekh","submitted_at":"2025-04-21T17:59:02Z","abstract_excerpt":"We introduce a $0.611$-approximation algorithm for Quantum MaxCut and a $\\frac{1+\\sqrt{5}}{4} \\approx 0.809$-approximation algorithm for the EPR Hamiltonian of [arXiv:2209.02589]. A novel ingredient in both of these algorithms is to partially entangle pairs of qubits associated to edges in a matching, while preserving the direction of their single-qubit Bloch vectors. This allows us to interpolate between product states and matching-based states with a tunable parameter."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15276","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/2504.15276/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":"2504.15276","created_at":"2026-07-05T10:51:59.159640+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.15276v1","created_at":"2026-07-05T10:51:59.159640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15276","created_at":"2026-07-05T10:51:59.159640+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DHCEOIOAIKZ","created_at":"2026-07-05T10:51:59.159640+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DHCEOIOAIKZTL5X","created_at":"2026-07-05T10:51:59.159640+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DHCEOIO","created_at":"2026-07-05T10:51:59.159640+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09728","citing_title":"Quantum Cut Sparsifiers","ref_index":103,"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":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4DHCEOIOAIKZTL5XGLQAIJY6FU","json":"https://pith.science/pith/4DHCEOIOAIKZTL5XGLQAIJY6FU.json","graph_json":"https://pith.science/api/pith-number/4DHCEOIOAIKZTL5XGLQAIJY6FU/graph.json","events_json":"https://pith.science/api/pith-number/4DHCEOIOAIKZTL5XGLQAIJY6FU/events.json","paper":"https://pith.science/paper/4DHCEOIO"},"agent_actions":{"view_html":"https://pith.science/pith/4DHCEOIOAIKZTL5XGLQAIJY6FU","download_json":"https://pith.science/pith/4DHCEOIOAIKZTL5XGLQAIJY6FU.json","view_paper":"https://pith.science/paper/4DHCEOIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.15276&json=true","fetch_graph":"https://pith.science/api/pith-number/4DHCEOIOAIKZTL5XGLQAIJY6FU/graph.json","fetch_events":"https://pith.science/api/pith-number/4DHCEOIOAIKZTL5XGLQAIJY6FU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DHCEOIOAIKZTL5XGLQAIJY6FU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DHCEOIOAIKZTL5XGLQAIJY6FU/action/storage_attestation","attest_author":"https://pith.science/pith/4DHCEOIOAIKZTL5XGLQAIJY6FU/action/author_attestation","sign_citation":"https://pith.science/pith/4DHCEOIOAIKZTL5XGLQAIJY6FU/action/citation_signature","submit_replication":"https://pith.science/pith/4DHCEOIOAIKZTL5XGLQAIJY6FU/action/replication_record"}},"created_at":"2026-07-05T10:51:59.159640+00:00","updated_at":"2026-07-05T10:51:59.159640+00:00"}