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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2021-01-01
|
| Series: | IEEE Transactions on Quantum Engineering |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9576649/ |