Hybrid divide-and-conquer approach for tree search algorithms

by   Mathys Rennela, et al.

As we are entering the era of real-world small quantum computers, finding applications for these limited devices is a key challenge. In this vein, it was recently shown that a hybrid classical-quantum method can help provide polynomial speed-ups to classical divide-and-conquer algorithms, even when only given access to a quantum computer much smaller than the problem itself. In this work we study the hybrid divide-and-conquer method in the context of tree search algorithms, and extend it by including quantum backtracking, which allows better results than previous Grover-based methods. Further, we provide general criteria for polynomial speed-ups in the tree search context, and provide a number of examples where polynomial speed ups, using arbitrarily smaller quantum computers, can still be obtained. This study possible speed-ups for the well known algorithm of DPLL and prove threshold-free speed-ups for the tree search subroutines of the so-called PPSZ algorithm - which is the core of the fastest exact Boolean satisfiability solver - for certain classes of formulas. We also provide a simple example where speed-ups can be obtained in an algorithm-independent fashion, under certain well-studied complexity-theoretical assumptions. Finally, we briefly discuss the fundamental limitations of hybrid methods in providing speed-ups for larger problems.


page 1

page 2

page 3

page 4


A hybrid algorithm framework for small quantum computers with application to finding Hamiltonian cycles

Recent works have shown that quantum computers can polynomially speed up...

Computational speedups using small quantum devices

Suppose we have a small quantum computer with only M qubits. Can such a ...

On the Need for Large Quantum Depth

Near-term quantum computers are likely to have small depths due to short...

A Quantum Approach to Subset-Sum and Similar Problems

In this paper, we study the subset-sum problem by using a quantum heuris...

Distributional property testing in a quantum world

A fundamental problem in statistics and learning theory is to test prope...

Quantum divide and conquer

The divide-and-conquer framework, used extensively in classical algorith...

Using Quantum Computers to Speed Up Dynamic Testing of Software

Software under test can be analyzed dynamically, while it is being execu...

Please sign up or login with your details

Forgot password? Click here to reset