Faster Quantum and Classical SDP Approximations for Quadratic Binary Optimization

          @misc{ scivideos_15434,
            doi = {},
            url = {https://simons.berkeley.edu/talks/tbd-136},
            author = {},
            keywords = {},
            language = {en},
            title = {Faster Quantum and Classical SDP Approximations for Quadratic Binary Optimization},
            publisher = {The Simons Institute for the Theory of Computing},
            year = {2020},
            month = {feb},
            note = {15434 see, \url{https://scivideos.org/Simons-Institute/15434}}
          }
          

Abstract

We give a quantum speedup for solving the canonical semidefinite programming relaxation for binary quadratic optimization. The class of relaxations for combinatorial optimization has so far eluded quantum speedups. Our methods combine ideas from quantum Gibbs sampling and matrix exponent updates. A de-quantization of the algorithm also leads to a faster classical solver. For generic instances, our quantum solver gives a nearly quadratic speedup over state-of-the-art algorithms. We also provide an efficient randomized rounding procedure that converts approximately optimal SDP solutions into constant factor approximations of the original quadratic optimization problem. This is joint work with Fernando Brandão and Daniel Stilck França.