Finite Domain Constraint Satisfaction Using Quantum Computation

Authors:
Ola Angelsmark;Vilhelm Dahllöf;Peter Jonsson
Affiliations:
-;-;-
Venue:
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Year:
2002

Citing 6
Cited 3

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Quantum computation and quantum information

Quantum computation and quantum information
Random Constraint Satisfaction: A More Accurate Picture

Constraints
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science

On quantum versions of record-breaking algorithms for SAT

ACM SIGACT News
Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems

Proceedings of the 2006 ACM symposium on Applied computing
Solving NP-complete problems with quantum search

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a quantum algorithm for finite domain constraint solving, where the constraints have arity 2. It is complete and runs in O((驴d/2驴)n/2) time, where d is size of the domain of the variables and n the number of variables. For the case of d = 3we provide a method to obtain an upper time bound of O(8n/8)驴 O(1.2968n). Also for d = 5 the upper bound has been improved. Using this method in a slightly different way we can decide 3-colourability in O(1.2185n) time.