Related papers: Quantum lower bounds for the set equality problems
Bell inequality violation is one of the most widely known manifestations of entanglement in quantum mechanics; indicating that experiments on physically separated quantum mechanical systems cannot be given a local realistic description.…
We investigate the problem of determining a set S of k indistinguishable integers in the range [1,n]. The algorithm is allowed to query an integer $q\in [1,n]$, and receive a response comparing this integer to an integer randomly chosen…
The area of computing with uncertainty considers problems where some information about the input elements is uncertain, but can be obtained using queries. For example, instead of the weight of an element, we may be given an interval that is…
We extend Shi's 2002 quantum lower bound for collision in $r$-to-one functions with $n$ inputs. Shi's bound of $\Omega((n/r)^{1/3})$ is tight, but his proof applies only in the case where the range has size at least $3n/2$. We give a…
The degree of a polynomial representing (or approximating) a function f is a lower bound for the number of quantum queries needed to compute f. This observation has been a source of many lower bounds on quantum algorithms. It has been an…
We establish a lower bound of $\Omega{(\sqrt{n})}$ on the bounded-error quantum query complexity of read-once Boolean functions, providing evidence for the conjecture that $\Omega(\sqrt{D(f)})$ is a lower bound for all Boolean functions.…
We study the concurrence of arbitrary dimensional bipartite quantum systems. By using a positive but not completely positive map, we present an analytical lower bound of concurrence. Detailed examples are used to show that our bound can…
The Element Distinctness problem is to decide whether each character of an input string is unique. The quantum query complexity of Element Distinctness is known to be $\Theta(N^{2/3})$; the polynomial method gives a tight lower bound for…
We show that Nechiporuk's method for proving lower bounds for Boolean formulas can be extended to the quantum case. This leads to an $\Omega(n^2 / \log^2 n)$ lower bound for quantum formulas computing an explicit function. The only known…
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…
We provide a quantitative lower bound to the Cheeger constant of a set $\Omega$ in both the Euclidean and the Gaussian settings in terms of suitable asymmetry indexes. We provide examples which show that these quantitative estimates are…
It is an established fact that entanglement is a resource. Sharing an entangled state leads to non-local correlations and to violations of Bell inequalities. Such non-local correlations illustrate the advantage of quantum resources over…
We investigate the complexity of sorting in the model of sequential quantum circuits. While it is known that in general a quantum algorithm based on comparisons alone cannot outperform classical sorting algorithms by more than a constant…
In [1] the problem of finding a sharp lower bound on lower against number of a general graph is mentioned as an open question. We solve the problem by establishing a tight lower bound on lower against number of a general graph in terms of…
The query model offers a concrete setting where quantum algorithms are provably superior to randomized algorithms. Beautiful results by Bernstein-Vazirani, Simon, Aaronson, and others presented partial Boolean functions that can be computed…
We consider two combinatorial problems. The first we call "search with wildcards": given an unknown n-bit string x, and the ability to check whether any subset of the bits of x is equal to a provided query string, the goal is to output x.…
Quantum hypothesis testing concerns the discrimination between quantum states. This paper introduces a novel lower bound for asymmetric quantum hypothesis testing that is based on the Nussbaum-Szko{\l}a mapping. The lower bound provides a…
Given a non-negative $n \times n$ matrix viewed as a set of distances between $n$ points, we consider the property testing problem of deciding if it is a metric. We also consider the same problem for two special classes of metrics, tree…
We present a lower bound of concurrence for four-partite systems in terms of the concurrence for $M\, (2\leq M\leq 3)$ part quantum systems and give an analytical lower bound for $2\otimes2\otimes2\otimes2$ mixed quantum sates. It is shown…
We propose an approach for quantifying a quantum circuit's quantumness as a means to understand the nature of quantum algorithmic speedups. Since quantum gates that do not preserve the computational basis are necessary for achieving quantum…