DeepAI AI Chat
Log In Sign Up

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

by   Aleksandrs Belovs, et al.

In this paper, we prove a polynomial lower bound of Ω(n^1/3) on the quantum query complexity of the following rather natural generalisation of both the hidden shift and the 3-sum problem. Given an array 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 lower bound is proven by a novel application of the dual learning graph framework. Additionally, we state a property testing version of the problem, for which we prove a similar lower bound.


page 1

page 2

page 3

page 4


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

In this paper, we study quantum query complexity of the following rather...

Hidden variables simulating quantum contextuality increasingly violate the Holevo bound

In this paper from 2011 we approach some questions about quantum context...

Sensitivity of quantum PageRank

In this paper, we discuss the sensitivity of quantum PageRank. By using ...

Zero-Error Sum Modulo Two with a Common Observation

This paper investigates the classical modulo two sum problem in source c...

A Family of Denominator Bounds for First Order Linear Recurrence Systems

For linear recurrence systems, the problem of finding rational solutions...

Communication Complexity of Collision

The Collision problem is to decide whether a given list of numbers (x_1,...

On Degeneracy in the P-Matroid Oriented Matroid Complementarity Problem

We investigate degeneracy in the P-Matroid Oriented Matroid Complementar...