Schmidt rank constraints in Quantum Information Theory
- URL: http://arxiv.org/abs/2004.04226v4
- Date: Tue, 22 Jun 2021 14:09:48 GMT
- Title: Schmidt rank constraints in Quantum Information Theory
- Authors: Daniel Cariello
- Abstract summary: We show how to create a positive under partial transpose entangled state from any state supported on the antisymmetric space.
We also show that the Schmidt number of operator Schmidt rank 3 states of $mathcalM_motimes mathcalM_n (mleq n)$ that are invariant under left partial transpose cannot exceed $m-2$.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Can vectors with low Schmidt rank form mutually unbiased bases? Can vectors
with high Schmidt rank form positive under partial transpose states? In this
work, we address these questions by presenting several new results related to
Schmidt rank constraints and their compatibility with other properties. We
provide an upper bound on the number of mutually unbiased bases of
$\mathbb{C}^m\otimes\mathbb{C}^n$ $(m\leq n)$ formed by vectors with low
Schmidt rank. In particular, the number of mutually unbiased product bases of
$\mathbb{C}^m\otimes\mathbb{C}^n$ cannot exceed $m+1$, which solves a
conjecture proposed by McNulty et al. Then we show how to create a positive
under partial transpose entangled state from any state supported on the
antisymmetric space and how their Schmidt numbers are exactly related. Finally,
we show that the Schmidt number of operator Schmidt rank 3 states of
$\mathcal{M}_m\otimes \mathcal{M}_n\ (m\leq n)$ that are invariant under left
partial transpose cannot exceed $m-2$.
Related papers
- The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$.
As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
arXiv Detail & Related papers (2024-10-26T06:21:42Z) - Extending Schmidt vector from pure to mixed states for characterizing entanglement [0.0]
We extend the concept of Schmidt vector from pure to mixed bipartite states.
We show that the Schmidt vector fully characterizes separable and maximally entangled states.
We introduce a family of entanglement monotones by considering concave and symmetric functions applied to the Schmidt vector.
arXiv Detail & Related papers (2024-07-24T12:00:09Z) - The Schmidt rank for the commuting operator framework [58.720142291102135]
The Schmidt rank is a measure for the entanglement dimension of a pure bipartite state.
We generalize the Schmidt rank to the commuting operator framework.
We analyze bipartite states and compute the Schmidt rank in several examples.
arXiv Detail & Related papers (2023-07-21T14:37:33Z) - $k$-positivity and Schmidt number under orthogonal group symmetries [1.8376637012033794]
We study $k$-positivity and Schmidt number under standard group symmetries.
The Schmidt number is a natural quantification of entanglement in quantum information theory.
arXiv Detail & Related papers (2023-06-01T13:22:55Z) - Schmidt decomposition of parity adapted coherent states for symmetric
multi-quDits [0.0]
We study the entanglement in symmetric $N$-quDit systems using generalizations to $U(D)$ of spin $U(2)$ coherent states.
Diverse properties of the Schmidt eigenvalues are studied and, in particular, for the (rescaled) double thermodynamic limit ($N,Mrightarrowinfty,,M/N$ fixed), we reproduce and generalize quDits known results for photon loss of parity adapted coherent states.
arXiv Detail & Related papers (2023-01-22T20:15:49Z) - Near-optimal fitting of ellipsoids to random points [68.12685213894112]
A basic problem of fitting an ellipsoid to random points has connections to low-rank matrix decompositions, independent component analysis, and principal component analysis.
We resolve this conjecture up to logarithmic factors by constructing a fitting ellipsoid for some $n = Omega(, d2/mathrmpolylog(d),)$.
Our proof demonstrates feasibility of the least squares construction of Saunderson et al. using a convenient decomposition of a certain non-standard random matrix.
arXiv Detail & Related papers (2022-08-19T18:00:34Z) - Uncertainties in Quantum Measurements: A Quantum Tomography [52.77024349608834]
The observables associated with a quantum system $S$ form a non-commutative algebra $mathcal A_S$.
It is assumed that a density matrix $rho$ can be determined from the expectation values of observables.
Abelian algebras do not have inner automorphisms, so the measurement apparatus can determine mean values of observables.
arXiv Detail & Related papers (2021-12-14T16:29:53Z) - Spectral properties of sample covariance matrices arising from random
matrices with independent non identically distributed columns [50.053491972003656]
It was previously shown that the functionals $texttr(AR(z))$, for $R(z) = (frac1nXXT- zI_p)-1$ and $Ain mathcal M_p$ deterministic, have a standard deviation of order $O(|A|_* / sqrt n)$.
Here, we show that $|mathbb E[R(z)] - tilde R(z)|_F
arXiv Detail & Related papers (2021-09-06T14:21:43Z) - Global Convergence of Gradient Descent for Asymmetric Low-Rank Matrix
Factorization [49.090785356633695]
We study the asymmetric low-rank factorization problem: [mathbfU in mathbbRm min d, mathbfU$ and mathV$.
arXiv Detail & Related papers (2021-06-27T17:25:24Z) - Representation of symmetry transformations on the sets of tripotents of
spin and Cartan factors [0.0]
We prove that in order that the description of the spin will be relativistic, it is not enough to preserve the projection lattice equipped with its natural partial order and denoteity.
This, in particular, extends a result of Moln'ar to the wider setting of atomic JBW$*$-triples not containing rank-one Cartan factors.
arXiv Detail & Related papers (2021-01-03T17:21:02Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.