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

Lecture notes in computer science

Finite Domain Constraint Satisfaction Using Quantum Computation

Ola Angelsmark, Vilhelm Dahllöf, Peter Jönsson

Published Jan 1, 2002• 6 citations
Publisher
DOI
10.1007/3-540-45687-2_7

Related papers

Domain-Driven Modeling of Combinatorial Constraint Satisfaction Problems for Quantum Solvers

Marc Uphues, Sebastian Thöne, Herbert Kuchen

International Conference on Evaluation of Novel Approaches to Software Engineering•Jan 1, 2026•0 citations

Quantum Annealing for Constraint Satisfaction and Constrained Optimization

Philippe Codognet

International Conference on Agents and Artificial Intelligence (ICAART)•Jan 1, 2023•0 citations

Quantum Computing for Constraint Programming

Kyle E. C. Booth, Bryan O’Gorman, Jeffrey Marshall +2 more

Bulletin of the American Physical Society•Mar 18, 2021•0 citations

Quantum-Enhanced Constraint Satisfaction (QECS)

Jincheng Zhang

This paper introduces Quantum-Enhanced Constraint Satisfaction (QECS), a novel algorithm designed to accelerate the solution of complex optimization problems using quantum annealing. Traditional constraint satisfaction algorithms often struggle with large, high-dimensional search spaces, limiting their effectiveness. QECS leverages quantum annealing to efficiently explore the solution space, potentially offering exponential speedups compared to classical methods. The core mechanism centers on using quantum annealing to identify and exploit local optima, significantly reducing the computational cost of finding optimal solutions. We present a detailed analysis of the algorithm's performance, demonstrating its potential for substantial improvements in optimization tasks across diverse problem domains.

•Sep 6, 2026•0 citations

Quantum computation and NP-complete problems

Takashi Mihara, Tetsuro Nishino

Lecture notes in computer science•Jan 1, 1994•1 citation

Conversion of Boolean and Integer FlatZinc Builtins to Quadratic or Linear Integer Problems

Wolf, Armin

Constraint satisfaction or optimisation models -- even if they are formulated in high-level modelling languages -- need to be reduced into an equivalent format before they can be solved by the use of Quantum Computing. In this paper we show how Boolean and integer FlatZinc builtins over finite-domain integer variables can be equivalently reformulated as linear equations, linear inequalities or binary products of those variables, i.e. as finite-domain quadratic integer programs. Those quadratic integer programs can be further transformed into equivalent Quadratic Unconstrained Binary Optimisation problem models, i.e. a general format for optimisation problems to be solved on Quantum Computers especially on Quantum Annealers.

arXiv:2404.12797•Apr 19, 2024•0 citations
This paper introduces Quantum-Enhanced Constraint Satisfaction (QECS), a novel algorithm designed to accelerate the solution of complex optimization problems using quantum annealing. Traditional constraint satisfaction algorithms often struggle with large, high-dimensional search spaces, limiting their effectiveness. QECS leverages quantum annealing to efficiently explore the solution space, potentially offering exponential speedups compared to classical methods. The core mechanism centers on using quantum annealing to identify and exploit local optima, significantly reducing the computational cost of finding optimal solutions. We present a detailed analysis of the algorithm's performance, demonstrating its potential for substantial improvements in optimization tasks across diverse problem domains.
Constraint satisfaction or optimisation models -- even if they are formulated in high-level modelling languages -- need to be reduced into an equivalent format before they can be solved by the use of Quantum Computing. In this paper we show how Boolean and integer FlatZinc builtins over finite-domain integer variables can be equivalently reformulated as linear equations, linear inequalities or binary products of those variables, i.e. as finite-domain quadratic integer programs. Those quadratic integer programs can be further transformed into equivalent Quadratic Unconstrained Binary Optimisation problem models, i.e. a general format for optimisation problems to be solved on Quantum Computers especially on Quantum Annealers.