Quantum Proofs of Proximity

05/08/2021
by   Marcel Dall'Agnol, et al.
0

We initiate the systematic study of QMA algorithms in the setting of property testing, to which we refer as QMA proofs of proximity (QMAPs). These are quantum query algorithms that receive explicit access to a sublinear-size untrusted proof and are required to accept inputs having a property Π and reject inputs that are ε-far from Π, while only probing a minuscule portion of their input. Our algorithmic results include a general-purpose theorem that enables quantum speedups for testing an expressive class of properties, namely, those that are succinctly decomposable. Furthermore, we show quantum speedups for properties that lie outside of this family, such as graph bipartitneness. We also investigate the complexity landscape of this model, showing that QMAPs can be exponentially stronger than both classical proofs of proximity and quantum testers. To this end, we extend the methodology of Blais, Brody and Matulef (Computational Complexity, 2012) to prove quantum property testing lower bounds via reductions from communication complexity, thereby resolving a problem raised by Montanaro and de Wolf (Theory of Computing, 2016).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/17/2023

Distribution-Free Proofs of Proximity

Motivated by the fact that input distributions are often unknown in adva...
research
10/10/2020

A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy

We prove a general structural theorem for a wide family of local algorit...
research
10/12/2022

Unitary property testing lower bounds by polynomials

We study unitary property testing, where a quantum algorithm is given qu...
research
09/17/2021

Sublinear-Time Computation in the Presence of Online Erasures

We initiate the study of sublinear-time algorithms that access their inp...
research
05/28/2018

Quantum generalizations of the polynomial hierarchy with applications to QMA(2)

The polynomial-time hierarchy (PH) has proven to be a powerful tool for ...
research
12/07/2022

Quantum Lower Bounds for Finding Stationary Points of Nonconvex Functions

Quantum algorithms for optimization problems are of general interest. De...
research
05/18/2021

GSF-locality is not sufficient for proximity-oblivious testing

In Property Testing, proximity-oblivious testers (POTs) form a class of ...

Please sign up or login with your details

Forgot password? Click here to reset