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

arXiv:quant-ph/0504160 · Quantum Information and Computation

On independent permutation separability criteria

Lieven Clarisse, Paweł Wocjan

Published May 1, 2006• 24 citations
arXivHTMLPDF

Abstract

Recently, P.\ Wocjan and M.\ Horodecki [Open Syst.\ Inf.\ Dyn.\ 12, 331 (2005)] gave a characterization of combinatorially independent permutation separability criteria. Combinatorial independence is a necessary condition for permutations to yield truly independent criteria meaning that no criterion is strictly stronger that any other. In this paper we observe that some of these criteria are still dependent and analyze why these dependencies occur. To remove them we introduce an improved necessary condition and give a complete classification of the remaining permutations. We conjecture that the remaining class of criteria only contains truly independent permutation separability criteria. Our conjecture is based on the proof that for two, three and four parties all these criteria are truly independent and on numerical verification of their independence for up to 8 parties. It was commonly believed that for three parties there were 9 independent criteria, here we prove that there are exactly 6 independent criteria for three parties and 22 for four parties.

DOI
10.26421/qic6.3-4

Related papers

Characterization of Combinatorially Independent Permutation Separability Criteria

Paweł Wocjan, Michał Horodecki

The so-called permutation separability criteria are simple operational conditions that are necessary for separability of mixed states of multipartite systems: (1) permute the indices of the density matrix and (2) check if the trace norm of at least one of the resulting operators is greater than one. If it is greater than one then the state is necessarily entangled. A shortcoming of the permutation separability criteria is that many permutations give rise to equivalent separability criteria. Therefore, we introduce a necessary condition for two permutations to yield independent criteria called combinatorial independence. This condition basically means that the map corresponding to one permutation cannot be obtained by concatenating the map corresponding to the second permutation with a norm-preserving map. We characterize completely combinatorially independent criteria, and determine simple permutations that represent all independent criteria. The representatives can be visualized by means of a simple graphical notation. They are composed of three basic operations: partial transpose, and two types of so-called reshufflings. In particular, for a four-partite system all criteria except one are composed of partial transpose and only one type of reshuffling; the exceptional one requires the second type of reshuffling. Furthermore, we show how to obtain efficiently a simple representative for every permutation. This method allows to check easily if two permutations are combinatorially equivalent or not.

arXiv:quant-ph/0503129•Open Systems & Information Dynamics•Nov 11, 2005•50 citations

A combinatorial criterion for k-separability of multipartite Dicke states

Zhihua Chen, Zhihao Ma, Ting Gao +1 more

We derive a combinatorial criterion for detecting k-separability of N-partite Dicke states. The criterion is efficiently computable and implementable without full state tomography. We give examples in which the criterion succeeds, where known criteria fail.

arXiv:1511.00103•Oct 31, 2015•0 citations

Separability of Mixed Quantum States: Linear Contractions and Permutation Criteria

Michał Horodecki, Paweł Horodecki, Ryszard Horodecki

Recently, a powerful separability criterion was introduced by O. Rudolf in [5] and by K. Chen et al. in [6] — basing on realignment of elements of density matrix. Composing the main idea behind the above criterion and the necessary and sufficient condition in terms of positive maps, we provide a characterization of separable states by means of linear contractions. The latter need not be positive maps. We extend the idea to multipartite systems, and find that, somewhat suprisingly, partial realigment (unlike partial transposition) can detect genuinely tri-parite entanglement. We generalize it by introducing a family of so called permutation separability criteria for multipartite states. Namely, any permutation of indices of density matrix written in product basis leads to a separability criterion. Partial transpose and realignment criterion are special cases of permutation criteria.

Open Systems & Information Dynamics•Mar 1, 2006•141 citations

Balanced Antipodal Qutrit Pairs: Lorentzian Factorization, Qubit Equivalence, and Equality Classification

Vasily Psykovsky

This preprint establishes a Lorentzian factorization theorem for balanced antipodal quantum-state pairs in three-dimensional Hilbert space, with consequences for qubit–qutrit equivalence, prepare-and-measure correlations, and quantum dimension witnesses. We define a pair of qutrit states as balanced when tr(ρ₊ρ₋)² ≤ (1 − tr ρ₊²)(1 − tr ρ₋²). This class includes orthogonal pure-state pairs and pairs with orthogonal supports. Main contributions: Universal factorization theorem. We prove that every prepare-and-measure correlation table generated by balanced qutrit pairs and admissible binary measurements, without shared randomness, satisfies the Euclidean factorization bound γ₂(T) ≤ 1, regardless of the number of pairs or measurement queries. Exact qubit reproducibility. Combining the factorization theorem with an earlier exact qubit criterion, we establish that balanced qutrit configurations are qubit-reproducible whenever there are at most three antipodal pairs or at most three binary queries. In particular, three orthogonal pure-state pairs cannot distinguish a qutrit from a qubit in this setting. Lorentzian geometric construction. The proof uses the quadratic form Q(X) = 2 tr(X²) − (tr X)² on Hermitian 3 × 3 matrices, with signature (8,1). Its dual representation and the spectral inequality −e₂(A) ≤ 1 yield an explicit Euclidean Gram factorization. Unconditional equality classification. We show that every equality configuration of three orthogonal pure-state pairs belongs, up to unitary equivalence, to an embedded-qubit configuration or one of two previously constructed genuinely three-dimensional families: the spin-1 family and the common-vector family. This removes an additional hypothesis required in the preceding note. Reduction of the remaining open problem. We show that any possible three-pair separation can be reduced to configurations containing pure states paired with states of rank at most two, with at least one overlapping pair. We also introduce a semidefinite-programmable certificate whose conjectured universal validity is supported by numerical experiments but remains unproved. The general conjecture that three arbitrary antipodal qutrit state pairs never separate a qutrit from a qubit remains open. The proved results are independent of the numerical investigations. The accompanying reproducibility archive contains preregistered B4h experiments, symbolic and numerical verification scripts, computational results, and SHA-256 manifests. This is the fifth preprint in a research series on qubit–qutrit equivalence, separation, and the geometry of quantum correlations. Status: Research preprint, version 1 (13 November 2026); not peer reviewed.

•Nov 13, 2026•2 citations

Criteria For KKK-Separability Of Multipartite Quantum State

Zhihao Ma, Zhihua Chen, Jing‐Ling Chen

We derive criteria for $k$-separability of multipartite Quantum state

arXiv:1103.4889•Mar 25, 2011•0 citations

Criterion for k-separability in mixed multipartite states

Andreas Gabriel, Beatrix C. Hiesmayr, Marcus Huber

Using a recently introduced framework, we derive criteria for quantum k-separability, which are easily computed. In the case k=2, our criteria are equally strong to the best methods known so far, while in all other cases there are currently no comparable criteria known. We also show how the criteria can be implemented experimentally.

arXiv:1002.2953•Quantum Information and Computation•Sep 1, 2010•93 citations
Recently, P.\ Wocjan and M.\ Horodecki [Open Syst.\ Inf.\ Dyn.\ 12, 331 (2005)] gave a characterization of combinatorially independent permutation separability criteria. Combinatorial independence is a necessary condition for permutations to yield truly independent criteria meaning that no criterion is strictly stronger that any other. In this paper we observe that some of these criteria are still dependent and analyze why these dependencies occur. To remove them we introduce an improved necessary condition and give a complete classification of the remaining permutations. We conjecture that the remaining class of criteria only contains truly independent permutation separability criteria. Our conjecture is based on the proof that for two, three and four parties all these criteria are truly independent and on numerical verification of their independence for up to 8 parties. It was commonly believed that for three parties there were 9 independent criteria, here we prove that there are exactly 6 independent criteria for three parties and 22 for four parties.
The so-called permutation separability criteria are simple operational conditions that are necessary for separability of mixed states of multipartite systems: (1) permute the indices of the density matrix and (2) check if the trace norm of at least one of the resulting operators is greater than one. If it is greater than one then the state is necessarily entangled. A shortcoming of the permutation separability criteria is that many permutations give rise to equivalent separability criteria. Therefore, we introduce a necessary condition for two permutations to yield independent criteria called combinatorial independence. This condition basically means that the map corresponding to one permutation cannot be obtained by concatenating the map corresponding to the second permutation with a norm-preserving map. We characterize completely combinatorially independent criteria, and determine simple permutations that represent all independent criteria. The representatives can be visualized by means of a simple graphical notation. They are composed of three basic operations: partial transpose, and two types of so-called reshufflings. In particular, for a four-partite system all criteria except one are composed of partial transpose and only one type of reshuffling; the exceptional one requires the second type of reshuffling. Furthermore, we show how to obtain efficiently a simple representative for every permutation. This method allows to check easily if two permutations are combinatorially equivalent or not.
Recently, a powerful separability criterion was introduced by O. Rudolf in [5] and by K. Chen et al. in [6] — basing on realignment of elements of density matrix. Composing the main idea behind the above criterion and the necessary and sufficient condition in terms of positive maps, we provide a characterization of separable states by means of linear contractions. The latter need not be positive maps. We extend the idea to multipartite systems, and find that, somewhat suprisingly, partial realigment (unlike partial transposition) can detect genuinely tri-parite entanglement. We generalize it by introducing a family of so called permutation separability criteria for multipartite states. Namely, any permutation of indices of density matrix written in product basis leads to a separability criterion. Partial transpose and realignment criterion are special cases of permutation criteria.
This preprint establishes a Lorentzian factorization theorem for balanced antipodal quantum-state pairs in three-dimensional Hilbert space, with consequences for qubit–qutrit equivalence, prepare-and-measure correlations, and quantum dimension witnesses. We define a pair of qutrit states as balanced when tr(ρ₊ρ₋)² ≤ (1 − tr ρ₊²)(1 − tr ρ₋²). This class includes orthogonal pure-state pairs and pairs with orthogonal supports. Main contributions: Universal factorization theorem. We prove that every prepare-and-measure correlation table generated by balanced qutrit pairs and admissible binary measurements, without shared randomness, satisfies the Euclidean factorization bound γ₂(T) ≤ 1, regardless of the number of pairs or measurement queries. Exact qubit reproducibility. Combining the factorization theorem with an earlier exact qubit criterion, we establish that balanced qutrit configurations are qubit-reproducible whenever there are at most three antipodal pairs or at most three binary queries. In particular, three orthogonal pure-state pairs cannot distinguish a qutrit from a qubit in this setting. Lorentzian geometric construction. The proof uses the quadratic form Q(X) = 2 tr(X²) − (tr X)² on Hermitian 3 × 3 matrices, with signature (8,1). Its dual representation and the spectral inequality −e₂(A) ≤ 1 yield an explicit Euclidean Gram factorization. Unconditional equality classification. We show that every equality configuration of three orthogonal pure-state pairs belongs, up to unitary equivalence, to an embedded-qubit configuration or one of two previously constructed genuinely three-dimensional families: the spin-1 family and the common-vector family. This removes an additional hypothesis required in the preceding note. Reduction of the remaining open problem. We show that any possible three-pair separation can be reduced to configurations containing pure states paired with states of rank at most two, with at least one overlapping pair. We also introduce a semidefinite-programmable certificate whose conjectured universal validity is supported by numerical experiments but remains unproved. The general conjecture that three arbitrary antipodal qutrit state pairs never separate a qutrit from a qubit remains open. The proved results are independent of the numerical investigations. The accompanying reproducibility archive contains preregistered B4h experiments, symbolic and numerical verification scripts, computational results, and SHA-256 manifests. This is the fifth preprint in a research series on qubit–qutrit equivalence, separation, and the geometry of quantum correlations. Status: Research preprint, version 1 (13 November 2026); not peer reviewed.
We derive criteria for kkk-separability of multipartite Quantum state