Related papers: Bounding Polynomial Entanglement Measures for Mixe…
Entanglement has recently been recognized as an energy resource which can outperform classical resources if decoherence is relatively low. Multi-atom entangled states can mutate irreversibly to so called bound entangled (BE) states under…
Blind estimation of intersymbol interference channels based on the Baum-Welch (BW) algorithm, a specific implementation of the expectation-maximization (EM) algorithm for training hidden Markov models, is robust and does not require labeled…
We discuss in this letter Lewenstein-Sanpera (L-S) decomposition for a specific Werner state. Compared with the optimal case, we propose a quasi-optimal one which in the view of concurrence leads to the same entanglement measure for the…
We address the problem of optimising entanglement witnesses when a limited fixed set of local measurements can be performed on a bipartite system, thus providing a procedure, feasible also for experiments, to detect entangled states using…
Image classification technology and performance based on Deep Learning have already achieved high standards. Nevertheless, many efforts have conducted to improve the stability of classification via ensembling. However, the existing ensemble…
We study experimentally accessible lower bounds on entanglement measures based on entropic uncertainty relations. Experimentally quantifying entanglement is highly desired for applications of quantum simulation experiments to fundamental…
In this paper, we propose the average determinant of reduced density matrices for each qubit as a global entanglement measure. By means of the properties of reduced density matrices, we can investigate the present measure. We propose a…
In this paper we consider the problem of unambiguous discrimination between a set of linearly independent pure quantum states. We show that the design of the optimal measurement that minimizes the probability of an inconclusive result can…
Entanglement of purification was introduced by Terhal et al. for characterizing the bound of the generation of correlated states from maximally entangled states with sublinear size of classical communication. On the other hand, M. Horodecki…
We present two entanglement concentration protocols (ECPs) for arbitrary three-electron W state based on their charges and spins. Different from other ECPs, in both two ECPs, with the help of the electronic polarization beam splitter (PBS)…
We propose an alternative evaluation of quantum entanglement by measuring the maximum violation of the Bell's inequality without performing a partial trace operation. This proposal is demonstrated by bridging the maximum violation of the…
For a given ensemble of $N$ independent and identically prepared particles, we calculate the binary decision costs of different strategies for measurement of polarised spin 1/2 particles. The result proves that, for any given values of the…
An entanglement measure for a bipartite quantum system is a state functional that vanishes on separable states and that does not increase under separable (local) operations. It is well-known that for pure states, essentially all…
We generalize previously proposed conditions each measure of entanglement has to satisfy. We present a class of entanglement measures that satisfy these conditions and show that the Quantum Relative Entropy and Bures Metric generate two…
In this paper, firstly considering that in separable states, the measurement of one particle has no effect on the measurement of the second particle, we show that Alice and Bob can find directions in which the results of their measurements…
A lower bound on the amount of noise that must be added to a GHZ-like entangled state to make it separable (also called the random robustness) is found using the transposition condition. The bound is applicable to arbitrary numbers of…
The detection of entanglement in a bipartite state is a crucial issue in quantum information science. Based on realignment of density matrices and the vectorization of the reduced density matrices, we introduce a new set of separability…
We present a quasipolynomial-time algorithm for solving the weak membership problem for the convex set of separable, i.e. non-entangled, bipartite density matrices. The algorithm decides whether a density matrix is separable or whether it…
The geometric measure of entanglement, which expresses the minimum distance to product states, has been generalized to distances to sets that remain invariant under the stochastic reducibility relation. For each such set, an associated…
This article critically investigates the limitations of the simulated annealing algorithm using probabilistic bits (pSA) in solving large-scale combinatorial optimization problems. The study begins with an in-depth analysis of the pSA…