A More Convex Ising Formulation of Max-3-Cut Using Higher-Order Spin Interactions
Robbe De Prins, Guy Van der Sande, Peter Bienstman, and Thomas Van Vaerenbergh

TL;DR
This paper introduces a higher-order Ising formulation for Max-3-Cut that results in smoother energy landscapes and faster optimization on Ising machines, outperforming traditional binary encodings.
Contribution
It proposes a novel higher-order Ising formulation for Max-3-Cut that maintains valid configurations under single-spin updates and improves optimization efficiency.
Findings
Higher-order formulation yields smoother energy landscapes.
Significantly faster solutions on Ising machines compared to baseline.
Empirical parameter tuning can approach higher-order performance.
Abstract
Many combinatorial optimization problems (COPs) are naturally expressed using variables that take on more than two discrete values. To solve such problems using Ising machines (IMs) - specialized analog or digital devices designed to solve COPs efficiently - these multi-valued integers must be encoded using binary spin variables. A common approach is one-hot encoding, where each variable is represented by a group of spins constrained so that exactly one spin is in the "up" state. However, this encoding introduces energy barriers: changing an integer's value requires flipping two spins and passing through an invalid intermediate state. This creates rugged energy landscapes that may hinder optimization. We propose a higher-order Ising formulation for Max-3-Cut, which is the smallest fundamental COP with multi-valued integer variables. Our formulation preserves valid configurations under…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · DNA and Biological Computing · Complexity and Algorithms in Graphs
