Faster than Classical Quantum Algorithm for dense Formulas of Exact Satisfiability and Occupation Problems

@article{Mandr2016FasterTC,
  title={Faster than Classical Quantum Algorithm for dense Formulas of Exact Satisfiability and Occupation Problems},
  author={Salvatore Mandr{\`a} and Gian Giacomo Guerreschi and Al{\'a}n Aspuru-Guzik},
  journal={ArXiv},
  year={2016},
  volume={abs/1512.00859}
}
We present an exact quantum algorithm for solving the Exact Satisfiability (XSAT) 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: First, the identification and efficient characterization of a restricted subspace that contains all the valid assignments of the XSAT; Second, a quantum search in such restricted subspace. The quantum algorithm can be used either to find a valid assignment (or to… 

Figures from this paper

Quantum Algorithms for Solving Dynamic Programming Problems
TLDR
This work presents a general quantum algorithm that provides a quadratic quantum advantage in terms of the number of states of a given dynamic programming problem and proves lower bounds for the query complexity of quantum algorithms and classical randomized algorithms for solving dynamic programming problems.
Quantum walk speedup of backtracking algorithms
TLDR
A general method to obtain quantum speedups of classical algorithms which are based on the technique of backtracking, a standard approach for solving constraint satisfaction problems (CSPs), and this quantum algorithm can be used to speed up the DPLL algorithm.
Applying quantum algorithms to constraint satisfaction problems
TLDR
This work applies general-purpose quantum algorithms for solving constraint satisfaction problems to two families of prototypical NP-complete problems: boolean satisfiability and graph colouring and compares the performance of optimised versions of these algorithms, when applied to random problem instances, against leading classical algorithms.
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms
TLDR
This paper gives a quantum algorithm that solves path in the hypercube in time and combines Grover's search with computing a partial dynamic programming table, and uses this approach to solve a variety of vertex ordering problems on graphs in the same time.
Quantum Branch-and-Bound Algorithm and its Application to the Travelling Salesman Problem
TLDR
A quantum branch-and-bound algorithm based on the general scheme of the branch- and-bound method and the quantum nested searching algorithm is proposed and proved to be several times more efficient than the classical algorithm.
Low-Depth Mechanisms for Quantum Optimization
TLDR
This work focuses on developing a language and tools connected with kinetic energy on a graph for understanding the physical mechanisms of success and failure to guide algorithmic improvement, and unveil many pitfalls and mechanisms in quantum optimization using a physical perspective.
Resource Optimal Realization of Fault-Tolerant Quantum Circuit
TLDR
This work proposes an optimal realization of logical CNOT operations on a single or two separate [[4, 2, 2]] code-words using 4 physical C NOT operations and an additional qubit, and introduces logical two-qubit positive and negative controlled-phase operations with varying rotation angle.
From Ans\"atze to Z-gates: a NASA View of Quantum Computing
TLDR
Early application thrusts related to robustness of communication networks and the simulation of many-body systems for material science and chemistry are added to the QuAIL research agenda.
Feeding the multitude: A polynomial-time algorithm to improve sampling.
TLDR
A simple postprocessing technique that improves sampling for any optimization approach, either quantum or classical, starting from a pool of a few optimal configurations and generating potentially new solutions via rejection-free cluster updates at zero temperature is presented.
Leveraging Artificial Intelligence to Advance Problem-Solving with Quantum Annealers
TLDR
SAT++ is introduced, as a novel quantum programming paradigm, that can compile classical algorithms and execute them on quantum annealers and a post-quantum error correction method is introduced that can find samples with significantly lower energy values, compared to the state-of-the-art techniques inquantum annealing.
...
...

References

SHOWING 1-10 OF 117 REFERENCES
Quantum walk speedup of backtracking algorithms
TLDR
A general method to obtain quantum speedups of classical algorithms which are based on the technique of backtracking, a standard approach for solving constraint satisfaction problems (CSPs), and this quantum algorithm can be used to speed up the DPLL algorithm.
The complexity of satisfiability problems
TLDR
An infinite class of satisfiability problems is considered which contains these two particular problems as special cases, and it is shown that every member of this class is either polynomial-time decidable or NP-complete.
New algorithms for Exact Satisfiability
A fast quantum mechanical algorithm for database search
TLDR
In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .
Tight bounds on quantum searching
TLDR
A lower bound on the efficiency of any possible quantum database searching algorithm is provided and it is shown that Grover''s algorithm nearly comes within a factor 2 of being optimal in terms of the number of probes required in the table.
Analog analogue of a digital quantum computation
We solve a problem, which while not fitting into the usual paradigm, can be viewed as a quantum computation. Suppose we are given a quantum system with a Hamiltonian of the form $E|w〉〈w|$ where $|w〉$
Algorithms for four variants of the exact satisfiability problem
Exact 3-Satisfiability Is Decidable in Time O (2 0.16254 n )
Let FeC1∧⋅⋅⋅∧Cm be a Boolean formula in conjunctive normal form over a set V of n propositional variables, s.t. each clause Ci contains at most three literals l over V. Solving the problem exact
New Worst-Case upper Bound for Counting Exact Satisfiability
TLDR
An algorithm is presented that solves the #XSAT problem in O(1.1995n), which is faster than the best algorithm running in O (1.2190n), where n denotes the number of variables.
Quantum Pattern Matching Fast on Average
TLDR
A quantum algorithm which solves the pattern matching problem for random patterns and texts in time for large m, and is super-polynomially faster than the best possible classical algorithm.
...
...