A Quantum-Inspired Algorithm for Solving Sudoku Puzzles and the MaxCut Problem
Max B. Zhao, Fei Li

TL;DR
This paper introduces a quantum-inspired algorithm using Matrix Product States and DMRG to efficiently solve large QUBO problems, including Sudoku puzzles and MaxCut instances, demonstrating scalability and effectiveness.
Contribution
The paper presents a novel quantum-inspired algorithm employing MPS and DMRG for solving large QUBO problems, extending applicability to complex puzzles and optimization tasks.
Findings
Successfully solved Sudoku puzzles with over 200 spins
Solved MaxCut instances with up to 251 nodes and 3,265 edges
Demonstrated scalability and reliability of the heuristic algorithm
Abstract
We propose and evaluate a quantum-inspired algorithm for solving Quadratic Unconstrained Binary Optimization (QUBO) problems, which are mathematically equivalent to finding ground states of Ising spin-glass Hamiltonians. The algorithm employs Matrix Product States (MPS) to compactly represent large superpositions of spin configurations and utilizes a discrete driving schedule to guide the MPS toward the ground state. At each step, a driver Hamiltonian -- incorporating a transverse magnetic field -- is combined with the problem Hamiltonian to enable spin flips and facilitate quantum tunneling. The MPS is updated using the standard Density Matrix Renormalization Group (DMRG) method, which iteratively minimizes the system's energy via multiple sweeps across the spin chain. Despite its heuristic nature, the algorithm reliably identifies global minima, not merely near-optimal solutions,…
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
Topicsgraph theory and CDMA systems · Quantum Computing Algorithms and Architecture · DNA and Biological Computing
