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

arXiv:2005.10862 · Quantum Information and Computation

SudoQ -- a quantum variant of the popular game

Ion Nechita, Jordi Pillet

Published Jul 14, 2021• 13 citations
arXivHTMLPDF

Abstract

(pp781-799) doi: https://doi.org/ Abstracts: We introduce SudoQ, a quantum version of the classical game Sudoku. Allowing the entries of the grid to be (non-commutative) projections instead of integers, the solution set of SudoQ puzzles can be much larger than in the classical (commutative) setting. We introduce and analyze a randomized algorithm for computing solutions of SudoQ puzzles. Finally, we state two important conjectures relating the quantum and the classical solutions of SudoQ puzzles, corroborated by analytical and numerical evidence.

DOI
10.26421/qic21.9-10-4

Related papers

Genuinely quantum solutions of the game Sudoku and their cardinality

Jerzy Paczos, Marcin Wierzbiński, Grzegorz Rajchel-Mieldzioć +2 more

We expand the quantum variant of the popular game Sudoku by introducing the notion of cardinality of a quantum Sudoku (SudoQ), equal to the number of distinct vectors appearing in the pattern. Our considerations are focused on the genuinely quantum solutions---the solutions of size ${N}^{2}$ that have cardinality greater than ${N}^{2}$, and therefore cannot be reduced to classical counterparts by a unitary transformation. We find the complete parametrization of the genuinely quantum solutions of a $4\ifmmode\times\else\texttimes\fi{}4$ SudoQ game and establish that in this case the admissible cardinalities are 4, 6, 8, and 16. In particular, a solution with the maximal cardinality equal to 16 is presented. Furthermore, the parametrization enabled us to prove a recent conjecture of Nechita and Pillet [I. Nechita and J. Pillet, Quantum Inf. Comput. 21, 781 (2021)] for this special dimension. In general, we proved that for any $N$ it is possible to find an ${N}^{2}\ifmmode\times\else\texttimes\fi{}{N}^{2}$ SudoQ solution of cardinality ${N}^{4}$, which for a prime $N$ is related to a set of $N$ mutually unbiased bases of size ${N}^{2}$. Such a construction of ${N}^{4}$ different vectors of size $N$ yields a set of ${N}^{3}$ orthogonal measurements.

arXiv:2106.02967•Physical Review A•Oct 26, 2021•20 citations

Genuinely Quantum Solutions of Orthogonal Sudoku Squares

Yajuan Zang, Hailong Zhang, Zihong Tian +1 more

ABSTRACT Quantum Sudoku is the generalized version of the popular game Sudoku. A quantum Sudoku square is a special kind of quantum Latin square. A genuinely quantum solution of quantum Sudoku squares has been solved completely. In this paper, we introduce the notion of orthogonality of two quantum Sudoku squares. We establish three novel constructions of mutually orthogonal quantum Sudoku squares including Lorch construction, Pedersen‐Vis construction and direct product construction. As a result, we determine the genuinely quantum solution of a pair of orthogonal Sudoku squares of size for any positive integer . In general, we show that the resulting squares naturally define an absolutely maximally entangled state . Furthermore, we also show that the mutually orthogonal quantum Sudoku squares give rise to mutually unbiased bases based on maximally entangled states in for any prime power .

Advanced Quantum Technologies•May 1, 2026•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

Solving Sudoku game using a hybrid classical-quantum algorithm

Ankur Kumar Pal, Sanghita Chandra, Vardaan Mongia +2 more

Sudoku is a fun combinatorial game, based on the Latin square, which has wide applications as being an efficient design in controlling multiple sources of variable nuisance simultaneously. Quantum Sudoku solver uses basics of quantum mechanics such as superposition and entanglement. Using the concept of duality quantum computing, we propose an algorithm which solves a 4 × 4 Sudoku puzzle with a space complexity [ O ( N 2 ( 4 + log ⁡ ( N ) ) ] (where N = 4). Our proposed algorithm has a primary aim to provide a theoretical framework for an application of duality quantum computing.

Europhysics Letters (EPL)•Jan 31, 2020•17 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

A Simple QUBO Formulation of Sudoku

Sascha Mücke

This article describes how to solve Sudoku puzzles using Quadratic Unconstrained Binary Optimization (QUBO). To this end, a QUBO instance with 729 variables is constructed, encoding a Sudoku grid with all constraints in place, which is then partially assigned to account for clues. The resulting instance can be solved with a Quantum Annealer, or any other strategy, to obtain the fully filled-out Sudoku grid. Moreover, as all valid solutions have the same energy, the QUBO instance can be used to sample uniformly from the space of valid Sudoku grids. We demonstrate the described method using both a heuristic solver and a Quantum Annealer.

arXiv:2403.04816•Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 14, 2024•10 citations
(pp781-799) doi: https://doi.org/ Abstracts: We introduce SudoQ, a quantum version of the classical game Sudoku. Allowing the entries of the grid to be (non-commutative) projections instead of integers, the solution set of SudoQ puzzles can be much larger than in the classical (commutative) setting. We introduce and analyze a randomized algorithm for computing solutions of SudoQ puzzles. Finally, we state two important conjectures relating the quantum and the classical solutions of SudoQ puzzles, corroborated by analytical and numerical evidence.
We expand the quantum variant of the popular game Sudoku by introducing the notion of cardinality of a quantum Sudoku (SudoQ), equal to the number of distinct vectors appearing in the pattern. Our considerations are focused on the genuinely quantum solutions---the solutions of size N2{N}^{2}N2 that have cardinality greater than N2{N}^{2}N2, and therefore cannot be reduced to classical counterparts by a unitary transformation. We find the complete parametrization of the genuinely quantum solutions of a $4\ifmmode\times\else\texttimes\fi{}4$ SudoQ game and establish that in this case the admissible cardinalities are 4, 6, 8, and 16. In particular, a solution with the maximal cardinality equal to 16 is presented. Furthermore, the parametrization enabled us to prove a recent conjecture of Nechita and Pillet [I. Nechita and J. Pillet, Quantum Inf. Comput. 21, 781 (2021)] for this special dimension. In general, we proved that for any NNN it is possible to find an ${N}^{2}\ifmmode\times\else\texttimes\fi{}{N}^{2}$ SudoQ solution of cardinality N4{N}^{4}N4, which for a prime NNN is related to a set of NNN mutually unbiased bases of size N2{N}^{2}N2. Such a construction of N4{N}^{4}N4 different vectors of size NNN yields a set of N3{N}^{3}N3 orthogonal measurements.
ABSTRACT Quantum Sudoku is the generalized version of the popular game Sudoku. A quantum Sudoku square is a special kind of quantum Latin square. A genuinely quantum solution of quantum Sudoku squares has been solved completely. In this paper, we introduce the notion of orthogonality of two quantum Sudoku squares. We establish three novel constructions of mutually orthogonal quantum Sudoku squares including Lorch construction, Pedersen‐Vis construction and direct product construction. As a result, we determine the genuinely quantum solution of a pair of orthogonal Sudoku squares of size for any positive integer . In general, we show that the resulting squares naturally define an absolutely maximally entangled state . Furthermore, we also show that the mutually orthogonal quantum Sudoku squares give rise to mutually unbiased bases based on maximally entangled states in for any prime power .
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.
Sudoku is a fun combinatorial game, based on the Latin square, which has wide applications as being an efficient design in controlling multiple sources of variable nuisance simultaneously. Quantum Sudoku solver uses basics of quantum mechanics such as superposition and entanglement. Using the concept of duality quantum computing, we propose an algorithm which solves a 4 × 4 Sudoku puzzle with a space complexity [ O ( N 2 ( 4 + log ⁡ ( N ) ) ] (where N = 4). Our proposed algorithm has a primary aim to provide a theoretical framework for an application of duality quantum computing.
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.
This article describes how to solve Sudoku puzzles using Quadratic Unconstrained Binary Optimization (QUBO). To this end, a QUBO instance with 729 variables is constructed, encoding a Sudoku grid with all constraints in place, which is then partially assigned to account for clues. The resulting instance can be solved with a Quantum Annealer, or any other strategy, to obtain the fully filled-out Sudoku grid. Moreover, as all valid solutions have the same energy, the QUBO instance can be used to sample uniformly from the space of valid Sudoku grids. We demonstrate the described method using both a heuristic solver and a Quantum Annealer.