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

Communications in computer and information science

A Quantum Ising Model for Solving Sudoku Puzzles

Wen-Li Wang, Mei-Huei Tang, Shahid Hussain, Kevin Wang

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1007/978-3-032-08977-9_26

Related papers

A Gate-Based Quantum Ising Model Approach to Solving KenKen Puzzles Using Binary Encoding

Wen-Li Wang, Mei-Huei Tang, Kevin Wang +2 more

Communications in computer and information science•Oct 5, 2026•0 citations

Solving Prime Factorization Using Quantum Ising Model

Wen-Li Wang, Mei-Huei Tang, Shahid Hussain +1 more

Communications in computer and information science•Jan 1, 2026•1 citation

The quantum Ising model for perfect matching and solving it with variational quantum eigensolver

Qilin Zheng, Pingyu Zhu, Chao Wu +3 more

Science China Information Sciences•Aug 19, 2024•4 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

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

Quantum Distribution of a Sudoku Key

Sian K. Jones

Abstract Sudoku grids are often cited as being useful in cryptography as a key for some encryption process. Historically transporting keys over an alternate channel has been very difficult. This article describes how a Sudoku grid key can be secretly transported using quantum key distribution methods whereby partial grid (or puzzle) can be received and the full key can be recreated by solving the puzzle.

Recreational mathematics magazine•Dec 1, 2016•1 citation
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: 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.