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

TQC, pp. 3:1-3:15, 2018.

Cited by: 0|Bibtex|Views7|Links
EI

Abstract:

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 $3times n$ elements, is ...More

Code:

Data:

Your rating :
0

 

Tags
Comments