Solving boolean satisfiability problems with the quantum approximate
optimization algorithm
- URL: http://arxiv.org/abs/2208.06909v1
- Date: Sun, 14 Aug 2022 20:39:48 GMT
- Title: Solving boolean satisfiability problems with the quantum approximate
optimization algorithm
- Authors: Sami Boulebnane and Ashley Montanaro
- Abstract summary: We study the ability of QAOA to solve hard constraint satisfaction problems, as opposed to quantum computing problems.
We develop analytic bounds on the average success probability of QAOA over random formulae at the satisfiability threshold.
We find that for around 14 ansatz layers, QAOA matches the scaling performance of the highest-performance classical solver.
- Score: 0.05076419064097732
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The quantum approximate optimization algorithm (QAOA) is one of the most
prominent proposed applications for near-term quantum computing. Here we study
the ability of QAOA to solve hard constraint satisfaction problems, as opposed
to optimization problems. We focus on the fundamental boolean satisfiability
problem, in the form of random $k$-SAT. We develop analytic bounds on the
average success probability of QAOA over random boolean formulae at the
satisfiability threshold, as the number of variables $n$ goes to infinity. The
bounds hold for fixed parameters and when $k$ is a power of 2. We complement
these theoretical results with numerical results on the performance of QAOA for
small $n$, showing that these match the limiting theoretical bounds closely. We
then use these results to compare QAOA with leading classical solvers. In the
case of random 8-SAT, we find that for around 14 ansatz layers, QAOA matches
the scaling performance of the highest-performance classical solver we tested,
WalkSATlm. For larger numbers of layers, QAOA outperforms WalkSATlm, with an
ultimate level of advantage that is still to be determined. Our methods provide
a framework for analysing the performance of QAOA for hard constraint
satisfaction problems and finding further speedups over classical algorithms.
Related papers
- Sum-of-Squares inspired Quantum Metaheuristic for Polynomial Optimization with the Hadamard Test and Approximate Amplitude Constraints [76.53316706600717]
Recently proposed quantum algorithm arXiv:2206.14999 is based on semidefinite programming (SDP)
We generalize the SDP-inspired quantum algorithm to sum-of-squares.
Our results show that our algorithm is suitable for large problems and approximate the best known classicals.
arXiv Detail & Related papers (2024-08-14T19:04:13Z) - Hybrid Classical-Quantum Simulation of MaxCut using QAOA-in-QAOA [0.0]
In this work, an implementation of the QAOA2 method for the scalable solution of the MaxCut problem is presented.
The limits of the Goemans-Williamson (GW) algorithm as a purely classical alternative to QAOA are investigated.
Results from large-scale simulations of up to 33 qubits are presented, showing the advantage of QAOA in certain cases and the efficiency of the implementation.
arXiv Detail & Related papers (2024-06-25T09:02:31Z) - The Overlap Gap Property limits limit swapping in QAOA [0.0]
The Quantum Approximate Optimization Algorithm (QAOA) is a quantum algorithm designed for Combinatorial Optimization Problem (COP)
We show that even when sub-optimised, the performance of QAOA on spin glass is equal in performance to classical algorithms in solving the mean field spin glass problem.
arXiv Detail & Related papers (2024-04-09T07:45:06Z) - Quantum Approximate Optimisation for Not-All-Equal SAT [9.427635404752936]
We apply variational quantum algorithm QAOA to a variant of satisfiability problem (SAT): Not-All-Equal SAT.
We show that while the runtime of both solvers scales exponentially with the problem size, the scaling for QAOA is smaller for large enough circuit depths.
arXiv Detail & Related papers (2024-01-05T15:11:24Z) - Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem [8.738180371389097]
The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers.
Here, we perform an extensive numerical investigation of QAOA on the low autocorrelation binary sequences (LABS) problem.
We observe that the runtime of QAOA with fixed parameters scales better than branch-and-bound solvers.
arXiv Detail & Related papers (2023-08-04T14:17:21Z) - Amplitude amplification-inspired QAOA: Improving the success probability
for solving 3SAT [55.78588835407174]
The amplitude amplification algorithm can be applied to unstructured search for satisfying variable assignments.
The Quantum Approximate Optimization Algorithm (QAOA) is a promising candidate for solving 3SAT for Noisy Intermediate-Scale Quantum devices.
We introduce amplitude amplification-inspired variants of QAOA to improve the success probability for 3SAT.
arXiv Detail & Related papers (2023-03-02T11:52:39Z) - Quantum Goemans-Williamson Algorithm with the Hadamard Test and
Approximate Amplitude Constraints [62.72309460291971]
We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits.
Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit.
We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
arXiv Detail & Related papers (2022-06-30T03:15:23Z) - QAOA-in-QAOA: solving large-scale MaxCut problems on small quantum
machines [81.4597482536073]
Quantum approximate optimization algorithms (QAOAs) utilize the power of quantum machines and inherit the spirit of adiabatic evolution.
We propose QAOA-in-QAOA ($textQAOA2$) to solve arbitrary large-scale MaxCut problems using quantum machines.
Our method can be seamlessly embedded into other advanced strategies to enhance the capability of QAOAs in large-scale optimization problems.
arXiv Detail & Related papers (2022-05-24T03:49:10Z) - Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity.
We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree.
These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
arXiv Detail & Related papers (2022-01-06T21:02:30Z) - Hybrid quantum-classical algorithms for approximate graph coloring [65.62256987706128]
We show how to apply the quantum approximate optimization algorithm (RQAOA) to MAX-$k$-CUT, the problem of finding an approximate $k$-vertex coloring of a graph.
We construct an efficient classical simulation algorithm which simulates level-$1$ QAOA and level-$1$ RQAOA for arbitrary graphs.
arXiv Detail & Related papers (2020-11-26T18:22:21Z) - Evaluation of QAOA based on the approximation ratio of individual
samples [0.0]
We simulate the performance of QAOA applied to the Max-Cut problem and compare it with some of the best classical alternatives.
Because of the evolving QAOA computational complexity-theoretic guidance, we utilize a framework for the search for quantum advantage.
arXiv Detail & Related papers (2020-06-08T18:00:18Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.