Finding Solutions to the Integer Case Constraint Satisfiability Problem Using Grover’s Algorithm
Constraint satisfiability problems, crucial to several applications, are solved on a quantum computer using Grover’s search algorithm, leading to a quadratic improvement over the classical case. The solutions are obtained with high probability for several cases and are illustrated for the...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
IEEE
2021
|
| Subjects: | |
| Online Access: | https://doaj.org/article/a6327c7a264b499dadea46761667f1b3 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|