Solving Random Satisfiability Problems with Quantum Computers
نویسنده
چکیده
Quantum computer algorithms can exploit the structure of random satisfiability problems. This paper extends a previous empirical evaluation of such an algorithm and gives an approximate asymptotic analysis accounting for both the average and variation of amplitudes among search states with the same costs. The analysis predicts good performance, on average, for a variety of problems including those near a phase transition associated with a high concentration of hard cases. Based on empirical evaluation for small problems, modifying the algorithm in light of this analysis improves its performance. The algorithm improves on both GSAT, a commonly used conventional heuristic, and quantum algorithms ignoring problem structure.
منابع مشابه
Statistical mechanics of classical and quantum computational complexity
The quest for quantum computers is motivated by their potential for solving problems that defy existing, classical, computers. The theory of computational complexity, one of the crown jewels of computer science, provides a rigorous framework for classifying the hardness of problems according to the computational resources, most notably time, needed to solve them. Its extension to quantum comput...
متن کاملA Constant Complexity Algorithm for Solving the Boolean Satisfiability Problem on Quantum Computers
In this paper we will present an algorithm for solving the Boolean satisfiability problem (SAT) or (K-SAT) on quantum computers, which runs in a constant number of steps; O(4), with any given number n of Boolean variables. We will show that in contrast to classical algorithms the ability of the algorithm to solve the problem increases as the number of variables increases.
متن کاملSingle-Step Quantum Search Using Problem Structure
The structure of satisfiability problems is used to improve search algorithms for quantum computers and reduce their required coherence times by using only a single coherent evaluation of problem properties. The structure of random k-SAT allows determining the asymptotic average behavior of these algorithms, showing they improve on quantum algorithms, such as amplitude amplification, that ignor...
متن کاملProgramming complex systems
Classical programming languages cannot model essential elements of complex systems such as true random number generation. This paper develops a formal programming language called the lambda-q calculus that addresses the fundamental properties of complex systems. This formal language allows the expression of quantumized algorithms, which are extensions of randomized algorithms in that probabilit...
متن کاملFinding Solutions to NP Problems: Philosophical Differences Between Quantum and Evolutionary Search Algorithms
There is no known polynomial-time algorithm that can solve an NP problem. Evolutionary search has been shown to be a viable method of finding acceptable solutions within a reasonable time period. Recently quantum computers have surfaced as another alternative method. But these two methods use radically different philosophies for solving NP problems even though both search methods are non-determ...
متن کامل