Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Software Practice and Experience

A Resource Efficient Ising Model‐Based Quantum Sudoku Solver

Wen-Li Wang, Mei-Huei Tang, Kevin Wang, Muhammad Abdul Basit, Yuan Tian, Md Sanaul Haque

Published Mar 15, 2026• 2 citations
Publisher

Abstract

ABSTRACT Background 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. Objective This work aims to develop a quantum Sudoku solver inspired by the Ising model that minimizes the number of logical qubits required, making it suitable for today's resource‐limited quantum hardware. The broader goal is to demonstrate a modeling strategy that may generalize to other NP optimization problems. Methods The solver construction begins by translating Sudoku constraints into mathematical expressions represented through couplings of atomic spins. These constraints are formulated into observable operators using Pauli operators, enabling the calculation of expectation values over candidate quantum states. Individual quantum algorithmic components are then integrated into a global optimization pipeline. The performance and correctness of this solver are evaluated through the Quantum Approximate Optimization Algorithm (QAOA) combined with the COBYLA classical optimizer within the IBM Qiskit SDK. A code example illustrates the implementation of multiple puzzle constraints and the verification of the resulting quantum circuits. Results The modeling approach successfully encodes Sudoku rules into an Ising Hamiltonian with reduced qubit requirements. Preliminary evaluations using QAOA and COBYLA demonstrate that the solver can identify puzzle‐consistent solutions while maintaining low resource consumption. The quantum circuit construction matches theoretical expectations, and the code snippet confirms successful constraint enforcement within the Qiskit environment. Conclusions The proposed quantum Sudoku solver highlights the potential of Ising‐based formulations to address NP optimization problems on near‐term quantum devices. By reducing logical qubit usage without sacrificing algorithmic integrity, this strategy may support broader applications in constrained optimization. The implementation serves as both a proof of concept and a practical guide for extending Ising‐inspired quantum modeling to other NP‐hard domains.

DOI
10.1002/spe.70063

Related papers

A Quantum-Inspired Algorithm for Solving Sudoku Puzzles and the MaxCut Problem †

Max Zhao, Fei Li

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, across diverse QUBO instances. We first demonstrate its effectiveness on intermediate-level Sudoku puzzles from publicly available sources, involving over 200 Ising spins with long-range couplings dictated by constraint satisfaction. We then apply the algorithm to MaxCut problems from the Biq Mac library, successfully solving instances with up to 251 nodes and 3,265 edges. We discuss the advantages of this quantum-inspired approach, including its scalability, generalizability, and suitability for industrial-scale QUBO applications.

arXiv:2510.19835•Quantum Information and Computation•Dec 1, 2025•2 citations

Analysis of Quantum Inspired AI for Grid-Based Puzzle Solving

Komal Dabber, Priyanka S Metgud, Hita Lakshmi

This research presents a Quantum-Inspired AI model designed to solve grid-based puzzles like Sudoku more efficiently. By combining classical AI techniques with quantum-inspired optimization methods such as QAOA and VQE, the model enhances problem-solving speed and accuracy. It integrates deep learning, reinforcement learning, and symbolic reasoning to mimic human cognitive processes. The system is capable of handling structured logic and adapting across various puzzle formats. Results show improved performance over traditional AI Models. This approach has a pplications in education, cybersecurity, and AI-assisted decision-making. The model also incorporates Quantum Neural Networks (QNNs) for better pattern recognition and learning in ambiguous or incomplete puzzle states. A modular framework built with tools like Qiskit and TensorFlow Quantum allows for easy experimentation and hybrid integration. Performance evaluations highlight gains in both computational efficiency and interpretability. The system demonstrates robustness across different puzzle complexities and constraint types. Its scalability and adaptability make it suitable for real-world problem-solving in logistics, planning, and intelligent tutoring systems.

International Journal Of Scientific Research In Engineering & Technology•Sep 3, 2025•0 citations

Constraint-Aware Quantum Optimization: Theoretical Foundations for Preserving Problem Structure in QUBO Formulations

Jeffrey Quinn Cordova

This paper establishes a theoretical framework for constraint-preserving quantum optimization that maintains problem structure throughout quantum algorithm execution, addressing a fundamental challenge in translating real-world optimization problems to quantum hardware. We develop mathematical formulations that embed hard constraints directly into quantum circuit design rather than relying solely on penalty methods, proving that certain constraint classes can be exactly enforced through quantum state space restriction. Our theory characterizes the complexity of constraint preservation across different problem classes including facility location, network optimization, and resource allocation, deriving conditions under which quantum algorithms can explore only feasible solution spaces. We introduce automated repair mechanisms with theoretical guarantees on convergence to valid solutions and establish bounds on the additional quantum resources required for constraint maintenance. The framework provides rigorous analysis of trade-offs between constraint flexibility, quantum circuit depth, and solution quality, identifying problem structures amenable to efficient constraint-preserving quantum formulations. We extend the theory to socioeconomic weighting and multi-objective scenarios, proving that preference structures can be incorporated without compromising feasibility guarantees. This theoretical foundation advances practical quantum optimization by ensuring quantum algorithms produce implementable solutions while maintaining provable performance characteristics across diverse constrained optimization domains including logistics, energy systems, and infrastructure planning.

•Nov 10, 2025•0 citations

Sudoku Solving Using Quantum Computer

Varun Singh, Varun Sharma, Vasu Bachchas , Deepanshu kaushik

We use ability of quantum computing such as superposition and entanglement to solve the sudoku. In recent years, quantum computers have shown promise as a new technology for solving complex problems in various fields, including optimization and cryptography. In this paper, we investigate the potential of quantum computers for solving Sudoku puzzles. We present a quantum algorithm for solving Sudoku puzzles, and compare its performance to classical algorithms. Our results show that the quantum algorithm outperforms classical algorithms in terms of both speed and accuracy, and provides a new tool for solving Sudoku puzzles efficiently. Additionally, we discuss the implications of our results for the development of quantum algorithms for solving other combinatorial problems.

Journal of Pharmaceutical Negative Results•Dec 31, 2022•2 citations

Application of Quantum Approximate Optimization Algorithm in Three- Dimensional Matching Problem

Jinyuan Dong, yao zhao, Zhiqiang Li +3 more

Abstract The three-dimensional matching problem is a classic NP-complete problem in combinatorial optimization, with wide applications in resource allocation, task scheduling, and many other practical scenarios. Traditional algorithms for solving the three-dimensional matching problem face the challenge of high time complexity, making it difficult to solve large-scale problems within a reasonable time frame. To improve the solution efficiency, a quantum circuit solution based on the Quantum Approximate Optimization Algorithm (QAOA) is proposed. By constructing a mathematical model of the three-dimensional matching problem, the corresponding Hamiltonian expression is derived. A QAOA-based quantum circuit is designed and the parameters of the parameterized quantum gates are optimized using the classical optimization algorithm COBYLA. Simulation experiments are performed using IBM's quantum development framework Qiskit. The experimental results show that the solution to the three-dimensional matching problem can be obtained with 84% probability in polynomial time, verifying the feasibility and effectiveness of solving the three-dimensional matching problem based on the Quantum Approximate Optimization Algorithm.

•May 26, 2025•0 citations

Sudoku Solving Using Quantum Computer

Varun Singh, Varun Sharma, Vasu Bachchas

Abstract: We use ability of quantum computing such as superposition and entanglement to solve the sudoku. In recent years, quantum computers have shown promise as a new technology for solving complex problems in various fields, including optimization and cryptography. In this paper, we investigate the potential of quantum computers for solving Sudoku puzzles. We present a quantum algorithm for solving Sudoku puzzles, and compare its performance to classical algorithms. Our results show that the quantum algorithm outperforms classical algorithms in terms of both speed and accuracy, and provides a new tool for solving Sudoku puzzles efficiently. Additionally, we discuss the implications of our results for the development of quantum algorithms for solving other combinatorial problems.

International Journal for Research in Applied Science and Engineering Technology•Feb 16, 2023•2 citations
ABSTRACT Background 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. Objective This work aims to develop a quantum Sudoku solver inspired by the Ising model that minimizes the number of logical qubits required, making it suitable for today's resource‐limited quantum hardware. The broader goal is to demonstrate a modeling strategy that may generalize to other NP optimization problems. Methods The solver construction begins by translating Sudoku constraints into mathematical expressions represented through couplings of atomic spins. These constraints are formulated into observable operators using Pauli operators, enabling the calculation of expectation values over candidate quantum states. Individual quantum algorithmic components are then integrated into a global optimization pipeline. The performance and correctness of this solver are evaluated through the Quantum Approximate Optimization Algorithm (QAOA) combined with the COBYLA classical optimizer within the IBM Qiskit SDK. A code example illustrates the implementation of multiple puzzle constraints and the verification of the resulting quantum circuits. Results The modeling approach successfully encodes Sudoku rules into an Ising Hamiltonian with reduced qubit requirements. Preliminary evaluations using QAOA and COBYLA demonstrate that the solver can identify puzzle‐consistent solutions while maintaining low resource consumption. The quantum circuit construction matches theoretical expectations, and the code snippet confirms successful constraint enforcement within the Qiskit environment. Conclusions The proposed quantum Sudoku solver highlights the potential of Ising‐based formulations to address NP optimization problems on near‐term quantum devices. By reducing logical qubit usage without sacrificing algorithmic integrity, this strategy may support broader applications in constrained optimization. The implementation serves as both a proof of concept and a practical guide for extending Ising‐inspired quantum modeling to other NP‐hard domains.
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, across diverse QUBO instances. We first demonstrate its effectiveness on intermediate-level Sudoku puzzles from publicly available sources, involving over 200 Ising spins with long-range couplings dictated by constraint satisfaction. We then apply the algorithm to MaxCut problems from the Biq Mac library, successfully solving instances with up to 251 nodes and 3,265 edges. We discuss the advantages of this quantum-inspired approach, including its scalability, generalizability, and suitability for industrial-scale QUBO applications.
This research presents a Quantum-Inspired AI model designed to solve grid-based puzzles like Sudoku more efficiently. By combining classical AI techniques with quantum-inspired optimization methods such as QAOA and VQE, the model enhances problem-solving speed and accuracy. It integrates deep learning, reinforcement learning, and symbolic reasoning to mimic human cognitive processes. The system is capable of handling structured logic and adapting across various puzzle formats. Results show improved performance over traditional AI Models. This approach has a pplications in education, cybersecurity, and AI-assisted decision-making. The model also incorporates Quantum Neural Networks (QNNs) for better pattern recognition and learning in ambiguous or incomplete puzzle states. A modular framework built with tools like Qiskit and TensorFlow Quantum allows for easy experimentation and hybrid integration. Performance evaluations highlight gains in both computational efficiency and interpretability. The system demonstrates robustness across different puzzle complexities and constraint types. Its scalability and adaptability make it suitable for real-world problem-solving in logistics, planning, and intelligent tutoring systems.
This paper establishes a theoretical framework for constraint-preserving quantum optimization that maintains problem structure throughout quantum algorithm execution, addressing a fundamental challenge in translating real-world optimization problems to quantum hardware. We develop mathematical formulations that embed hard constraints directly into quantum circuit design rather than relying solely on penalty methods, proving that certain constraint classes can be exactly enforced through quantum state space restriction. Our theory characterizes the complexity of constraint preservation across different problem classes including facility location, network optimization, and resource allocation, deriving conditions under which quantum algorithms can explore only feasible solution spaces. We introduce automated repair mechanisms with theoretical guarantees on convergence to valid solutions and establish bounds on the additional quantum resources required for constraint maintenance. The framework provides rigorous analysis of trade-offs between constraint flexibility, quantum circuit depth, and solution quality, identifying problem structures amenable to efficient constraint-preserving quantum formulations. We extend the theory to socioeconomic weighting and multi-objective scenarios, proving that preference structures can be incorporated without compromising feasibility guarantees. This theoretical foundation advances practical quantum optimization by ensuring quantum algorithms produce implementable solutions while maintaining provable performance characteristics across diverse constrained optimization domains including logistics, energy systems, and infrastructure planning.
We use ability of quantum computing such as superposition and entanglement to solve the sudoku. In recent years, quantum computers have shown promise as a new technology for solving complex problems in various fields, including optimization and cryptography. In this paper, we investigate the potential of quantum computers for solving Sudoku puzzles. We present a quantum algorithm for solving Sudoku puzzles, and compare its performance to classical algorithms. Our results show that the quantum algorithm outperforms classical algorithms in terms of both speed and accuracy, and provides a new tool for solving Sudoku puzzles efficiently. Additionally, we discuss the implications of our results for the development of quantum algorithms for solving other combinatorial problems.
Abstract The three-dimensional matching problem is a classic NP-complete problem in combinatorial optimization, with wide applications in resource allocation, task scheduling, and many other practical scenarios. Traditional algorithms for solving the three-dimensional matching problem face the challenge of high time complexity, making it difficult to solve large-scale problems within a reasonable time frame. To improve the solution efficiency, a quantum circuit solution based on the Quantum Approximate Optimization Algorithm (QAOA) is proposed. By constructing a mathematical model of the three-dimensional matching problem, the corresponding Hamiltonian expression is derived. A QAOA-based quantum circuit is designed and the parameters of the parameterized quantum gates are optimized using the classical optimization algorithm COBYLA. Simulation experiments are performed using IBM's quantum development framework Qiskit. The experimental results show that the solution to the three-dimensional matching problem can be obtained with 84% probability in polynomial time, verifying the feasibility and effectiveness of solving the three-dimensional matching problem based on the Quantum Approximate Optimization Algorithm.
Abstract: We use ability of quantum computing such as superposition and entanglement to solve the sudoku. In recent years, quantum computers have shown promise as a new technology for solving complex problems in various fields, including optimization and cryptography. In this paper, we investigate the potential of quantum computers for solving Sudoku puzzles. We present a quantum algorithm for solving Sudoku puzzles, and compare its performance to classical algorithms. Our results show that the quantum algorithm outperforms classical algorithms in terms of both speed and accuracy, and provides a new tool for solving Sudoku puzzles efficiently. Additionally, we discuss the implications of our results for the development of quantum algorithms for solving other combinatorial problems.