DeepAI AI Chat
Log In Sign Up

Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems

by   Aleksandrs Belovs, et al.

In this paper, we study quantum query complexity of the following rather natural tripartite generalisations (in the spirit of the 3-sum problem) of the hidden shift and the set equality problems, which we call the 3-shift-sum and the 3-matching-sum problems. The 3-shift-sum problem is as follows: given a table of 3× n elements, is it possible to circularly shift its rows so that the sum of the elements in each column becomes zero? It is promised that, if this is not the case, then no 3 elements in the table sum up to zero. The 3-matching-sum problem is defined similarly, but it is allowed to arbitrarily permute elements within each row. For these problems, we prove lower bounds of Ω(n^1/3) and Ω(√(n)), respectively. The second lower bound is tight. The lower bounds are proven by a novel application of the dual learning graph framework and by using representation-theoretic tools.


page 1

page 2

page 3

page 4


Quantum Lower Bound for a Tripartite Version of the Hidden Shift Problem

In this paper, we prove a polynomial lower bound of Ω(n^1/3) on the quan...

Sum of squares lower bounds from symmetry and a good story

In this paper, we develop machinery for proving sum of squares lower bou...

Machinery for Proving Sum-of-Squares Lower Bounds on Certification Problems

In this paper, we construct general machinery for proving Sum-of-Squares...

On Near-Linear-Time Algorithms for Dense Subset Sum

In the Subset Sum problem we are given a set of n positive integers X an...

Set Selection under Explorable Stochastic Uncertainty via Covering Techniques

Given subsets of uncertain values, we study the problem of identifying t...

Multidimensional Included and Excluded Sums

This paper presents algorithms for the included-sums and excluded-sums p...