Time-Space Lower Bounds for Simulating Proof Systems with Quantum and Randomized Verifiers

12/01/2020
∙
by   Abhijit S. Mudigonda, et al.
∙
0
∙

A line of work initiated by Fortnow in 1997 has proven model-independent time-space lower bounds for the 𝖲𝖠𝖳 problem and related problems within the polynomial-time hierarchy. For example, for the 𝖲𝖠𝖳 problem, the state-of-the-art is that the problem cannot be solved by random-access machines in n^c time and n^o(1) space simultaneously for c < 2cos(π/7) ≈ 1.801. We extend this lower bound approach to the quantum and randomized domains. Combining Grover's algorithm with components from 𝖲𝖠𝖳 time-space lower bounds, we show that there are problems verifiable in O(n) time with quantum Merlin-Arthur protocols that cannot be solved in n^c time and n^o(1) space simultaneously for c < 3+√(3)/2≈ 2.366, a super-quadratic time lower bound. This result and the prior work on 𝖲𝖠𝖳 can both be viewed as consequences of a more general formula for time lower bounds against small-space algorithms, whose asymptotics we study in full. We also show lower bounds against randomized algorithms: there are problems verifiable in O(n) time with (classical) Merlin-Arthur protocols that cannot be solved in n^c randomized time and n^o(1) space simultaneously for c < 1.465, improving a result of Diehl. For quantum Merlin-Arthur protocols, the lower bound in this setting can be improved to c < 1.5.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 31

∙ 06/10/2020

Tight Quantum Time-Space Tradeoffs for Function Inversion

In function inversion, we are given a function f: [N] ↦ [N], and want to...
∙ 08/08/2017

Time-Space Tradeoffs for Learning from Small Test Spaces: Learning Low Degree Polynomial Functions

We develop an extension of recently developed methods for obtaining time...
∙ 03/30/2014

Sharpened Error Bounds for Random Sampling Based ℓ_2 Regression

Given a data matrix X ∈ R^n× d and a response vector y ∈ R^n, suppose n>...
∙ 02/20/2020

Quantum Time-Space Tradeoffs by Recording Queries

We use the recording queries technique of Zhandry [Zha19] to prove lower...
∙ 08/11/2020

Multi-User Distillation of Common Randomness and Entanglement from Quantum States

We construct new protocols for the tasks of converting noisy multipartit...
∙ 11/07/2017

Revisionist Simulations: A New Approach to Proving Space Lower Bounds

Determining the space complexity of x-obstruction-free k-set agreement f...
∙ 12/24/2021

From Bit-Parallelism to Quantum: Breaking the Quadratic Barrier

Many problems that can be solved in quadratic time have bit-parallel spe...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.