Related papers: The probability of entanglement
Graph states play an important role in quantum information theory through their connection to measurement-based computing and error correction. Prior work has revealed elegant connections between the graph structure of these states and…
We show that for any prime odd integer $d$, there exists a correlation of size $\Theta(r)$ that can robustly self-test a maximally entangled state of dimension $4d-4$, where $r$ is the smallest multiplicative generator of…
Nonstabilizerness, or `magic', is a critical quantum resource that, together with entanglement, characterizes the non-classical complexity of quantum states. Here, we address the problem of quantifying the average nonstabilizerness of…
Two families of bipartite mixed quantum states are studied for which it is proved that the number of members in the optimal-decomposition ensemble --- the ensemble realizing the entanglement of formation --- is greater than the rank of the…
We consider smooth actions of lattices in higher-rank semisimple Lie groups on manifolds. We define two numbers $r(G)$ and $m(G)$ associated with the roots system of the Lie algebra of a Lie group $G$. If the dimension of the manifold is…
Let $M$ be a complete Riemannian manifold, $N\in \NN$ and $p\ge 1$. We prove that almost everywhere on $x=(x_1,...,x_N)\in M^N$ for Lebesgue measure in $M^N$, the measure $\di \mu(x)=\f1N\sum_{k=1}^N\d_{x_k}$ has a unique $p$-mean $e_p(x)$.…
We study macroscopic entanglement of various pure states of a one-dimensional N-spin system with N>>1. Here, a quantum state is said to be macroscopically entangled if it is a superposition of macroscopically distinct states. To judge…
We study pointwise convergence of entangled averages of the form \[ \frac{1}{N^k}\sum_{1\leq n_1,\ldots, n_k\leq N} T_m^{n_{\alpha(m)}}A_{m-1}T^{n_{\alpha(m-1)}}_{m-1}\ldots A_2T_2^{n_{\alpha(2)}}A_1T_1^{n_{\alpha(1)}} f, \] where $f\in…
An intrinsic relation between maximally entangled states and entanglement measures is revealed, which plays a role in establishing connections for different entanglement quantifiers. We exploit the basic idea and propose a framework to…
The study of transformations among pure states via Local Operations assisted by Classical Communication (LOCC) plays a central role in entanglement theory. The main emphasis of these investigations is on the deterministic, or probabilistic…
The problem of of how many entangled or, respectively, separable states there are in the set of all quantum states is investigated. We study to what extent the choice of a measure in the space of density matrices describing N--dimensional…
Inspired by its fundamental importance in quantum mechanics, we define and study the notion of entanglement for abstract physical theories, investigating its profound connection with the concept of superposition. We adopt the formalism of…
Given a `genus' function $g=g(n)$, we let $\mathcal{E}^g$ be the class of all graphs $G$ such that if $G$ has order $n$ (that is, has $n$ vertices) then it is embeddable in a surface of Euler genus at most $g(n)$. Let the random graph $R_n$…
We quantify the representational power of matrix product states (MPS) for entangled qubit systems by giving polynomial expressions in a pure quantum state's amplitudes which hold if and only if the state is a translation invariant matrix…
We prove a \emph{query complexity} lower bound for approximating the top $r$ dimensional eigenspace of a matrix. We consider an oracle model where, given a symmetric matrix $\mathbf{M} \in \mathbb{R}^{d \times d}$, an algorithm…
An in-depth theoretical study is carried out to examine the quasi-deterministic entanglement of two atoms inside a leaky cavity. Two $\Lambda$-type three-level atoms, initially in their ground states, may become maximally entangled through…
Entanglement is widely considered the cornerstone of quantum information and an essential resource for relevant quantum effects, such as quantum teleportation, quantum cryptography, or the speed-up of quantum computing, as in Shor's…
The matrix rank and its positive versions are robust for small approximations, i.e. they do not decrease under small perturbations. In contrast, the multipartite tensor rank can collapse for arbitrarily small errors, i.e. there may be a gap…
We consider random iteration of exponential entire functions, i.e. of the form ${\mathbb C}\ni z\mapsto f_\lambda(z):=\lambda e^z\in\mathbb C$, $\lambda\in{\mathbb C}\setminus \{0\}$. Assuming that $\lambda$ is in a bounded closed interval…
We show that almost surely the rank of the adjacency matrix of the Erd\"os-R\'enyi random graph $G(n,p)$ equals the number of non-isolated vertices for any $c\ln n/n<p<1/2$, where $c$ is an arbitrary positive constant larger than 1/2. In…