Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

WORLD SCIENTIFIC eBooks

IS A RANDOM STATE ENTANGLED?

Guillaume Aubrun

Published Oct 1, 2013• 0 citations
Publisher

Abstract

For a random quantum state on obtained by partial tracing a random pure state on , we consider the question whether it is typically separable or typically entangled. We show the existence of a sharp threshold s 0 = s 0 (d) of order roughly d 3 . More precisely, for any ε > 0 and for d large enough, such a random state is entangled with very large probability when s ≤ (1 − ε)s 0 , and separable with very large probability when s ≥ (1 + ε)s 0 .

DOI
10.1142/9789814449243_0052

Related papers

Entanglement Thresholds for Random Induced States

Guillaume Aubrun, Stanisław J. Szarek, Deping Ye

For a random quantum state on obtained by partial tracing a random pure state on , we consider the question whether it is typically separable or typically entangled. For this problem, we show the existence of a sharp threshold of order roughly . More precisely, for any and for d large enough, such a random state is entangled with very large probability when , and separable with very large probability when . One consequence of this result is as follows: for a system of N identical particles in a random pure state, there is a threshold such that two subsystems of k particles each typically share entanglement if k > k 0 , and typically do not share entanglement if k < k 0 . Our methods also work for multipartite systems and for “unbalanced” systems such as , . The arguments rely on random matrices, classical convexity, high‐dimensional probability, and geometry of Banach spaces; some of the auxiliary results may be of reference value. © 2013 Wiley Periodicals, Inc.

arXiv:1106.2264•Communications on Pure and Applied Mathematics•May 23, 2013•66 citations

Entanglement thresholds for random induced states

Guillaume Aubrun, Stanis Law, J. Szarek +1 more

For a random quantum state on $H=C^d \otimes C^d$ obtained by partial tracing a random pure state on $H \otimes C^s$, we consider the whether it is typically separable or typically entangled. For this problem, we show the existence of a sharp threshold $s_0=s_0(d)$ of order roughly $d^3$. More precisely, for any $a > 0$ and for d large enough, such a random state is entangled with very large probability when $s < (1-a)s_0$, and separable with very large probability when $s > (1+a)s_0$. One consequence of this result is as follows: for a system of N identical particles in a random pure state, there is a threshold $k_0 = k_0(N) \sim N/5$ such that two subsystems of k particles each typically share entanglement if $k > k_0$, and typically do not share entanglement if $k < k_0$. Our methods work also for multipartite systems and for "unbalanced" systems such as $C^{d} \otimes C^{d'}$, $d \neq d'$. The arguments rely on random matrices, classical convexity, high-dimensional probability and geometry of Banach spaces; some of the auxiliary results may be of reference value. A high-level non-technical overview of the results of this paper and of a related article arXiv:1011.0275 can be found in arXiv:1112.4582.

•Jan 1, 2014•56 citations

Thresholds for reduction-related entanglement criteria in quantum information theory

Maria Anastasia Jivulescu, Nicolae Lupa, Ion Nechita

We consider random bipartite quantum states obtained by tracing out one subsystem from a random, uniformly distributed, tripartite pure quantum state. We compute thresholds for the dimension of the system being traced out, so that the resulting bipartite quantum state satisfies the reduction criterion in different asymptotic regimes. We consider as well the basis-independent version of the reduction criterion (the absolute reduction criterion), computing thresholds for the corresponding eigenvalue sets. We do the same for other sets relevant in the study of absolute separability, using techniques from random matrix theory. Finally, we gather and compare the known values for the thresholds corresponding to different entanglement criteria, and conclude with a list of open questions.

arXiv:1503.08008•Quantum Information and Computation•Oct 1, 2015•9 citations

Bounds on entanglement in qudit subsystems

Viv M. Kendon, Karol Życzkowski, William J. Munro

The entanglement in a pure state of N qudits (d-dimensional distinguishable quantum particles) can be characterized by specifying how entangled its subsystems are. A generally mixed subsystem of m qudits is obtained by tracing over the other $N\ensuremath{-}m$ qudits. We examine the entanglement in the space of mixed states of m qudits. We show that for a typical pure state of N qudits, its subsystems smaller than $N/3$ qudits will have a positive partial transpose and hence are separable or bound entangled. Additionally, our numerical results show that the probability of finding entangled subsystems smaller than $N/3$ falls exponentially in the dimension of the Hilbert space. The bulk of pure state Hilbert space thus consists of highly entangled states with multipartite entanglement encompassing at least a third of the qudits in the pure state.

arXiv:quant-ph/0203037•Physical Review A•Dec 12, 2002•56 citations

Entanglement of phase-random states

Yoshifumi Nakata, Peter Turner, Mio Murao

In order to study generic properties of time-evolving states by time-independent Hamiltonian dynamics, we introduce phase-random states, an ensemble of pure states with fixed amplitudes and uniformly distributed phases in a fixed basis. We compute the average amount of entanglement of phase-random states analytically, and show that the average can be extremely large when the amplitudes are equal and the basis is separable. We also study implications on Hamiltonian dynamics, in particular the realization of the canonical state in a subsystem.

AIP conference proceedings•Jan 1, 2014•0 citations

Multipartite pure-state entanglement

Ashish V. Thapliyal

We show that pure states of multipartite quantum systems are multiseparable (i.e., give separable density matrices on tracing any party) if and only if they have a generalized Schmidt decomposition. Implications of this result for the quantification of multipartite pure-state entanglement are discussed. Further, as an application of the techniques used here, we show that any purification of a bipartite-bound entangled state having a positive partial transpose is tri-inseparable, i.e., has none of its three bipartite partial traces separable.

arXiv:quant-ph/9811091•Physical Review A•May 1, 1999•114 citations
For a random quantum state on obtained by partial tracing a random pure state on , we consider the question whether it is typically separable or typically entangled. We show the existence of a sharp threshold s 0 = s 0 (d) of order roughly d 3 . More precisely, for any ε > 0 and for d large enough, such a random state is entangled with very large probability when s ≤ (1 − ε)s 0 , and separable with very large probability when s ≥ (1 + ε)s 0 .
For a random quantum state on obtained by partial tracing a random pure state on , we consider the question whether it is typically separable or typically entangled. For this problem, we show the existence of a sharp threshold of order roughly . More precisely, for any and for d large enough, such a random state is entangled with very large probability when , and separable with very large probability when . One consequence of this result is as follows: for a system of N identical particles in a random pure state, there is a threshold such that two subsystems of k particles each typically share entanglement if k > k 0 , and typically do not share entanglement if k < k 0 . Our methods also work for multipartite systems and for “unbalanced” systems such as , . The arguments rely on random matrices, classical convexity, high‐dimensional probability, and geometry of Banach spaces; some of the auxiliary results may be of reference value. © 2013 Wiley Periodicals, Inc.
For a random quantum state on H=Cd⊗CdH=C^d \otimes C^dH=Cd⊗Cd obtained by partial tracing a random pure state on H⊗CsH \otimes C^sH⊗Cs, we consider the whether it is typically separable or typically entangled. For this problem, we show the existence of a sharp threshold s0=s0(d)s_0=s_0(d)s0​=s0​(d) of order roughly d3d^3d3. More precisely, for any a>0a > 0a>0 and for d large enough, such a random state is entangled with very large probability when s<(1−a)s0s < (1-a)s_0s<(1−a)s0​, and separable with very large probability when s>(1+a)s0s > (1+a)s_0s>(1+a)s0​. One consequence of this result is as follows: for a system of N identical particles in a random pure state, there is a threshold k0=k0(N)∼N/5k_0 = k_0(N) \sim N/5k0​=k0​(N)∼N/5 such that two subsystems of k particles each typically share entanglement if k>k0k > k_0k>k0​, and typically do not share entanglement if k<k0k < k_0k<k0​. Our methods work also for multipartite systems and for "unbalanced" systems such as Cd⊗Cd′C^{d} \otimes C^{d'}Cd⊗Cd′, d≠d′d \neq d'd=d′. The arguments rely on random matrices, classical convexity, high-dimensional probability and geometry of Banach spaces; some of the auxiliary results may be of reference value. A high-level non-technical overview of the results of this paper and of a related article arXiv:1011.0275 can be found in arXiv:1112.4582.
We consider random bipartite quantum states obtained by tracing out one subsystem from a random, uniformly distributed, tripartite pure quantum state. We compute thresholds for the dimension of the system being traced out, so that the resulting bipartite quantum state satisfies the reduction criterion in different asymptotic regimes. We consider as well the basis-independent version of the reduction criterion (the absolute reduction criterion), computing thresholds for the corresponding eigenvalue sets. We do the same for other sets relevant in the study of absolute separability, using techniques from random matrix theory. Finally, we gather and compare the known values for the thresholds corresponding to different entanglement criteria, and conclude with a list of open questions.
The entanglement in a pure state of N qudits (d-dimensional distinguishable quantum particles) can be characterized by specifying how entangled its subsystems are. A generally mixed subsystem of m qudits is obtained by tracing over the other $N\ensuremath{-}m$ qudits. We examine the entanglement in the space of mixed states of m qudits. We show that for a typical pure state of N qudits, its subsystems smaller than N/3N/3N/3 qudits will have a positive partial transpose and hence are separable or bound entangled. Additionally, our numerical results show that the probability of finding entangled subsystems smaller than N/3N/3N/3 falls exponentially in the dimension of the Hilbert space. The bulk of pure state Hilbert space thus consists of highly entangled states with multipartite entanglement encompassing at least a third of the qudits in the pure state.
In order to study generic properties of time-evolving states by time-independent Hamiltonian dynamics, we introduce phase-random states, an ensemble of pure states with fixed amplitudes and uniformly distributed phases in a fixed basis. We compute the average amount of entanglement of phase-random states analytically, and show that the average can be extremely large when the amplitudes are equal and the basis is separable. We also study implications on Hamiltonian dynamics, in particular the realization of the canonical state in a subsystem.
We show that pure states of multipartite quantum systems are multiseparable (i.e., give separable density matrices on tracing any party) if and only if they have a generalized Schmidt decomposition. Implications of this result for the quantification of multipartite pure-state entanglement are discussed. Further, as an application of the techniques used here, we show that any purification of a bipartite-bound entangled state having a positive partial transpose is tri-inseparable, i.e., has none of its three bipartite partial traces separable.