PPT states of almost maximal Schmidt number

• URL: http://arxiv.org/abs/2609.11849v1
• Date: Thu, 10 Sep 2026 17:35:29 GMT
• Title: PPT states of almost maximal Schmidt number
• Abstract summary: We construct a PPT state with Schmidt number at least $$ leftlceil fracm + n - ((m - n)2 + 4(m + n - 1))1/22 rightrceil.<n>In the case of equal local dimensions, our result shows that there exists a PPT state on $mathbbCn otimes mathbbC3n-4$ with Schmidt number at least $n-1$.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We construct PPT states on $\mathbb{C}^m \otimes\mathbb{C}^n$ that have Schmidt number asymptotically approaching the smaller local dimension. More specifically, we construct a PPT state with Schmidt number at least $$ \left\lceil \frac{m + n - ((m - n)^2 + 4(m + n - 1))^{1/2}}{2} \right\rceil. $$ In the case of equal local dimensions ($m = n$), this becomes $n - \lfloor(2n - 1)^{1/2}\rfloor$, far exceeding the previous constructions which achieved $n/2 + O(1)$. In the case of unequal local dimensions, our result shows that there exists a PPT state on $\mathbb{C}^n \otimes \mathbb{C}^{3n-4}$ with Schmidt number at least $n-1$.

Related papers

• Rényi exponent landscape of multipartite entanglement in free-fermion systems [51.56484100374058]
  We show that the Rényi tripartite information $I_3() exhibits a qualitatively $exclusion-dependent scaling at small Fermi momentum.<n>A direct consequence is a replica obstruction: $I_m(n)/I_m(1) sim zm-1 to 0$ for all integer $n geq 2$, so the leading von Neumann signal cannot be reconstructed from integer Rényi data.
  arXiv  Detail & Related papers  (2026-03-09T22:27:00Z)
• Approximating the operator norm of local Hamiltonians via few quantum states [53.16156504455106]
  Consider a Hermitian operator $A$ acting on a complex Hilbert space of $2n$.<n>We show that when $A$ has small degree in the Pauli expansion, or in other words, $A$ is a local $n$-qubit Hamiltonian.<n>We show that whenever $A$ is $d$-local, textiti.e., $deg(A)le d$, we have the following discretization-type inequality.
  arXiv  Detail & Related papers  (2025-09-15T14:26:11Z)
• Symmetry reduction for testing $k$-block-positivity via extendibility [8.247261926186477]
  We exploit the unitary symmetry of the maximally entangled state to reduce the size of the corresponding semidefinite programs.<n>For example, for $k=2$, the SDP is reduced from one block of size $2N+1 dN+1$ to $lfloor fracN+12 rfloor$ blocks of size.
  arXiv  Detail & Related papers  (2025-05-28T08:26:34Z)
• 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)
• Measuring quantum relative entropy with finite-size effect [53.64687146666141]
  We study the estimation of relative entropy $D(rho|sigma)$ when $sigma$ is known.<n>Our estimator attains the Cram'er-Rao type bound when the dimension $d$ is fixed.
  arXiv  Detail & Related papers  (2024-06-25T06:07:20Z)
• Efficient Continual Finite-Sum Minimization [52.5238287567572]
  We propose a key twist into the finite-sum minimization, dubbed as continual finite-sum minimization. Our approach significantly improves upon the $mathcalO(n/epsilon)$ FOs that $mathrmStochasticGradientDescent$ requires. We also prove that there is no natural first-order method with $mathcalOleft(n/epsilonalpharight)$ complexity gradient for $alpha 1/4$, establishing that the first-order complexity of our method is nearly tight.
  arXiv  Detail & Related papers  (2024-06-07T08:26:31Z)
• Estimating the Mixing Coefficients of Geometrically Ergodic Markov Processes [5.00389879175348]
  We estimate the individual $beta$-mixing coefficients of a real-valued geometrically ergodic Markov process from a single sample-path. Naturally no density assumptions are required in this setting; the expected error rate is shown to be of order $mathcal O(log(n) n-1/2)$.
  arXiv  Detail & Related papers  (2024-02-11T20:17:10Z)
• Bounds on $k$-Uniform Quantum States [22.266687858571363]
  We provide new upper bounds on the parameter $k$ for the existence of $k$-uniform states in $(mathbbCd)otimes N$. Since a $k$-uniform state in $(mathbbCd)otimes N$ corresponds to a pure $(N,1,k+1)_d$ quantum error-correcting codes, we also give new upper bounds on the minimum distance $k+1$ of pure $(N,1,k+1))_d$ quantum error-correcting codes
  arXiv  Detail & Related papers  (2023-10-10T07:38:13Z)
• Synthesis and upper bound of Schmidt rank of the bipartite controlled-unitary gates [0.0]
  We show that $2(N-1)$ generalized controlled-$X$ (GCX) gates, $6$ single-qubit rotations about the $y$- and $z$-axes, and $N+5$ single-partite $y$- and $z$-rotation-types are required to simulate it. The quantum circuit for implementing $mathcalU_cu(2otimes N)$ and $mathcalU_cd(Motimes N)$ are presented.
  arXiv  Detail & Related papers  (2022-09-11T06:24:24Z)
• Enlarging the notion of additivity of resource quantifiers [62.997667081978825]
  Given a quantum state $varrho$ and a quantifier $cal E(varrho), it is a hard task to determine $cal E(varrhootimes N)$. We show that the one shot distillable entanglement of certain spherically symmetric states can be quantitatively approximated by such an augmented additivity.
  arXiv  Detail & Related papers  (2022-07-31T00:23:10Z)
• Low-degree learning and the metric entropy of polynomials [44.99833362998488]
  We prove that any (deterministic or randomized) algorithm which learns $mathscrF_nd$ with $L$-accuracy $varepsilon$ requires at least $Omega(sqrtvarepsilon)2dlog n leq log mathsfM(mathscrF_n,d,|cdot|_L,varepsilon) satisfies the two-sided estimate $$c (1-varepsilon)2dlog
  arXiv  Detail & Related papers  (2022-03-17T23:52:08Z)
• Schmidt rank constraints in Quantum Information Theory [0.0]
  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$.
  arXiv  Detail & Related papers  (2020-04-08T19:56:20Z)

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.