Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems
We present an exact quantum algorithm for solving the Exact Satisfiability problem, which belongs to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts: the first step consists in the identification and efficient characteriz...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IOP Publishing
2016-01-01
|
Series: | New Journal of Physics |
Subjects: | |
Online Access: | https://doi.org/10.1088/1367-2630/18/7/073003 |