On converses to the polynomial method

• URL: http://arxiv.org/abs/2204.12303v3
• Date: Wed, 20 Dec 2023 16:58:23 GMT
• Title: On converses to the polynomial method
• Authors: Jop Bri\"et and Francisco Escudero Guti\'errez
• Abstract summary: A surprising 'converse to the method' of Aaronson et al. shows that any bounded quadratic can be computed exactly up to a universal multiplicative factor related to the Grohendieck constant. We show that the result still holds when we allow for a small additive error.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the famous Grothendieck constant. A natural question posed there asks if bounded quartic polynomials can be approximated by $2$-query quantum algorithms. Arunachalam, Palazuelos and the first author showed that there is no direct analogue of the result of Aaronson et al. in this case. We improve on this result in the following ways: First, we point out and fix a small error in the construction that has to do with a translation from cubic to quartic polynomials. Second, we give a completely explicit example based on techniques from additive combinatorics. Third, we show that the result still holds when we allow for a small additive error. For this, we apply an SDP characterization of Gribling and Laurent (QIP'19) for the completely-bounded approximate degree.

Related papers

• Halving the Cost of Quantum Algorithms with Randomization [0.138120109831448]
  Quantum signal processing (QSP) provides a systematic framework for implementing a transformation of a linear operator. Recent works have developed randomized compiling, a technique that promotes a unitary gate to a quantum channel. Our algorithm implements a probabilistic mixture of randomizeds, strategically chosen so that the average evolution converges to that of a target function, with an error quadratically smaller than that of an equivalent individual.
  arXiv  Detail & Related papers  (2024-09-05T17:56:51Z)
• Complementary polynomials in quantum signal processing [0.0]
  To implement a given $P$, one must first construct a corresponding complementary $Q$. Existing approaches to this problem employ numerical methods that are not amenable to explicit error analysis. We present a new approach to complementarys using complex analysis.
  arXiv  Detail & Related papers  (2024-06-06T16:47:11Z)
• Polynomial-Time Solutions for ReLU Network Training: A Complexity Classification via Max-Cut and Zonotopes [70.52097560486683]
  We prove that the hardness of approximation of ReLU networks not only mirrors the complexity of the Max-Cut problem but also, in certain special cases, exactly corresponds to it. In particular, when $epsilonleqsqrt84/83-1approx 0.006$, we show that it is NP-hard to find an approximate global dataset of the ReLU network objective with relative error $epsilon$ with respect to the objective value.
  arXiv  Detail & Related papers  (2023-11-18T04:41:07Z)
• Influences of Fourier Completely Bounded Polynomials and Classical Simulation of Quantum Algorithms [0.0]
  We show that quantum query algorithms are characterized by a new class of Fourier completely boundeds. We conjecture that all suchs have an influential variable. Our proof is simpler, obtains better constants and does not use randomness.
  arXiv  Detail & Related papers  (2023-04-13T17:58:36Z)
• A Direct Reduction from the Polynomial to the Adversary Method [92.54311953850168]
  We give a simple and direct reduction from the method (in the form of a dual) to the adversary method. This shows that any lower bound in the form of a dual is an adversary lower bound of a specific form.
  arXiv  Detail & Related papers  (2023-01-24T21:37:20Z)
• An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree [79.43134049617873]
  In this paper, we demonstrate an exponential separation between exact degree and approximate quantum query for a partial function. For an alphabet size, we have a constant versus separation complexity.
  arXiv  Detail & Related papers  (2023-01-22T22:08:28Z)
• Min-Max Optimization Made Simple: Approximating the Proximal Point Method via Contraction Maps [77.8999425439444]
  We present a first-order method that admits near-optimal convergence rates for convex/concave min-max problems. Our work is based on the fact that the update rule of the Proximal Point method can be approximated up to accuracy.
  arXiv  Detail & Related papers  (2023-01-10T12:18:47Z)
• Grothendieck inequalities characterize converses to the polynomial method [1.024113475677323]
  A surprising 'converse to the method' of Aaronson et al. (CCC16) shows that any bounded quadratic can be computed exactly by a 1-query up to a universal multiplicative factor related to the Grothendieck constant.
  arXiv  Detail & Related papers  (2022-12-16T16:26:04Z)
• Influence in Completely Bounded Block-multilinear Forms and Classical Simulation of Quantum Algorithms [3.9156637371363874]
  We prove the Aaronson-Ambainis conjecture (Theory of Computing '14) In every completely bounded degree-$d$ block-multilinear form with constant variance, there always exists a variable with influence at least $1/mathrmpoly(d)$. We obtain efficient classical almost-everywhere simulation for a particular class of quantum algorithms.
  arXiv  Detail & Related papers  (2022-03-01T03:42:24Z)
• SURF: A Simple, Universal, Robust, Fast Distribution Learning Algorithm [64.13217062232874]
  SURF is an algorithm for approximating distributions by piecewises. It outperforms state-of-the-art algorithms in experiments.
  arXiv  Detail & Related papers  (2020-02-22T01:03:33Z)
• A refinement of Reznick's Positivstellensatz with applications to quantum information theory [72.8349503901712]
  In Hilbert's 17th problem Artin showed that any positive definite in several variables can be written as the quotient of two sums of squares. Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables.
  arXiv  Detail & Related papers  (2019-09-04T11:46:26Z)

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.