Geometrical aspects of entanglement

@article{Leinaas2006GeometricalAO,
  title={Geometrical aspects of entanglement},
  author={Jon Magne Leinaas and Jan Myrheim and Eirik Ovrum},
  journal={Physical Review A},
  year={2006},
  volume={74},
  pages={012313}
}
We study geometrical aspects of entanglement, with the Hilbert–Schmidt norm defining the metric on the set of density matrices. We focus first on the simplest case of two two-level systems and show that a “relativistic” formulation leads to a complete analysis of the question of separability. Our approach is based on Schmidt decomposition of density matrices for a composite system and nonunitary transformations to a standard form. The positivity of the density matrices is crucial for the method… 
ENTANGLEMENT AND ITS MULTIPARTITE EXTENSIONS
The aspects of many particle systems, as far as their entanglement is concerned, is highlighted. To this end we briefly review the bipartite measures of entanglement and the entanglement of pairs
Geometry of Entanglement and Quantum Simulators
TLDR
The Jordan-Wigner transformation is used to create a compiler that takes any two-body fermionic Hamiltonian and outputs all qubit gates needed to simulate the time evolution of that Hamiltonian.
Geometrical entanglement of highly symmetric multipartite states and the Schmidt decomposition
In a previous paper, we examined a geometric measure of entanglement based on the minimum distance between the entangled target state of interest and the space of unnormalized product states. Here,
Quantifying entanglement resources
We present an overview of the quantitative theory of single-copy entanglement in finite-dimensional quantum systems. In particular we emphasize the point of view that different entanglement measures
The inverse eigenvalue problem for entanglement witnesses
Entanglement and its facets in condensed matter systems
This thesis poses a selection of recent research of the author in a common context. It starts with a selected review on research concerning the role entanglement might play at quantum phase
Entanglement and geometry
In bipartite quantum systems of dimension 3× 3 the lowest rank entangled states that are positive under partial transposition (PPT) can be related, by product transformations, to states that are
A triality pattern in entanglement theory
In this work, we present new connections between three types of quantum states: positive under partial transpose states, symmetric with positive coefficients states and invariant under realignment
Geometrical interpretation of the density matrix: Mixed and entangled states
The correspondence between the density matrices ρN × N and the points in {ie564-01} is clarified. The particular cases of N = 2 and N = 4 are considered in detail. The geometrical representation of
...
...

References

SHOWING 1-10 OF 14 REFERENCES
Geometry of entangled states
Geometric properties of the set of quantum entangled states are investigated. We propose an explicit method to compute the dimension of local orbits for any mixed state of the general K x M problem
A two-way algorithm for the entanglement problem
We propose an algorithm which proves a given bipartite quantum state to be separable in a finite number of steps. Our approach is based on the search for a decomposition via a countable subset of
On the geometry of entangled states
The basic question that is addressed in this paper is finding the closest separable state for a given entangled state, measured with the Hilbert-Schmidt distance. While this problem is in general
Classical deterministic complexity of Edmonds' Problem and quantum entanglement
TLDR
It turns out that one of the most important cases when Edmonds' problem can be solved in polynomial deterministic time, i.e. an intersection of two geometric matroids, corresponds to unentangled (aka separable) bipartite density matrices.
Improved algorithm for quantum separability and entanglement detection
TLDR
A classical algorithm is introduced that solves the quantum separability problem significantly faster than the ``basic algorithm,'' allowing a feasible separability test where none previously existed, e.g., in $3\ifmmode\times\else\texttimes\fi{}3$-dimensional systems.
Towards efficient algorithm deciding separability of distributed quantum states
TLDR
It is argued that for generic states, analysis of concurrence matrices essentially reduces the task of solving separability problem in m \times n dimensions to solving a set of linear equations in about $\binom{mn+D-1}{D}$ variables.
Construction of quantum states with bound entanglement
We present a new family of bound-entangled quantum states in 3x3 dimensions. Their density matrix depends on 7 independent parameters and has 4 different non-vanishing eigenvalues.
Operational criterion and constructive checks for the separability of low-rank density matrices
We consider low-rank density operators $\ensuremath{\varrho}$ supported on a $M\ifmmode\times\else\texttimes\fi{}N$ Hilbert space for arbitrary M and N $(Ml~N),$ and with a positive partial transpose
...
...