The Dual Polynomial of Bipartite Perfect Matching

Gal Beniamini

We obtain a description of the Boolean dual function of the Bipartite Perfect Matching decision problem, as a multilinear polynomial over the Reals. We show that in this polynomial, both the number of monomials and the magnitude of their coefficients are at most exponential in $\mathcal{O}(n \log n)$. As an application, we obtain a new upper bound of $\mathcal{O}(n^{1.5} \sqrt{\log n})$ on the approximate degree of the bipartite perfect matching function, improving the previous best known bound of $\mathcal{O}(n^{1.75})$. We deduce that, beyond a $\mathcal{O}(\sqrt{\log n})$ factor, the polynomial method cannot be used to improve the lower bound on the bounded-error quantum query complexity of bipartite perfect matching.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment