A quantum-inspired algorithm for solving Sudoku puzzles and the MaxCut problem

DOI10.2478/QIC-2025-0023MaRDI QIDQ7295929zbMATH OpenFDO

Authors Max B. Zhao, Fei Li

Publication date 14 July 2026

Published in Quantum Information \& Computation (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.2478/QIC-2025-0023

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Cites work

• A practical introduction to tensor networks: Matrix product states and projected entangled pair states
• A review on quantum approximate optimization algorithm and its variants
• An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
• An area law for one-dimensional quantum systems
• Colloquium: Quantum annealing and analog quantum computation
• Entropy scaling and simulability by matrix product states
• From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• New advances for quantum-inspired optimization
• Ottimizzazione Combinatoria
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
• Reducibility among combinatorial problems
• The density-matrix renormalization group

This page was built for publication: A quantum-inspired algorithm for solving Sudoku puzzles and the MaxCut problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7295929)