Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.03508

The Complexity of Recognizing SDP Exactness for the Maximum Cut Problem

Avinash Bhardwaj
View original source ↗Read source document ↗Export metadata ↓

Abstract

The standard semidefinite programming (SDP) relaxation of Max-Cut is exact when its optimum equals the maximum cut value. Delorme and Poljak proved NP-completeness of recognizing exactness for weighted graphs and left the unweighted case open. We prove that recognizing exactness is NP-complete even for connected simple unweighted graphs, and hence strongly NP-complete for graphs with nonnegative integer weights. The reduction represents the clauses of a linear monotone NAE-4-SAT instance by edge-disjoint copies of $K_6$. An explicit vector assignment attains a common SDP bound, and the additive integrality gap equals the minimum number of unsatisfied clauses. Hardness persists for simple unweighted graphs when an exact rational optimal primal--dual pair is supplied. Shared simplex anchors establish strong NP-hardness of recognizing exactness of the Frieze--Jerrum Max-$k$-Cut SDP relaxation for every fixed $k\ge3$, even for connected graphs with nonnegative integer edge weights. We also give an independent bounded-weight sum-of-squares proof of strong NP-completeness of recognizing exactness of the Max-Cut SDP, together with gap-preserving reductions establishing strong NP-completeness of exactness recognition for a basic Max-DiCut SDP and NP-hardness for a Max-Bisection SDP.

Explore related subjects

math.OCcs.CC

Keep this discovery

BibTeXRIS

Avinash Bhardwaj. 2026-09-08. The Complexity of Recognizing SDP Exactness for the Maximum Cut Problem. https://arxiv.org/abs/2609.03508

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.CC subjectmath.OC subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

A note on the $Σ_2^P$-completeness of the Frobenius number

Given a finite set $A$ of natural numbers whose greatest common divisor is one, the Frobenius number $g(A)$ is the largest integer that is not a non-negative integer combination of the numbers in $A$. In a 2016 preprint, Matsubara states that given $A$ and $k$, deciding if $g(A) \geq k$ is $Σ_2^P$-complete. A decade has passed since without peer-reviewed publication of this result. At the same time, the community has found it difficult to verify this result. In this note, we give a write-up of the completeness proof based on Matsubara (2016).

cs.CC↗
arXiv2023

Local minima in quantum systems

Finding ground states of quantum many-body systems is known to be hard for both classical and quantum computers. As a result, when Nature cools a quantum system in a low-temperature thermal bath, the ground state cannot always be found efficiently. Instead, Nature finds a local minimum of the energy. In this work, we study the problem of finding local minima in quantum systems under thermal perturbations. While local minima are much easier to find than ground states, we show that finding a local minimum is computationally hard for classical computers, even when the task is to output a single-qubit observable at any local minimum. In contrast, we prove that a quantum computer can always find a local minimum efficiently using a thermal gradient descent algorithm that mimics the cooling process in Nature. To establish the classical hardness of finding local minima, we consider a family of two-dimensional Hamiltonians such that any problem solvable by polynomial-time quantum algorithms can be reduced to finding ground states of these Hamiltonians. We prove that for such Hamiltonians, all local minima are global minima. Therefore, assuming quantum computation is more powerful than classical computation, finding local minima is classically hard and quantumly easy.

quant-ph↗
arXiv2026

Convex optimization on moment polytopes: Hadamard mirror descent and efficient algorithms for quantum functionals and other tensor parameters

Convex optimization on polytopes arises in many areas of science. When the polytope is given implicitly or has exponentially many vertices and facets, standard methods may not apply or be ineffective. This is the case for moment polytopes, such as the entanglement polytopes, which play a foundational role in quantum information and algebraic complexity. They give rise to important entanglement measures and tensor parameters such as the quantum functionals, yet general effective methods for computing these quantities have been elusive. In this paper we address this challenge. We develop a first-order framework called Hadamard mirror descent to optimize suitable convex functions over moment polytopes and, more generally, the gradient sets of geodesically convex functions. It operates locally and does not rely on any explicit description of the polytope. Our framework extends mirror descent, an effective and widely used framework for convex optimization, from the Euclidean setting to Hadamard manifolds, and is motivated by a recent work by Hirai, which we interpret as a Hadamard version of mirror flow. Applying the framework to entanglement polytopes yields the first efficient first-order algorithms to compute the quantum functionals, the symmetric quantum functional, and the G-stable ranks, as well as a new direct algorithm for the non-commutative rank.

cs.CC↗