# Improved Approximate Degree Bounds For k-distinctness

An open problem that is widely regarded as one of the most important in quantum query complexity is to resolve the quantum query complexity of the k-distinctness function on inputs of size N. While the case of k=2 (also called Element Distinctness) is well-understood, there is a polynomial gap between the known upper and lower bounds for all constants k>2. Specifically, the best known upper bound is O(N^(3/4)-1/(2^k+2-4)) (Belovs, FOCS 2012), while the best known lower bound for k >= 2 is Omega(N^2/3 + N^(3/4)-1/(2k)) (Aaronson and Shi, J. ACM 2004; Bun, Kothari, and Thaler, STOC 2018). For any constant k >= 4, we improve the lower bound to Omega(N^(3/4)-1/(4k)). This yields, for example, the first proof that 4-distinctness is strictly harder than Element Distinctness. Our lower bound applies more generally to approximate degree. As a secondary result, we give a simple construction of an approximating polynomial of degree O(N^3/4) that applies whenever k <= polylog(N).

• 11 publications
• 11 publications
• 2 publications
10/25/2017

### The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials

The approximate degree of a Boolean function f is the least degree of a ...
09/16/2019

### Vanishing-Error Approximate Degree and QMA Complexity

The ϵ-approximate degree of a function f X →{0, 1} is the least degree o...
11/07/2017

### Revisionist Simulations: A New Approach to Proving Space Lower Bounds

Determining the space complexity of x-obstruction-free k-set agreement f...
11/25/2019

### Combinatorial lower bounds for 3-query LDCs

A code is called a q-query locally decodable code (LDC) if there is a ra...
07/09/2019

### New Competitiveness Bounds for the Shared Memory Switch

We consider one of the simplest and best known buffer management archite...
09/12/2022

### An Improved Lower Bound for Matroid Intersection Prophet Inequalities

We consider prophet inequalities subject to feasibility constraints that...
08/16/2018

### Perfect L_p Sampling in a Data Stream

In this paper, we resolve the one-pass space complexity of L_p sampling ...