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

12/29/2017
by   Aleksandrs Belovs, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/29/2017

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...
research
03/07/2023

Approximate degree lower bounds for oracle identification problems

The approximate degree of a Boolean function is the minimum degree of re...
research
08/03/2023

Quantum Lower Bounds by Sample-to-Query Lifting

We propose a quantum sample-to-query lifting theorem. It reveals a quadr...
research
07/08/2021

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...
research
10/18/2020

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...
research
06/11/2023

Detection and Recovery of Hidden Submatrices

In this paper, we study the problems of detection and recovery of hidden...
research
11/02/2022

Set Selection under Explorable Stochastic Uncertainty via Covering Techniques

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

Please sign up or login with your details

Forgot password? Click here to reset