The nonnegativity of the determinant of the partial transpose of a two-qubit (4 x 4) density matrix is both a necessary and sufficient condition for its separability. While the determinant is restricted to the interval [0,1/256], the determinant of the partial transpose can range over [-1/16,1/256], with negative values corresponding to entangled states. We report here the exact values of the first nine moments of the probability distribution of the partial transpose over this interval, with respect to the Hilbert-Schmidt (metric volume element) measure on the nine-dimensional convex set of real two-qubit density matrices. Rational functions C_{2 j}(m), yielding the coefficients of the 2j-th power of even polynomials occurring at intermediate steps in our derivation of the m-th moment, emerge. These functions possess poles at finite series of consecutive half-integers (m=-3/2,-1/2,...,(2j-1)/2), and certain (trivial) roots at finite series of consecutive natural numbers (m=0, 1,...). Additionally, the (nontrivial) dominant roots of C_{2 j}(m) approach the same half-integer values (m = (2 j-1)/2, (2 j-3)/2,...), as j increases. The first two moments (mean and variance) found--when employed in the one-sided Chebyshev inequality--give an upper bound of 30397/34749 = 0.874759 on the separability probability of real two-qubit density matrices. We are able to report general formulas for the m-th moment of the Hilbert-Schmidt probability distribution of the density matrix determinant over [0,1/256], in the real, complex and quaternionic two-qubit cases.
The nonnegativity of the determinant of the partial transpose of a two-qubit (4 x 4) density matrix is both a necessary and sufficient condition for its separability. While the determinant is restricted to the interval [0,1/256], the determinant of the partial transpose can range over [-1/16,1/256], with negative values corresponding to entangled states. We report here the exact values of the first nine moments of the probability distribution of the partial transpose over this interval, with respect to the Hilbert-Schmidt (metric volume element) measure on the nine-dimensional convex set of real two-qubit density matrices. Rational functions C_{2 j}(m), yielding the coefficients of the 2j-th power of even polynomials occurring at intermediate steps in our derivation of the m-th moment, emerge. These functions possess poles at finite series of consecutive half-integers (m=-3/2,-1/2,...,(2j-1)/2), and certain (trivial) roots at finite series of consecutive natural numbers (m=0, 1,...). Additionally, the (nontrivial) dominant roots of C_{2 j}(m) approach the same half-integer values (m = (2 j-1)/2, (2 j-3)/2,...), as j increases. The first two moments (mean and variance) found--when employed in the one-sided Chebyshev inequality--give an upper bound of 30397/34749 = 0.874759 on the separability probability of real two-qubit density matrices. We are able to report general formulas for the m-th moment of the Hilbert-Schmidt probability distribution of the density matrix determinant over [0,1/256], in the real, complex and quaternionic two-qubit cases.
To begin, we find certain formulas Q(k,α)=G1k(α)G2k(α) , for k=-1,0,1,…,9 . These yield that part of the total separability probability, P(k,α) , for generalized (real, complex, quaternionic , etc.) two-qubit states endowed with random induced measure, for which the determinantal inequality ρPT>ρ holds. Here ρ denotes a 4×4 density matrix, obtained by tracing over the pure states in 4×(4+k) -dimensions, and ρPT denotes its partial transpose. Further, α is a Dyson-index-like parameter with α=1 for the standard (15-dimensional) convex set of (complex) two-qubit states. For k=0 , we obtain the previously reported Hilbert-Schmidt formulas, with Q(0,1/2)=29/128 (the real case), Q(0,1)=4/33 (the standard complex case), and Q(0,2)=13/323 (the quaternionic case), the three simply equalling P(0,α)/2 . The factors G2k(α) are sums of polynomial-weighted generalized hypergeometric functions pFp-1 , p≥7 , all with argument z=27/64=(3/4)3 . We find number-theoretic-based formulas for the upper ( uik ) and lower ( bik ) parameter sets of these functions and, then, equivalently express G2k(α) in terms of first-order difference equations. Applications of Zeilberger’s algorithm yield “concise” forms of Q(-1,α) , Q(1,α) , and Q(3,α) , parallel to the one obtained previously (Slater 2013) for P(0,α)=2Q(0,α) . For nonnegative half-integer and integer values of α , Q(k,α
A complete description of the multitudinous ways in which quantum particles can be entangled requires the use of high-dimensional abstract mathematical spaces. We report here a particularly interesting feature of the nine-dimensional convex set-endowed with Hilbert-Schmidt (Euclidean/flat) measure-composed of two-rebit (4 x 4) density matrices (rho). To each rho is assigned the product of its (nonnegative) determinant |rho| and the determinant of its partial transpose |rho^{PT}| -negative values of which, by the results of Peres and Horodecki, signify the entanglement of rho. Integrating this product, |rho| |rho^{PT}| =|rho rho^{PT}|, over the nine-dimensional space, using the indicated (HS) measure, we obtain the result zero. The two determinants, thus, form a pair of multivariate orthogonal polynomials with respect to HS measure. It is hypothesized that the analogous two determinants for the standard fifteen-dimensional convex set of two-qubit density matrices are similarly orthogonal. However, orthogonality does not hold, we find, if the symmetry of the nine-dimensional two-rebit scenario is broken slightly, nor with the use of non-flat measures, such as the prominent Bures (minimal monotone) measure-nor in the full HS extension to the 15-dimensional convex set of two-qubit density matrices. We discuss relations-involving the HS moments of |ρ^{PT}|-to the long-standing problem of determining the probability that a generic pair of rebits/qubits is separable.
We seek to gain insight into the nature of the determinantal moments 〈|ρ PT | n |ρ| k 〉 Bures of generic (nine-dimensional) two-rebit and (fifteen-dimensional) two-qubit systems (ρ), PT denoting partial transpose. Such information—as it has proved to be in the Hilbert–Schmidt counterpart—should be useful, employing probability-distribution reconstruction (inverse) procedures, in obtaining Bures 2 × 2 separability probabilities. The (regularizing) strategy we first adopt is to plot the ratio of numerically-generated (Ginibre ensemble) estimates of the Bures moments to the corresponding (apparently) exactly-known Hilbert–Schmidt moments (Slater and Dunkl 2012 J. Phys. A: Math. Theor. 45 095305). Then, through a combination of symbolic and numerical computations, we obtain strong evidence as to the exact values (and underlying patterns) of certain Bures determinantal moments. In particular, the first moment (average) of |ρ PT | (where ) for the two-qubit systems is, remarkably, . The analogous value for the two-rebit systems is . While in the Hilbert–Schmidt case is the ratio of 3 n -degree polynomials in k , it appears to be the ratio of 5 n -degree polynomials in k in the Bures case.
Employing Hilbert-Schmidt measure, we explicitly compute and analyze a number of determinantal product (bivariate) moments |rho|^k |rho^{PT}|^n, k,n=0,1,2,3,..., PT denoting partial transpose, for both generic (9-dimensional) two-rebit (alpha = 1/2) and generic (15-dimensional) two-qubit (alpha=1) density matrices rho. The results are, then, incorporated by Dunkl into a general formula (Appendix D6), parameterized by k, n and alpha, with the case alpha=2, presumptively corresponding to generic (27-dimensional) quaternionic systems. Holding the Dyson-index-like parameter alpha fixed, the induced univariate moments (|rho| |rho^{PT}|)^n and |rho^{PT}|^n are inputted into a Legendre-polynomial-based (least-squares) probability-distribution reconstruction algorithm of Provost (Mathematica J., 9, 727 (2005)), yielding alpha-specific separability probability estimates. Since, as the number of inputted moments grows, estimates based on |rho| |rho^{PT}| strongly decrease, while ones employing |rho^{PT}| strongly increase (and converge faster), the gaps between upper and lower estimates diminish, yielding sharper and sharper bounds. Remarkably, for alpha = 2, with the use of 2,325 moments, a separability-probability lower-bound 0.999999987 as large as 26/323 = 0.0804954 is found. For alpha=1, based on 2,415 moments, a lower bound results that is 0.999997066 times as large as 8/33 = 0.242424, a (simpler still) fractional value that had previously been conjectured (J. Phys. A, 40, 14279 (2007)). Furthermore, for alpha = 1/2, employing 3,310 moments, the lower bound is 0.999955 times as large as 29/64 = 0.453125, a rational value previously considered (J. Phys. A, 43, 195302 (2010)).
We seek to derive the probability—expressed in terms of the Hilbert–Schmidt (Euclidean or flat) metric—that a generic (nine-dimensional) real two-qubit system is separable, by implementing the well-known Peres–Horodecki test on the partial transposes (PTs) of the associated 4 × 4 density matrices (ρ). But the full implementation of the test—requiring that the determinant of the PT be nonnegative for separability to hold—appears to be, at least presently, computationally intractable. So, we have previously implemented—using the auxiliary concept of a diagonal-entry-parameterized separability function (DESF)—the weaker implied test of nonnegativity of the six 2 × 2 principal minors of the PT. This yielded an exact upper bound on the separability probability of . Here, we piece together (reflection-symmetric) results obtained by requiring that each of the four 3 × 3 principal minors of the PT, in turn, be nonnegative, giving an improved/reduced upper bound of . Then, we conclude that a still further improved upper bound of can be found by similarly piecing together the (reflection-symmetric) results of enforcing the simultaneous nonnegativity of certain pairs of the four 3 × 3 principal minors. Numerical simulations—as opposed to exact symbolic calculations—indicate, on the other hand, that the true probability is certainly less than . Our analyses lead us to suggest a possible form for the true DESF, yielding a separability probability of , while the absolute separability probability of provides the best exact lower bound established so far. In deriving our improved upper bounds, we rely repeatedly upon the use of certain integrals over cubes that arise. Finally, we apply an independence assumption to a pair of DESFs that comes close to reproducing our numerical estimate of the true separability function.
We seek to derive the probability--expressed in terms of the Hilbert-Schmidt (Euclidean or flat) metric--that a generic (nine-dimensional) real two-qubit system is separable, by implementing the well-known Peres-Horodecki test on the partial transposes (PTs) of the associated 4 x 4 density matrices. But the full implementation of the test--requiring that the determinant of the PT be nonnegative for separability to hold--appears to be, at least presently, computationally intractable. So, we have previously implemented--using the auxiliary concept of a diagonal-entry-parameterized separability function (DESF)--the weaker implied test of nonnegativity of the six 2 x 2 principal minors of the PT. This yielded an exact upper bound on the separability probability of 1024/(135 Pi^2) = 0.76854. Here, we extend this line of work by requiring that the four 3 x 3 principal minors of the PT be nonnegative, giving us an improved/reduced upper bound of 22/35 = 0.628571. Numerical simulations--as opposed to exact symbolic calculations--indicate, on the other hand, that the true probability is certainly less than 1/2. Our combined analyses lead us to suggest a possible form for the true DESF, yielding a separability probability of 29/64 = 0.453125, while the best exact lower bound established so far is (6928-2205 Pi)/2^(9/2) = 0.0348338.