REVIEW 1 cited by
Approximation algorithms for noncommutative CSPs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Noncommutative constraint satisfaction problems (NC-CSPs) are higher-dimensional operator extensions of classical CSPs. Despite their significance in quantum information, their approximability remains largely unexplored. A notable example of a noncommutative CSP that is not solvable in polynomial time is NC-Max-$3$-Cut. We present a $0.864$-approximation algorithm for this problem. Our approach extends to a broader class of both classical and noncommutative CSPs. We introduce three key concepts: approximate isometry, relative distribution, and $\ast$-anticommutation, which may be of independent interest.
Forward citations
Cited by 1 Pith paper
-
Approximate quantum 3-colorings of graphs and the quantum Max 3-Cut problem
This paper proves quantitative preservation of approximate winning strategies between arbitrary synchronous games and graph 3-coloring games, but its undecidability applications rely on an instance-dependent threshold...
Discussion (0). Continue with ORCID to comment.