Related papers: A generic quantum Wielandt's inequality

We show that in a quantum system evolving unitarily under a stochastic quantum circuit the notions of irreversibility, universality of computation, and entanglement are closely related. As the state evolves from an initial product state, it…

Quantum entanglement and its paradoxical properties hold the key to an information processing revolution. Much attention has focused recently on the challenging problem of characterizing entanglement. Entanglement for a two qubit system is…

We consider the ground state of the quantum Ising model with transverse field $h$ in one dimension in a finite volume \[ \Lambda{_{m}:=\{-m,-m+1,\ldots,m+L\}\ .}% \] For $h$ sufficiently large we prove a bound for the entanglement of the…

Previous results indicate that while chaos can lead to substantial entropy production, thereby maximizing dynamical entanglement, this still falls short of maximality. Random Matrix Theory (RMT) modeling of composite quantum systems,…

We consider the classical problem of sorting an input array containing $n$ elements, where each element is described with a $k$-bit comparison-key and a $w$-bit payload. A long-standing open problem is whether there exist $(k + w) \cdot o(n…

Using lie algebra, this brief text provides an upper bound on the universality of QAOA. That is, we prove that the upper bound for the number of alterations of QAOA required to approximate a universal gate set is within O(n)

We introduce schemes for linear-optical quantum state generation. A quantum state generator is a device that prepares a desired quantum state using product inputs from photon sources, linear-optical networks, and postselection using photon…

We compute analytically the distributions of concurrence $\bm{\mathcal{C}}$ and squared norm $\bm{\mathcal{N}}$ for the production of electronic entanglement in a chaotic quantum dot. The dot is connected to the external world via one ideal…

It is known that the dual of the general adversary bound can be used to build quantum query algorithms with optimal complexity. Despite this result, not many quantum algorithms have been designed this way. This paper shows another example…

We consider large non-Hermitian $N\times N$ matrices with an additive independent, identically distributed (i.i.d.) noise for each matrix elements. We show that already a small noise of variance $1/N$ completely thermalises the bulk…

In this paper, we consider the orthogonal product set (OPS) with strong quantum nonlocality. Based on the decomposition of plane geometry, we present a sufficient condition for the triviality of orthogonality-preserving POVM on fixed…

While the no-cloning theorem forbids the perfect replication of quantum information, it is sometimes possible to produce large numbers of replicas with vanishingly small error. This phenomenon, known as quantum superreplication, can take…

We study the density estimation problem defined as follows: given $k$ distributions $p_1, \ldots, p_k$ over a discrete domain $[n]$, as well as a collection of samples chosen from a ``query'' distribution $q$ over $[n]$, output $p_i$ that…

For the optimal success probability under minimum-error discrimination between $r\geq2$ arbitrary quantum states prepared with any a priori probabilities, we find new general analytical lower and upper bounds and specify the relations…

The polynomial method by Beals, Buhrman, Cleve, Mosca, and de Wolf (FOCS 1998, J. ACM 2001), the adversary method by Ambainis (STOC 2000, J. Comput. Syst. Sci. 2002), and the compressed oracle method by Zhandry (CRYPTO 2019) have been shown…

We consider random generalizations of a quantum model of infinite range introduced by Emch and Radin. The generalization allows a neat extension from the class $l_1$ of absolutely summable lattice potentials to the optimal class $l_2$ of…

The unique entanglement measure is concurrence in a 2-qubit pure state. The maximum violation of Bell's inequality is monotonically increasing for this quantity. Therefore, people expect that pure state entanglement is relevant to the…

We provide an answer to a question raised by Levine and Weinberger in their $1986$ paper concerning the difference between Dirichlet and Neumann eigenvalues of the Laplacian on bounded domains in $\mathbb{R}^{n}$. More precisely, we show…

We study the quantum query complexity of two problems. First, we consider the problem of determining if a sequence of parentheses is a properly balanced one (a Dyck word), with a depth of at most $k$. We call this the $Dyck_{k,n}$ problem.…

Ground-state preparation is a fundamental task in quantum simulation, because the overlap of the prepared state with the true ground state significantly affects the overall cost of subsequent quantum algorithms. We propose a three-stage…