An improved quantum max cut approximation via maximum matching

DOI10.4230/LIPICS.ICALP.2024.105MaRDI QIDQ6875086zbMATH OpenFDO

Authors Ojas Parekh

Publication date 14 January 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2024.105

zbMATH Keywords

approximationlocal HamiltonianmatchingoptimizationroundingSDP

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
• Grothendieck inequalities for semidefinite programs with rank constraint
• scientific article; zbMATH DE number 7651034 (Why is no real title available?)
• scientific article; zbMATH DE number 7650098 (Why is no real title available?)
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Maximum matching and a polyhedron with 0,1-vertices
• Optimizing quantum circuit parameters via SDP
• Quantum Hamiltonian Complexity

Cited in

(4)

• Monogamy of highly symmetric states
• Classical algorithms for constant approximation of the ground state energy of local Hamiltonians
• Improved algorithms for quantum MaxCut via partially entangled matchings
• Improved approximation algorithms for the EPR Hamiltonian

This page was built for publication: An improved quantum max cut approximation via maximum matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875086)