pith. sign in

arxiv: 2510.24110 · v2 · pith:CIQ5UOVRnew · submitted 2025-10-28 · 🪐 quant-ph

Quantum separability criteria from bipartite systems to multipartite systems based on generalized Bloch representation

Linwei Li , Chunlin Yang , Hongmei Yao , Aimin Xu , Zhaobing Fan , Shao-Ming Fei This is my paper

Pith reviewed 2026-05-21 19:51 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum entanglementseparability criteriaBloch representationcorrelation tensormultipartite systemsentanglement detection
0
0 comments X

The pith

A parameterized extended correlation tensor from generalized Bloch representation yields tighter separability criteria for bipartite and multipartite quantum entanglement.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops separability criteria to determine whether quantum states are entangled or separable. It constructs a parameterized extended correlation tensor using the generalized Bloch representation under an arbitrary orthogonal basis. This construction improves upon existing methods by providing stronger conditions for entanglement detection. The framework is then extended to multipartite systems through generalized matrix unfolding. Examples in the paper show that these criteria can identify entanglement in cases where previous approaches fall short.

Core claim

By constructing a novel parameterized extended correlation tensor via the generalized Bloch representation under an arbitrary orthogonal basis, and generalizing this construction to multipartite systems with generalized matrix unfolding, the resulting separability criteria demonstrate an enhanced capability in detecting entanglement.

What carries the argument

The parameterized extended correlation tensor built from the generalized Bloch representation under an arbitrary orthogonal basis, which generates valid and tighter separability conditions.

If this is right

  • The new criteria apply to both bipartite and multipartite quantum systems.
  • They provide stronger detection power for entanglement in detailed examples.
  • The parameterization allows for potentially optimized detection bounds.
  • The approach works with any orthogonal basis choice in the representation.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • This method might be combined with numerical optimization to find the best parameters for specific states.
  • It could inspire similar tensor-based criteria in other quantum information tasks like steering or discord.
  • Experimental verification could involve preparing states known to be entangled and checking if the criteria flag them correctly.

Load-bearing premise

The generalized Bloch representation under an arbitrary orthogonal basis yields a parameterized extended correlation tensor with separability conditions that are valid and improve on earlier criteria.

What would settle it

A specific quantum state that is known to be entangled but for which all instances of the new parameterized criterion indicate separability would disprove the enhanced detection claim.

Figures

Figures reproduced from arXiv: 2510.24110 by Aimin Xu, Chunlin Yang, Hongmei Yao, Linwei Li, Shao-Ming Fei, Zhaobing Fan.

Figure 1
Figure 1. Figure 1: FIG. 1: The relation between the entanglement detection of [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2: The relation between the entanglement detection of [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3: The mixed ( [PITH_FULL_IMAGE:figures/full_fig_p010_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4: The mixed ([3] [PITH_FULL_IMAGE:figures/full_fig_p011_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5: The relation between the entanglement detection of [PITH_FULL_IMAGE:figures/full_fig_p015_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6: The relation between the entanglement detection of [PITH_FULL_IMAGE:figures/full_fig_p017_6.png] view at source ↗
read the original abstract

Quantum entanglement serves as a fundamental resource in quantum information theory. This paper presents a comprehensive framework of separability criteria for detecting bipartite and multipartite entanglements. We construct a novel parameterized extended correlation tensor via the generalized Bloch representation under an arbitrary orthogonal basis, which improves the performance of entanglement detection. Moreover, we employ the generalized matrix unfolding to generalize the extended correlation tensor construction to multipartite systems, obtaining separability criteria for multipartite entanglement. Detailed examples demonstrate that our separability criteria exhibit enhanced capability in detecting entanglement.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper proposes a framework of separability criteria for bipartite and multipartite quantum entanglement. It constructs a novel parameterized extended correlation tensor from the generalized Bloch representation of each subsystem under an arbitrary orthogonal basis, then applies generalized matrix unfolding to extend the construction to multipartite systems. Examples are presented to illustrate that the resulting criteria detect entanglement more effectively than previous approaches.

Significance. If the derived inequalities can be shown to be valid and independent of the local orthogonal basis choice, the work would supply a tunable family of entanglement witnesses that build directly on the Bloch-vector formalism and potentially tighten detection bounds for both bipartite and multipartite states. Such criteria could be practically useful in quantum information tasks where standard norm-based witnesses are insufficient.

major comments (2)
  1. [Abstract and bipartite construction] Abstract and the bipartite construction section: the separability inequalities obtained from the parameterized extended correlation tensor are asserted to hold for all separable states and to be tighter than prior criteria. However, the construction begins from the generalized Bloch representation under an arbitrary orthogonal basis without an explicit invariance argument or basis-adjustment step. If the bound on the tensor norm (or contraction) depends on the particular choice of local frames, a separable state could violate the inequality in one valid basis while satisfying it in another, rendering the criterion basis-dependent rather than generally valid.
  2. [Multipartite generalization] Multipartite generalization via generalized matrix unfolding: the extension of the extended correlation tensor to multipartite systems is described, but no derivation is supplied showing that the resulting separability conditions remain valid (i.e., satisfied by all fully separable states) after unfolding and that the tunable parameter continues to produce strictly tighter bounds than existing multipartite witnesses.
minor comments (2)
  1. The abstract refers to 'detailed examples' demonstrating enhanced detection, yet the provided text does not include the explicit systems, numerical values, or quantitative comparisons with prior criteria; adding these data would strengthen the empirical support.
  2. Notation for the tunable parameter in the extended tensor and for the unfolding operation should be introduced with a clear definition and a statement of its range to avoid ambiguity in the multipartite case.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on our manuscript. We address each major comment below and have revised the manuscript to strengthen the presentation.

read point-by-point responses

  1. Referee: [Abstract and bipartite construction] Abstract and the bipartite construction section: the separability inequalities obtained from the parameterized extended correlation tensor are asserted to hold for all separable states and to be tighter than prior criteria. However, the construction begins from the generalized Bloch representation under an arbitrary orthogonal basis without an explicit invariance argument or basis-adjustment step. If the bound on the tensor norm (or contraction) depends on the particular choice of local frames, a separable state could violate the inequality in one valid basis while satisfying it in another, rendering the criterion basis-dependent rather than generally valid.

    Authors: We agree that an explicit invariance argument is required to rigorously establish that the separability criteria are independent of the local orthogonal basis choice. The original manuscript relied on the intrinsic properties of the generalized Bloch representation but did not include a dedicated proof. In the revised version we have inserted a new subsection proving that the norm of the parameterized extended correlation tensor is invariant under simultaneous local orthogonal transformations of the bases. The proof proceeds by showing that the relevant contractions transform as scalars under the corresponding unitary changes of frame, so that the inequality remains valid for every separable state irrespective of the chosen bases. revision: yes

  2. Referee: [Multipartite generalization] Multipartite generalization via generalized matrix unfolding: the extension of the extended correlation tensor to multipartite systems is described, but no derivation is supplied showing that the resulting separability conditions remain valid (i.e., satisfied by all fully separable states) after unfolding and that the tunable parameter continues to produce strictly tighter bounds than existing multipartite witnesses.

    Authors: We acknowledge that the multipartite section lacked an explicit derivation. In the revised manuscript we have added a detailed derivation showing that the generalized matrix unfolding preserves the property that every fully separable state satisfies the resulting inequalities. The derivation uses the fact that a fully separable state factors into local Bloch vectors whose unfolded tensor satisfies the same norm bound as in the bipartite case. We have also included an analytic argument, supported by additional examples, demonstrating that the tunable parameter yields strictly tighter bounds than the corresponding non-parameterized witnesses for several classes of multipartite states. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation builds independently on generalized Bloch representation

full rationale

The paper constructs a parameterized extended correlation tensor from the established generalized Bloch representation under an arbitrary orthogonal basis, then applies generalized matrix unfolding for multipartite generalization. No quoted equations or steps reduce a derived separability criterion or bound to a fitted input, self-definition, or self-citation chain by construction. The central claim of tighter detection remains independent of the inputs, with examples provided to illustrate performance. This is the common case of a self-contained extension rather than a tautological renaming or fit.

Axiom & Free-Parameter Ledger

1 free parameters · 1 axioms · 0 invented entities

The framework rests on standard quantum state representation plus a new tunable parameter whose selection is not detailed in the abstract.

free parameters (1)
  • tunable parameter in extended correlation tensor
    Introduced to improve detection performance; its concrete value or optimization rule is not specified in the abstract.
axioms (1)
  • domain assumption Generalized Bloch representation holds under arbitrary orthogonal basis for constructing the correlation tensor
    Invoked to build the separability criteria from the representation.

pith-pipeline@v0.9.0 · 5623 in / 958 out tokens · 56870 ms · 2026-05-21T19:51:51.366917+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

56 extracted references · 56 canonical work pages

  1. [1]

    positive definite: ∥A∥tr ≥ 0, ∥A∥tr = 0 if and only if A is all-zero tensor

    work page

  2. [2]

    absolutely homogeneous: ∥aA∥tr = |a| ∥A∥tr

    work page

  3. [3]

    triangle inequality: ∥A + B∥tr ≤ ∥A∥ tr + ∥B∥tr

    work page

  4. [4]

    By Theorem 3, the trace norm is also unitarily invariant

    consistency: A ×k U(k) tr ≤ ∥A∥ tr U(k) tr. By Theorem 3, the trace norm is also unitarily invariant. B. Separability Criteria for N -partite Systems Let Hd1 , Hd2 , · · · , HdN be N Hilbert spaces with dimensions d1, d2, · · · , dN, respectively. Denote n G(1) i1 od2 1−1 i1=0 , n G(2) i2 od2 2−1 i2=0 , · · · , n G(N ) iN od2 N −1 iN =0 , (9) 12 as the or...

    work page

  5. [5]

    for any R = {r1, · · · , rp} ⊆ { l1 · · · lk} and C = {c1, · · · , cq} ⊆ { lk+1 · · · lN }, the reduced state ρ(r1···rpc1···cq) can be expressed as ρ(r1···rpc1···cq) = X i piρ(r1···rp) i ⊗ ρ(c1···cq) i , where ρ(r1···rp) i and ρ(c1···cq) i are states in the subsystems Hdr1 ⊗ · · · ⊗ Hdrp and Hdc1 ⊗ · · · ⊗ Hdcq , respectively; 2) T (r1···rp) = X i piT (r1...

    work page

  6. [6]

    where T(r1···rpc1···cq) (R,n;C,m) is the mixed (R, n; C, m)-mode matrix unfolding of the correlation tensor T (r1···rpc1···cq) of ρ(r1···rpc1···cq)

    for any n ∈ [p], m ∈ [q], T(r1···rpc1···cq) (R,n;C,m) = X i pivecn T (r1···rp) i vecm T (c1···cq) i T . where T(r1···rpc1···cq) (R,n;C,m) is the mixed (R, n; C, m)-mode matrix unfolding of the correlation tensor T (r1···rpc1···cq) of ρ(r1···rpc1···cq). Using the dimension reduction techniques, we construct the extended correlation tensor for N-partite sta...

    work page

  7. [7]

    Nielsen M. A. and Chuang I. L. Quantum Computation and Quantum Information . Cambridge University, 2010

    work page 2010

  8. [8]

    Quantum entanglement

    Horodecki R., Horodecki P., Horodecki M., and Horodecki K. Quantum entanglement. Rev. Mod. Phys, 81:865, 2009

    work page 2009

  9. [9]

    Quantum computation

    DiVincenzo D.P. Quantum computation. Science, 1995

    work page 1995

  10. [10]

    Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels

    Bennett C.H., Brassard G., Cr´ epeau C., Jozsa R., Peres A., and Wootters W.K. Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels. Physical Review Letters, 70, 1993

    work page 1993

  11. [11]

    Xu F.H., Ma X.F., Zhang Q., Lo H.K., and J.W. Pan. Secure quantum key distribution with realistic devices. Reviews of modern physics, 92:025002, 2020

    work page 2020

  12. [12]

    Quantum cryptography based on bell’s theorem

    Ekert A.K. Quantum cryptography based on bell’s theorem. Physical Review Letters, 67:661, 1991

    work page 1991

  13. [13]

    Universal quantum simulators

    Lioyd S. Universal quantum simulators. Science, 273:1073, 1996

    work page 1996

  14. [14]

    Separability criterion for density matrices

    Peres A. Separability criterion for density matrices. Physical Review Letters, 77:1413, 1996

    work page 1996

  15. [15]

    Separability of mixed states: necessary and sufficient conditions

    Horodecki M., Horodecki P., and Horodecki R. Separability of mixed states: necessary and sufficient conditions. Physical Letter A, 223, 1996

    work page 1996

  16. [16]

    Some properties of the computable cross-norm criterion for separability

    Rudolph O. Some properties of the computable cross-norm criterion for separability. Physical Review A, 67:032312, 2003

    work page 2003

  17. [17]

    Further results on the cross norm criterion for separability

    Rudolph O. Further results on the cross norm criterion for separability. Quantum Information Processing, 4, 2005

    work page 2005

  18. [18]

    and Wu L.A

    Chen K. and Wu L.A. A matrix realignment method for recognizing entanglement.Quantum Information and Computation, 3, 2002

    work page 2002

  19. [19]

    Covariance matrices and the separability problem

    G¨ uhne O., Hyllus P., Gittsovich O., and Eisert J. Covariance matrices and the separability problem. Physical Review Letters, 99:130504, 2007

    work page 2007

  20. [20]

    Separability criteria based on the bloch representation of density matrices

    de Vicente J.I. Separability criteria based on the bloch representation of density matrices. Quantum Information and Computation, 7, 2007

    work page 2007

  21. [21]

    Improved separability criteria based on bloch representation of density matrices

    Shen S.Q., Yu J., Li M., and Fei S.M. Improved separability criteria based on bloch representation of density matrices. 18 Scientific Reports, 6:28850, 2016

    work page 2016

  22. [22]

    Chang J.M., Cui M.Y., Zhang T.G., and S.M. Fei. Separability criteria based on heisenberg-weyl representation of density matrices. Chinese Physics B , 27:030302, 2018

    work page 2018

  23. [23]

    Detection of multipartite entanglement based on heisenberg-weyl representation of density matrices

    Zhao H., Yang Y, Jing N.H., Wang Z.X., and Fei S.M. Detection of multipartite entanglement based on heisenberg-weyl representation of density matrices. International Journal of Theoretical Physics , 61(5):136, 2022

    work page 2022

  24. [24]

    Family of multipartite separability criteria based on a correlation tensor.Physical Review A, 101:012341, 2020

    Sarbicki G., Scala G., and Chru´ sci´ nski D. Family of multipartite separability criteria based on a correlation tensor.Physical Review A, 101:012341, 2020

    work page 2020

  25. [25]

    Separability criteria based on the weyl operators

    Huang X.F., Zhang T.G., Zhao M.J., and Jing N.H. Separability criteria based on the weyl operators. Entropy, 24:1064, 2022

    work page 2022

  26. [26]

    Zhu X.N., Wang J., Bao G., Li M., Shen S.Q., and S.M. Fei. A family of bipartite separability criteria based on bloch representation of density matrices. Quantum Information Processing, 22:185, 2023

    work page 2023

  27. [27]

    A unifying separability criterion based on extended correlation tensor

    Huang X.F., Zhang T.G., and Jing N.H. A unifying separability criterion based on extended correlation tensor. Quantum Information Processing, 23:233, 2024

    work page 2024

  28. [28]

    A multilinear singular value decomposition

    De Lathauwer L., De Moor B., and Vandewalle J. A multilinear singular value decomposition. SIAM Journal on Matrix Analysis and Applications , 21, 2000

    work page 2000

  29. [29]

    Unextendible product bases and bound entanglement

    Bennett C.H., DiVncenzo D.P., Mor T., Shor P.W., Smolin J.A., and Terhal B.M. Unextendible product bases and bound entanglement. Physical Review Letters, 82:5385, 1999

    work page 1999

  30. [30]

    Quantum separability criteria for arbitrary-dimensional multipartite states

    Li M., Wang J., Fei S.M., and Li-Jost X.Q. Quantum separability criteria for arbitrary-dimensional multipartite states. Physical Review A, 89:022325, 2014

    work page 2014

  31. [31]

    Separability criterion and inseparable mixed states with positive partial transposition

    Pawel Horodecki. Separability criterion and inseparable mixed states with positive partial transposition. Physics Letters A, 232(5):333–339, 1997. doi: https://doi.org/10.1016/S0375-9601(97)00416-7

    work page doi:10.1016/s0375-9601(97)00416-7 1997

  32. [32]

    Separability and lower bounds of quantum entanglement based on realignment

    Sun J.X., Yao H.M., Fei S.M., and Fan Z.B. Separability and lower bounds of quantum entanglement based on realignment. Physical Review A, 111:012415, 2025

    work page 2025

  33. [33]

    Ledyard R. Tucker. Some mathematical notes on three-mode factor analysis. Psychometrika, 31:279–311, 1996

    work page 1996

  34. [34]

    Bader and Tamara G

    Brett W. Bader and Tamara G. Kolda. Algorithm 862: MATLAB tensor classes for fast algorithm prototyping. ACM Transactions on Mathematical Software, 32(4):635–653, 2006

    work page 2006

  35. [35]

    Tamara G. Kolda. Multilinear operators for higher-order decompositions. Technical Report SAND2006-2081, Sandia National Laboratories, 2006

    work page 2081

  36. [36]

    Bader and Tamara G

    Brett W. Bader and Tamara G. Kolda. Efficient matlab computations with sparse and factored tensors. SIAM Journal on Scientific Computing, 30(1):205–231, 2008. doi: 10.1137/060676489

    work page doi:10.1137/060676489 2008

  37. [37]

    I. V. Oseledets. Tensor-train decomposition. SIAM Journal on Scientific Computing , 33(5):2295–2317, 2011. doi: 10.1137/ 090752286

    work page 2011

  38. [38]

    Detection of genuine entanglement for multipartite quantum states.Quantum Information Processing, 21:315, 2022

    Zhao H., Liu Y.Q., Jing N.H., and Wang Z.X. Detection of genuine entanglement for multipartite quantum states.Quantum Information Processing, 21:315, 2022

    work page 2022

  39. [39]

    Improved tests of genuine entanglement for multiqudits

    Zhang X., Jing N.H., Zhao H., Liu M., and Ma H.T. Improved tests of genuine entanglement for multiqudits. Europhysics Letters, 143:38002, 2023

    work page 2023

  40. [40]

    Horodecki, P

    Ryszard Horodecki, Pawe l Horodecki, Micha l Horodecki, and Karol Horodecki. Quantum entanglement.Reviews of Modern Physics, 81:865–942, 2009. doi: 10.1103/RevModPhys.81.865. URL https://link.aps.org/doi/10.1103/RevModPhys. 81.865

    work page doi:10.1103/revmodphys.81.865 2009

  41. [41]

    Ali S. M. Hassan and Pramod S. Joag. Separability criterion for multipartite quantum states based on the bloch represen- tation of density matrices. Quantum Information and Computation , 8(8):773–790, 2008

    work page 2008

  42. [42]

    Correlation-tensor criteria for genuine multiqubit entangle- ment

    Laskowski W., Markiewicz M., Paterek T., and ˙Zukowski M. Correlation-tensor criteria for genuine multiqubit entangle- ment. Physical Review A, 84:062305, 2011

    work page 2011

  43. [43]

    Cornelio and A

    Marcio F. Cornelio and A. F. R. de Toledo Piza. Classification of tripartite entanglement with one qubit. Physical Review A, 73:032314, 2006. doi: 10.1103/PhysRevA.73.032314. URL https://link.aps.org/doi/10.1103/PhysRevA.73.032314

    work page doi:10.1103/physreva.73.032314 2006

  44. [44]

    Multiparticle covariance matrices and the impossibility of detecting graph-state entanglement with two-particle correlations

    Oleg Gittsovich, Philipp Hyllus, and Otfried G¨ uhne. Multiparticle covariance matrices and the impossibility of detecting graph-state entanglement with two-particle correlations. Physical Review A, 82:032306, 2010. doi: 10.1103/PhysRevA.82. 032306. URL https://link.aps.org/doi/10.1103/PhysRevA.82.032306

    work page doi:10.1103/physreva.82 2010

  45. [45]

    Realignment criteria for recognizing multipartite entanglement of quantum states

    Yan-Hua Zhang, Yuan-Yuan Lu, Guang-Bin Wang, and Shu-Qian Shen. Realignment criteria for recognizing multipartite entanglement of quantum states. Quantum Information Processing, 16(4):106, 2017

    work page 2017

  46. [46]

    Optimization of realignment criteria and its applications for multipartite quantum states

    Shu-Qian Shen, Lou Chen, An-Wen Hu, and Ming Li. Optimization of realignment criteria and its applications for multipartite quantum states. Quantum Information Processing, 21(4):135, 2022

    work page 2022

  47. [47]

    Heisenberg-weyl observables: Bloch vectors in phase space

    Asadian A., Erker P., and Huber M. Heisenberg-weyl observables: Bloch vectors in phase space. Physical Review A , 94: 010301, 2016. 19 Appendix A: Several Orthogonal Basis In this section, several traceless orthogonal bases are presented, including Pauli operators, Weyl operators, and Heisenberg-Weyl operators. a. Pauli operators Four 2-dimensional Pauli ...

    work page 2016

  48. [48]

    Proof of Theorem 1 Proof. Since ρ(AB) is separable, it can be expressed as a convex combination of product states, ρ(AB) = X i piρ(A) i ⊗ ρ(B) i , (B1) where 0 ≤ pi ≤ 1,P i pi = 1, ρ(A) i and ρ(B) i are pure states in HdA and HdB, respectively. By the generalized Bloch representation of ρ(A) i , ρ(B) i in Eq (1), there exist vectors T (A) i ∈ Cd2 A−1, T (...

    work page

  49. [49]

    Proof of Theorem 2 Proof. On one hand, by the k-mode matrix unfolding of tensors and the vectorization of matrices, the n-mode vectorization vecn (A) of A has a size of dr1 · · · drk, and the entry air1 ···irk in the column vector vec n (A) is at the position with row index i = nY k′′=1 drk′′ ! kX k′=n+1 irk′ − 1 kY k′′=k′+1 drk′′ ! + nX k′=1 irk′ − 1 nY ...

    work page

  50. [50]

    Let p ≤ n and Idrs = δirs lrs , s ∈ [k]

    Proof of Theorem 3 Proof. Let p ≤ n and Idrs = δirs lrs , s ∈ [k]. Denote A(R,n;C,m) = (ˆalj) , A ×rp U(rp) = P = pi1···i′rp ···iN ∈ Cd1···d′ rp ···dN , Idrn+1 ⊗ · · · ⊗ Idrp−1 ⊗ U(rp) ⊗ Idrp+1 ⊗ · · · ⊗ Idrn = (ˆuil) , 22 and P(R,n;C,m) = (ˆpij) as the mixed ( R, n; C, m)-mode matrix unfolding of P, where ˆalj = ai1···iN , ˆpij = pi1···i′rp ···iN , ˆuil ...

    work page

  51. [51]

    The state ρ ∈ H d1 ⊗ · · · ⊗ H dN of the multipartite system is rewritten as ρ(1···N )

    Proof of Lemma 2 Proof. The state ρ ∈ H d1 ⊗ · · · ⊗ H dN of the multipartite system is rewritten as ρ(1···N ). By the generalized Bloch representation in Eq. (11) and the condition in Eq. (10), we obtain that Tr ρ(1···N ) 2 =Tr ρ(1···N ) † ρ(1···N ) = 1 d2 1 · · · d2 N d1 · · · dN + κ1d2 · · · dN T (1) 2 F + · · · + κN d1 · · · dN −1 T (N ) 2 F +κ1κ2d3 ·...

    work page

  52. [52]

    Suppose that {l1, · · · , lk} \ {r1, · · · , rp} = {rp+1, · · · , rk} and {lk+1, · · · , lN } \ {c1, · · · , cq} = {cq+1, · · · , cN −k}

    Proof of Lemma 3 Proof. Suppose that {l1, · · · , lk} \ {r1, · · · , rp} = {rp+1, · · · , rk} and {lk+1, · · · , lN } \ {c1, · · · , cq} = {cq+1, · · · , cN −k}. Then we have ρ(r1···rpc1···cq) =Trrp+1···rkcq+1···cN −k (ρ) =Trrp+1···rkcq+1···cN −k X i piρ(l1···lk) i ⊗ ρ(lk+1···lN ) i ! = X i piTrrp+1···rk ρ(l1···lk) i ⊗ Trcq+1···cN −k ρ(lk+1···lN ) i = X i...

    work page

  53. [53]

    Proof of Theorem 4 Proof. Since ρ is biseparable under the bipartition l1 · · · lk|lk+1 · · · lN, it follows that ρ can be expressed as a convex combination of product sates, ρ = X i piρ(l1···lk) i ⊗ ρ(lk+1···lN ) i , (B15) where 0 ≤ pi ≤ 1,P i pi = 1, ρ(l1···lk) i and ρ(lk+1···lN ) i are pure states in Hdl1 ⊗ · · · ⊗ H dlk and Hdlk+1 ⊗ · · · ⊗ H dlN , re...

    work page

  54. [54]

    Suppose that ρ is biseparable

    Proof of Theorem 5 Proof. Suppose that ρ is biseparable. Then it can be expressed as ρ = N −1X k=1 X {l1,··· ,lN }=[N ] l1<···<lk lk+1<···<lN l1<lk+1 pl1···lN X i p(l1···lk|lk+1···lN ) i ρ(l1···lk) i ⊗ ρ(lk+1···lN ) i where 0 ≤ p(l1···lk|lk+1···lN ) i ≤ 1, N −1X k=1 X {l1,··· ,lN }=[N ] l1<···<lk lk+1<···<lN l1<lk+1 pl1···lN = 1, X i p(l1···lk|lk+1···lN )...

    work page

  55. [55]

    Proof of Lemma 4 Proof. The reduced state ρ(r1···rk) can be computed by applying the partial trace to ρ, ρ(r1···rk) =Tr[N ]\{r1,··· ,rk} (ρ) =Tr[N ]\{r1,··· ,rk} X i piρ(1) i ⊗ · · · ⊗ ρ(N ) i ! = X i piρ(r1) i ⊗ · · · ⊗ ρ(rk) i . (B16) By the generalized Bloch representation in Eq. (1), ρ(rl) i can be expanded as ρ(rl) i = 1 drl  I(rl) drl + d2 rl −1 ...

    work page

  56. [56]

    Proof of Theorem 6 Proof. Since ρ is fully separable, ρ is biseparable under any bipartition r1 · · · rk|c1 · · · cN −k, that is, ρ = X i piρ(1) i ⊗ · · · ⊗ ρ(N ) i = X i piρ(r1···rk) i ⊗ ρ(c1···cN −k) i , where 0 ≤ pi ≤ 1,P i pi = 1, ρ(l) i is the pure state for the subsystem Hdl, l ∈ [N], ρ(r1···rk) i and ρ(c1···cN −k) i are pure states for the subsyste...

    work page