Quantum Lower Bounds for 2D-Grid and Dyck Language

by   Andris Ambainis, et al.

We show quantum lower bounds for two problems. First, we consider the problem of determining if a sequence of parentheses is a properly balanced one (a Dyck word), with a depth of at most k. It has been known that, for any k, Õ(√(n)) queries suffice, with a Õ term depending on k. We prove a lower bound of Ω(c^k √(n)), showing that the complexity of this problem increases exponentially in k. This is interesting as a representative example of star-free languages for which a surprising Õ(√(n)) query quantum algorithm was recently constructed by Aaronson et al. Second, we consider connectivity problems on directed/undirected grid in 2 dimensions, if some of the edges of the grid may be missing. By embedding the "balanced parentheses" problem into the grid, we show a lower bound of Ω(n^1.5-ϵ) for the directed 2D grid and Ω(n^2-ϵ) for the undirected 2D grid. The directed problem is interesting as a black-box model for a class of classical dynamic programming strategies including the one that is usually used for the well-known edit distance problem. We also show a generalization of this result to more than 2 dimensions.


page 1

page 2

page 3

page 4


Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language

We study the quantum query complexity of two problems. First, we consi...

Quantum Query Complexity of Dyck Languages with Bounded Height

We consider the problem of determining if a sequence of parentheses is w...

Lower Bounds for Function Inversion with Quantum Advice

Function inversion is that given a random function f: [M] → [N], we want...

Sparsification of Balanced Directed Graphs

Sparsification, where the cut values of an input graph are approximately...

Automation Strategies for Unconstrained Crossword Puzzle Generation

An unconstrained crossword puzzle is a generalization of the constrained...

Lower bounds on the error probability of multiple quantum channel discrimination by the Bures angle and the trace distance

Quantum channel discrimination is a fundamental problem in quantum infor...

Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming and Linear Algebra

For many cache-oblivious algorithms for dynamic programming and linear a...

Please sign up or login with your details

Forgot password? Click here to reset