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

Bulletin of the American Physical Society

Quantum Computing for Constraint Programming

Kyle E. C. Booth, Bryan O’Gorman, Jeffrey Marshall, Stuart Hadfield, Eleanor Gilbert Rieffel

Published Mar 18, 2021• 0 citations
OpenAlex

Related papers

Solving a Scheduling Problem for a Quantum Computing Architecture Using Constraint Programming.

Jean‐Paul Watson, Cynthia A. Phillips, Robert D. Carr

•Nov 1, 2008•0 citations

Finite Domain Constraint Satisfaction Using Quantum Computation

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

Lecture notes in computer science•Jan 1, 2002•6 citations

Quantum-Driven Constraint Programming

Jincheng Zhang

This paper introduces a novel quantum-driven constraint programming framework, leveraging quantum entanglement and superposition to optimize constraint conditions and enhance the efficiency of constraint solving. Traditional constraint programming methods often struggle with computationally intensive optimization problems. Quantum computing offers the potential for significant speedups through quantum algorithms. We propose a new approach that utilizes quantum entanglement to accelerate the search process, ultimately leading to more efficient constraint solving. This work demonstrates the feasibility of quantum-enhanced constraint programming and explores its potential impact on various constraint satisfaction problems.

•Sep 1, 2026•0 citations

Quantum-Enhanced Constraint Programming

Jincheng Zhang

This paper introduces a novel constraint programming language, Quantum-Enhanced Constraint Programming (QECP), designed to leverage the power of quantum computing for enhanced constraint space exploration and solution discovery. We propose a quantum search algorithm, Grover's algorithm, to accelerate the search for optimal solutions to constraint satisfaction problems, aiming to overcome the limitations of classical constraint programming in terms of speed and scalability. The core mechanism centers on integrating this quantum search within the constraint programming framework, enabling efficient searching of the constraint space and ultimately facilitating the discovery of novel solutions. This work explores the potential of quantum computing to revolutionize constraint satisfaction problem solving, presenting a framework for increased efficiency and the exploration of previously intractable solutions.

•Sep 1, 2026•0 citations

Equality-Constrained Quadratic Programming with Quantum Computing

Timur Gubaev, Pu Li

Lecture notes in networks and systems•Jan 1, 2025•0 citations

Quantum Computing System for Combinational Optimization Problems

Mitsuki Ito, Y. Hirata, Moe Shimada +2 more

The Japan Society of Applied Physics•Jul 10, 2018•0 citations
This paper introduces a novel quantum-driven constraint programming framework, leveraging quantum entanglement and superposition to optimize constraint conditions and enhance the efficiency of constraint solving. Traditional constraint programming methods often struggle with computationally intensive optimization problems. Quantum computing offers the potential for significant speedups through quantum algorithms. We propose a new approach that utilizes quantum entanglement to accelerate the search process, ultimately leading to more efficient constraint solving. This work demonstrates the feasibility of quantum-enhanced constraint programming and explores its potential impact on various constraint satisfaction problems.
This paper introduces a novel constraint programming language, Quantum-Enhanced Constraint Programming (QECP), designed to leverage the power of quantum computing for enhanced constraint space exploration and solution discovery. We propose a quantum search algorithm, Grover's algorithm, to accelerate the search for optimal solutions to constraint satisfaction problems, aiming to overcome the limitations of classical constraint programming in terms of speed and scalability. The core mechanism centers on integrating this quantum search within the constraint programming framework, enabling efficient searching of the constraint space and ultimately facilitating the discovery of novel solutions. This work explores the potential of quantum computing to revolutionize constraint satisfaction problem solving, presenting a framework for increased efficiency and the exploration of previously intractable solutions.