Computing finite-dimensional bipartite quantum separability
arXiv:cs/0504110
Abstract
Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represents an unentangled, or separable, state. Essentially, this is the quantum separability problem. Chapters 1 to 3 motivate a new interior-point algorithm which, given the expected values of a subset of an orthogonal basis of observables of an otherwise unknown quantum state, searches for an entanglement witness in the span of the subset of observables. When all the expected values are known, the algorithm solves the separability problem. In Chapter 4, I give the motivation for the algorithm and show how it can be used in a particular physical scenario to detect entanglement (or decide separability) of an unknown quantum state using as few quantum resources as possible. I then explain the intuitive idea behind the algorithm and relate it to the standard algorithms of its kind. I end the chapter with a comparison of the complexities of the algorithms surveyed in Chapter 3. Finally, in Chapter 5, I present the details of the algorithm and discuss its performance relative to standard methods.
Replaced orginal archive submission with PhD thesis, which subsumes and mildly corrects it
References in corpus (36)
- Entanglement of Formation of an Arbitrary State of Two Qubits
- Separability Criterion for Density Matrices
- A computable measure of entanglement
- Quantifying Entanglement
- On the volume of the set of mixed entangled states
- Separability criterion and inseparable mixed states with positive partial transposition
- Robustness of entanglement
- Separability of very noisy mixed states and implications for NMR quantum computing
- Characterizing Entanglement
- Unknown Quantum States: The Quantum de Finetti Representation
- Bell's inequalities and density matrices. Revealing hidden nonlocality.
- A complete family of separability criteria
- Distinguishing separable and entangled states
- Qudit Quantum State Tomography
- Entanglement as precondition for secure quantum key distribution
- Separable states are more disordered globally than locally
- Largest separable balls around the maximally mixed bipartite quantum state
- Detection of entanglement with few local measurements
- Direct detection of quantum entanglement
- Separability and entanglement of composite quantum systems
- Experimental Detection of Entanglement with Polarized Photons
- Characterization of separable states and entanglement witnesses
- Separability in 2xN composite quantum systems
- A de Finetti representation for finite symmetric quantum states
- Complete hierarchies of efficient approximations to problems in entanglement theory
- Separable Multipartite Mixed States - Operational Asymptotically Necessary and Sufficient Conditions
- A Robust Semidefinite Programming Approach to the Separability Problem
- A two-way algorithm for the entanglement problem
- Separability of Rank Two Quantum States
- Separability of mixed quantum states: linear contractions approach
- Checking separability via semidefinite programming
- From limits of quantum nonlinear operations to multicopy entanglement witnesses and state spectrum estimation
- Continuous optimal ensembles I: A geometrical characterization of robustly separable quantum states
- A note on continuous ensemble expansions of quantum states
- Continuous optimal ensembles II. Reducing the separability condition to numerical equations
- An asymptotical separability criterion for bipartite density operators