4,091 research outputs found
A complete criterion for separability detection
Using new results on the separability properties of bosonic systems, we
provide a new complete criterion for separability. This criterion aims at
characterizing the set of separable states from the inside by means of a
sequence of efficiently solvable semidefinite programs. We apply this method to
derive arbitrarily good approximations to the optimal measure-and-prepare
strategy in generic state estimation problems. Finally, we report its
performance in combination with the criterion developed by Doherty et al. [1]
for the calculation of the entanglement robustness of a relevant family of
quantum states whose separability properties were unknown
On the tensor convolution and the quantum separability problem
We consider the problem of separability: decide whether a Hermitian operator
on a finite dimensional Hilbert tensor product is separable or entangled. We
show that the tensor convolution defined for certain mappings on an almost
arbitrary locally compact abelian group, give rise to formulation of an
equivalent problem to the separability one.Comment: 13 pages, two sections adde
Quantum Separability and Entanglement Detection via Entanglement-Witness Search and Global Optimization
We focus on determining the separability of an unknown bipartite quantum
state by invoking a sufficiently large subset of all possible
entanglement witnesses given the expected value of each element of a set of
mutually orthogonal observables. We review the concept of an entanglement
witness from the geometrical point of view and use this geometry to show that
the set of separable states is not a polytope and to characterize the class of
entanglement witnesses (observables) that detect entangled states on opposite
sides of the set of separable states. All this serves to motivate a classical
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. The idea of such
an algorithm, which is an efficient reduction of the quantum separability
problem to a global optimization problem, was introduced in PRA 70 060303(R),
where it was shown to be an improvement on the naive approach for the quantum
separability problem (exhaustive search for a decomposition of the given state
into a convex combination of separable states). The last section of the paper
discusses in more generality such algorithms, which, in our case, assume a
subroutine that computes the global maximum of a real function of several
variables. Despite this, we anticipate that such algorithms will perform
sufficiently well on small instances that they will render a feasible test for
separability in some cases of interest (e.g. in 3-by-3 dimensional systems)
Covariance matrices and the separability problem
We propose a unifying approach to the separability problem using covariance
matrices of locally measurable observables. From a practical point of view, our
approach leads to strong entanglement criteria that allow to detect the
entanglement of many bound entangled states in higher dimensions and which are
at the same time necessary and sufficient for two qubits. From a fundamental
perspective, our approach leads to insights into the relations between several
known entanglement criteria -- such as the computable cross norm and local
uncertainty criteria -- as well as their limitations.Comment: 4 pages, no figures; v3: final version to appear in PR
Improved algorithm for quantum separability and entanglement detection
Determining whether a quantum state is separable or entangled is a problem of
fundamental importance in quantum information science. It has recently been
shown that this problem is NP-hard. There is a highly inefficient `basic
algorithm' for solving the quantum separability problem which follows from the
definition of a separable state. By exploiting specific properties of the set
of separable states, we introduce a new classical algorithm that solves the
problem significantly faster than the `basic algorithm', allowing a feasible
separability test where none previously existed e.g. in 3-by-3-dimensional
systems. Our algorithm also provides a novel tool in the experimental detection
of entanglement.Comment: 4 pages, revtex4, no figure
The power of symmetric extensions for entanglement detection
In this paper, we present new progress on the study of the symmetric
extension criterion for separability. First, we show that a perturbation of
order O(1/N) is sufficient and, in general, necessary to destroy the
entanglement of any state admitting an N Bose symmetric extension. On the other
hand, the minimum amount of local noise necessary to induce separability on
states arising from N Bose symmetric extensions with Positive Partial Transpose
(PPT) decreases at least as fast as O(1/N^2). From these results, we derive
upper bounds on the time and space complexity of the weak membership problem of
separability when attacked via algorithms that search for PPT symmetric
extensions. Finally, we show how to estimate the error we incur when we
approximate the set of separable states by the set of (PPT) N -extendable
quantum states in order to compute the maximum average fidelity in pure state
estimation problems, the maximal output purity of quantum channels, and the
geometric measure of entanglement.Comment: see Video Abstract at
http://www.quantiki.org/video_abstracts/0906273
Approximating Fractional Time Quantum Evolution
An algorithm is presented for approximating arbitrary powers of a black box
unitary operation, , where is a real number, and
is a black box implementing an unknown unitary. The complexity of
this algorithm is calculated in terms of the number of calls to the black box,
the errors in the approximation, and a certain `gap' parameter. For general
and large , one should apply a total of times followed by our procedure for approximating the fractional
power . An example is also given where for
large integers this method is more efficient than direct application of
copies of . Further applications and related algorithms are also
discussed.Comment: 13 pages, 2 figure
Further results on entanglement detection and quantification from the correlation matrix criterion
The correlation matrix (CM) criterion is a recently derived powerful
sufficient condition for the presence of entanglement in bipartite quantum
states of arbitrary dimensions. It has been shown that it can be stronger than
the positive partial transpose (PPT) criterion, as well as the computable cross
norm or realignment (CCNR) criterion in different situations. However, it
remained as an open question whether there existed sets of states for which the
CM criterion could be stronger than both criteria simultaneously. Here, we give
an affirmative answer to this question by providing examples of entangled
states that scape detection by both the PPT and CCNR criteria whose
entanglement is revealed by the CM condition. We also show that the CM can be
used to measure the entanglement of pure states and obtain lower bounds for the
entanglement measure known as tangle for general (mixed) states.Comment: 13 pages, no figures; added references, minor changes; section 4.3
added, to appear in J. Phys.
- …