Dvoretzky's theorem and the complexity of entanglement detection
From MaRDI portal
Publication:4645006
DOI10.19086/DA.1242zbMath1404.81039arXiv1510.00578OpenAlexW2196383449MaRDI QIDQ4645006
Guillaume Aubrun, Stanislaw J. Szarek
Publication date: 9 January 2019
Published in: Discrete Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.00578
Related Items (7)
On approximations of the PSD cone by a polynomial number of smaller-sized PSD cones ⋮ Tensor products of quantum mappings ⋮ Limitations of semidefinite programs for separable states and entangled games ⋮ Random matrix techniques in quantum information theory ⋮ The set of separable states has no finite semidefinite representation except in dimension \(3\times 2\) ⋮ Quantum mappings and characterization of entangled quantum states ⋮ On Polyhedral Approximations of the Positive Semidefinite Cone
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On approximation by projections of polytopes with few facets
- Hastings's additivity counterexample via Dvoretzky's theorem
- User-friendly tail bounds for sums of random matrices
- The dimension of almost spherical sections of convex bodies
- Limitations of semidefinite programs for separable states and entangled games
- Separability of mixed states: necessary and sufficient conditions.
- Separability criterion and inseparable mixed states with positive partial transposition.
- Approximation of convex sets by polytopes
- Positive linear maps of operator algebras
- k-Extendibility of high-dimensional bipartite quantum states
- There is no direct generalization of positive partial transpose criterion to the three-by-three case
- Entanglement Witnesses Arising from Exposed Positive Linear Maps
- Quantum interactive proofs and the complexity of separability testing
- Thrifty Approximations of Convex Bodies by Polytopes
- A note on coverings
- Geometry of sets of quantum maps: A generic positive map acting on a high-dimensional system is not completely positive
- Classical deterministic complexity of Edmonds' Problem and quantum entanglement
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Separability Criterion for Density Matrices
- Probability Inequalities for Sums of Bounded Random Variables
- Alice and Bob Meet Banach
- Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
- Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization
- A quasipolynomial-time algorithm for the quantum separability problem
- Covering a sphere with spheres
- Entanglement Thresholds for Random Induced States
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
This page was built for publication: Dvoretzky's theorem and the complexity of entanglement detection
