An improved exact upper bound of 22/35 on the Hilbert-Schmidt separability probability of real two-qubit systems
Paul B. Slater

TL;DR
This paper improves the upper bound on the probability that a real two-qubit quantum state is separable using Hilbert-Schmidt metric, by analyzing principal minors of the partial transpose of density matrices.
Contribution
It introduces a tighter upper bound on the separability probability by considering larger principal minors of the partial transpose, advancing previous bounds with numerical and analytical methods.
Findings
New upper bound of 22/35 on separability probability
Numerical evidence suggests probability is less than 1/2
Proposed a possible form for the separability function
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Mathematical Approximation and Integration · Markov Chains and Monte Carlo Methods
