Related papers: Detection of nonabsolute separability in quantum s…
Entangled states are undoubtedly an integral part of various quantum information processing tasks. On the other hand, absolutely separable states which cannot be made entangled under any global unitary operations are useless from the…
We provide a method for witnessing nonseparability of quantum processes on shared systems, which uses the channel-state duality. The method uses a maximally entangled state as a resource. We show that using the resource provides significant…
We present a method to detect properties of quantum channels, assuming that some a priori information about the form of the channel is available. The method is based on a correspondence with entanglement detection methods for multipartite…
We investigate the detection of entanglement in $n$-partite quantum states. We obtain practical separability criteria to identify genuinely entangled and non-separable mixed quantum states. No numerical optimization or eigenvalue evaluation…
Detection of entanglement through partial knowledge of the quantum state is a challenge to implement efficiently. Here we propose a separability criterion for detecting bipartite entanglement in arbitrary dimensional quantum states using…
We review in a unified way a recently proposed method to detect properties of unknown quantum channels and lower bounds to quantum capacities, without resorting to full quantum process tomography. The method is based on the preparation of a…
We demonstrate experimentally the possibility of efficiently detecting properties of quantum channels and quantum gates. The optimal detection scheme is first achieved for non entanglement breaking channels of the depolarizing form and is…
We investigate an original family of quantum distinguishability problems, where the goal is to perfectly distinguish between $M$ quantum states that become identical under a completely decohering map. Similarly, we study distinguishability…
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'…
In quantum information theory, the reliable and effective detection of entanglement is of paramount importance. However, given an unknown state, assessing its entanglement is a challenging task. To attack this problem, we investigate the…
Higher-dimensional entanglement is a valuable resource for several quantum information processing tasks, and is often characterized by the Schmidt number and specific classes of entangled states beyond qubit-qubit and qubit-qutrit systems.…
We introduce a new technique to detect separable states using semidefinite programs. This approach provides a sufficient condition for separability of a state that is based on the existence of a certain local linear map applied to a known…
This short note describes a method to tackle the (bipartite) quantum separability problem. The method can be used for solving the separability problem in an experimental setting as well as in the purely mathematical setting. The idea is to…
We focus on determining the separability of an unknown bipartite quantum state $\rho$ by invoking a sufficiently large subset of all possible entanglement witnesses given the expected value of each element of a set of mutually orthogonal…
As one of the most profound features of quantum mechanics, entanglement is a vital resource for quantum information processing. Inspired by the recent work on PT-moments and separablity [Phys. Rev. Lett. {\bf 127}, 060504 (2021)], we…
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 detection of multipartite entanglement in arbitrary dimensional systems is investigated. We derive useful $k$-separability criteria of mixed $n$-partite ($n\geq 3$) quantum states to detect $k$-nonseparable $n$-partite quantum states.…
Quantum technologies require methods for preparing and manipulating entangled multiparticle states. However, the problem of determining whether a given quantum state is entangled or separable is known to be an NP-hard problem in general,…
Nonseparability - multipartite states that cannot be factorized - is one of the most striking features of quantum mechanics, as it gives rise to entanglement and non-causal correlations. In quantum computing, it also contributes directly to…
We investigate classification and detection of entanglement of multipartite quantum states in a very general setting, and obtain efficient $k$-separability criteria for mixed multipartite states in arbitrary dimensional quantum systems.…