# An algorithm based on negative probabilities for a separability criterion

An algorithm based on negative probabilities for a separability criterion Here, we demonstrate that entangled states can be written as separable states [ $$\rho _{1\ldots N}=\sum _{i}p_{i}\rho _{i}^{(1)}\otimes \cdots \otimes \rho _{i}^{(N)}$$ ρ 1 … N = ∑ i p i ρ i ( 1 ) ⊗ ⋯ ⊗ ρ i ( N ) , 1 to N refering to the parts and $$p_{i}$$ p i to the nonnegative probabilities], although for some of the coefficients, $$p_{i}$$ p i assume negative values, while others are larger than 1 such to keep their sum equal to 1. We recognize this feature as a signature of non-separability or pseudoseparability. We systematize that kind of decomposition through an algorithm for the explicit separation of density matrices, and we apply it to illustrate the separation of some particular bipartite and tripartite states, including a multipartite $${\textstyle \bigotimes \nolimits ^{N}} 2$$ ⨂ N 2 one-parameter Werner-like state. We also work out an arbitrary bipartite $$2\times 2$$ 2 × 2 state and show that in the particular case where this state reduces to an X-type density matrix, our algorithm leads to the separability conditions on the parameters, confirmed by the Peres-Horodecki partial transposition recipe. We finally propose a measure for quantifying the degree of entanglement based on these peculiar negative (and greater than one) probabilities. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

# An algorithm based on negative probabilities for a separability criterion

, Volume 14 (9) – Jul 8, 2015
16 pages

/lp/springer_journal/an-algorithm-based-on-negative-probabilities-for-a-separability-AzLh88091r
Publisher
Springer US
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-015-1053-6
Publisher site
See Article on Publisher Site

### Abstract

Here, we demonstrate that entangled states can be written as separable states [ $$\rho _{1\ldots N}=\sum _{i}p_{i}\rho _{i}^{(1)}\otimes \cdots \otimes \rho _{i}^{(N)}$$ ρ 1 … N = ∑ i p i ρ i ( 1 ) ⊗ ⋯ ⊗ ρ i ( N ) , 1 to N refering to the parts and $$p_{i}$$ p i to the nonnegative probabilities], although for some of the coefficients, $$p_{i}$$ p i assume negative values, while others are larger than 1 such to keep their sum equal to 1. We recognize this feature as a signature of non-separability or pseudoseparability. We systematize that kind of decomposition through an algorithm for the explicit separation of density matrices, and we apply it to illustrate the separation of some particular bipartite and tripartite states, including a multipartite $${\textstyle \bigotimes \nolimits ^{N}} 2$$ ⨂ N 2 one-parameter Werner-like state. We also work out an arbitrary bipartite $$2\times 2$$ 2 × 2 state and show that in the particular case where this state reduces to an X-type density matrix, our algorithm leads to the separability conditions on the parameters, confirmed by the Peres-Horodecki partial transposition recipe. We finally propose a measure for quantifying the degree of entanglement based on these peculiar negative (and greater than one) probabilities.

### Journal

Quantum Information ProcessingSpringer Journals

Published: Jul 8, 2015

## You’re reading a free preview. Subscribe to read the entire article.

### DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month ### Explore the DeepDyve Library ### Search Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly ### Organize Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place. ### Access Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals. ### Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. DeepDyve ### Freelancer DeepDyve ### Pro Price FREE$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations

Abstract access only

18 million full-text articles

Print

20 pages / month

PDF Discount

20% off