.png){kind=icon}
.png){kind=icon}
Return
A Resource Efficient Ising Model-Based Quantum Sudoku Solver
.png){kind=icon}
OA
AI
DOI：10.1002/spe.70063.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Quantum algorithms exploit superposition and parallelism to address complex combinatorial problems, many of which fall into the non-polynomial (NP) class. Sudoku, a widely known logic-based puzzle, is proven to be NP-complete and thus presents a suitable testbed for exploring quantum optimization approaches. The Ising model—originally introduced for NP-hard Ising spin glass problems—provides a natural mathematical framework for expressing constraints in a form amenable to quantum computation.
Keywords:
COBYLA
Hamiltonian energy
Ising models
NP
optimization
QAOA
quantum
Sudoku
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
S
IF:
0
Papers:
31
Citations:
0
Organization
View more organizations