Convex set of quantum states with positive partial transpose analysed by hit and run algorithm

DOI10.1088/1751-8121/AA70F5zbMATH Open1370.81037arXiv1611.01194OpenAlexW3100899741WikidataQ112266777 ScholiaQ112266777MaRDI QIDQ5347997FDOQ5347997

Karol Życzkowski, Benoit Collins, Tomasz Szarek, Konrad Szymański

Publication date: 11 August 2017

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Abstract: The convex set of quantum states of a composite $KimesK$ system with positive partial transpose is analysed. A version of the hit and run algorithm is used to generate a sequence of random points covering this set uniformly and an estimation for the convergence speed of the algorithm is derived. For $Kge3$ this algorithm works faster than sampling over the entire set of states and verifying whether the partial transpose is positive. The level density of the PPT states is shown to differ from the Marchenko-Pastur distribution, supported in [0,4] and corresponding asymptotically to the entire set of quantum states. Based on the shifted semi--circle law, describing asymptotic level density of partially transposed states, and on the level density for the Gaussian unitary ensemble with constraints for the spectrum we find an explicit form of the probability distribution supported in [0,3], which describes well the level density obtained numerically for PPT states.

Full work available at URL: https://arxiv.org/abs/1611.01194

Recommendations

• On the structure of the body of states with positive partial transpose
• The absolute positive partial transpose property for random induced states
• Global geometric difference between separable and positive partial transpose states
• On PPT States in C ^K ⊗ C ^M </i
• Properties and construction of extreme bipartite states having positive partial transpose

zbMATH Keywords

spectral densitypositive partial transposeGaussian unitary ensembleseparable statesMarchenko-Pastur distribution

Mathematics Subject Classification ID

Approximation algorithms (68W25) Quantum coherence, entanglement, quantum correlations (81P40) Quantum state spaces, operational and probabilistic concepts (81P16)

Cites Work

• Title not available (Why is that?)
• DISTRIBUTION OF EIGENVALUES FOR SOME SETS OF RANDOM MATRICES
• Monte Carlo sampling methods using Markov chains and their applications
• Quantum entanglement
• Separability of mixed states: necessary and sufficient conditions.
• Hit-and-Run from a Corner
• Induced measures in the space of mixed quantum states
• Formulas for rational-valued separability probabilities of random induced generalized two-qubit states
• Geometry of sets of quantum maps: A generic positive map acting on a high-dimensional system is not completely positive
• Title not available (Why is that?)
• On the structure of the body of states with positive partial transpose
• Generating random density matrices
• Geometry of Quantum States
• Partial transposition of random states and non-centered semicircular distributions
• The geometry of logconcave functions and sampling algorithms
• The absolute positive partial transpose property for random induced states
• Positive reduction from spectra
• Classical complexity and quantum entanglement
• Title not available (Why is that?)
• Statistical properties of random density matrices
• Geometry of quantum systems: density states and entanglement
• The accessibility of convex bodies and derandomization of the hit and run algorithm
• Combinatorics

Cited In (1)

• Entanglement in bipartite quantum systems: Euclidean volume ratios and detectability by Bell inequalities

This page was built for publication: Convex set of quantum states with positive partial transpose analysed by hit and run algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347997)