Related papers: A generic quantum Wielandt's inequality
Lie algebras provide a useful framework for theoretical analysis in quantum machine learning, particularly in hybrid quantum-classical learning. From the viewpoint of function approximation, expectation values of parameterized quantum…
In this report we are aiming at introducing a global measure of non-classicality of the state space of $N$-level quantum systems and estimating it in the limit of large $N$. For this purpose we employ the Wigner function negativity as a…
A key concept of quantum information theory is that accessing information encoded in a quantum system requires us to discriminate between several possible states the system could be in. A natural generalization of this problem, namely,…
We study the minimum spanning tree (MST) problem in the massively parallel computation (MPC) model. Our focus is particularly on the *strictly sublinear* regime of MPC where the space per machine is $O(n^\delta)$. Here $n$ is the number of…
Wiener's criterion for the regularity of a boundary point with respect to the Dirichlet problem for the Laplace equation has been extended to various classes of elliptic and parabolic partial differential equations. They include linear…
Suppose $\{ X_k \}_{k \in \mathbb{Z}}$ is a sequence of bounded independent random matrices with common dimension $d\times d$ and common expectation $\mathbb{E}[ X_k ]= X$. Under these general assumptions, the normalized random matrix…
For a complex number $x$, $\Vert x\Vert:=\min\{|x-m|:m\in\mathbb{Z}\}$. Let $k\geq 1$ be an integer, and $K$ be a number field. Let $\alpha_1,\ldots,\alpha_k$ be algebraic numbers with $|\alpha_i|\geq 1$ and let $d_i$ denotes the degree of…
We prove a lower bound on the information leakage of any classical protocol computing the equality function in the simultaneous message passing (SMP) model. Our bound is valid in the finite length regime and is strong enough to demonstrate…
Inferring nonlinear features of quantum states is fundamentally important across quantum information science, but remains challenging due to the intrinsic linearity of quantum mechanics. It is widely recognized that quantum memory and…
We present a class of maximally entangled states generated by a high-dimensional generalisation of the \textsc{cnot} gate. The advantage of our approach is the simple algebraic structure of both entangling operator and resulting entangled…
We propose a generalization of the Wasserstein distance of order 1 to the quantum states of $n$ qudits. The proposal recovers the Hamming distance for the vectors of the canonical basis, and more generally the classical Wasserstein distance…
We consider the task of approximating the ground state energy of two-local quantum Hamiltonians on bounded-degree graphs. Most existing algorithms optimize the energy over the set of product states. Here we describe a family of shallow…
We consider the problem of bounded-error quantum state identification: given either state \alpha_0 or state \alpha_1, we are required to output `0', `1' or `?' ("don't know"), such that conditioned on outputting `0' or `1', our guess is…
We show that for almost any vector $v$ in $\mathbb{R}^n$, for any $\epsilon>0$ there exists $\delta>0$ such that the dimension of the set of vectors $w$ satisfying $\liminf_{k\to\infty} k^{1/n}<kv-w> \ge \epsilon$ (where $<\cdot>$ denotes…
If $G$ is a finite Abelian group, define $s_{k}(G)$ to be the minimal $m$ such that a sequence of $m$ elements in $G$ always contains a $k$-element subsequence which sums to zero. Recently Bitz et al. proved that if $n = exp(G)$, then…
This paper resolves one of the longest standing basic problems in the streaming computational model. Namely, optimal construction of quantile sketches. An $\varepsilon$ approximate quantile sketch receives a stream of items $x_1,\ldots,x_n$…
In this paper we explore fundamental problems in randomized communication complexity such as computing Set Intersection on sets of size $k$ and Equality Testing between vectors of length $k$. Sa\u{g}lam and Tardos and Brody et al. showed…
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…
We study a refinement of the quantum unique ergodicity conjecture for shrinking balls on arithmetic hyperbolic manifolds, with a focus on dimensions $ 2 $ and $ 3 $. For the Eisenstein series for the modular surface $\mathrm{PSL}_2(…
The violation of Bell inequality not only provides the most radical departure of quantum theory from classical concepts, but also paves the way of applications in such as device independent randomness certification. Here, we derive the…