Related papers: Low-dimensional quite noisy bound entanglement wit…
The six-state protocol is a discrete-variable protocol for quantum key distribution, that permits to tolerate a noisier channel than the BB84 protocol. In this work we provide a lower bound on the maximum achievable key rate of a practical…
We show the enhancement of distillable key rate for quantum key distribution(QKD), by local filtering, for several bound entangled states. Through our work it becomes evident that the local filtration operations, while transforming one…
We study robustness of bipartite entangled states that are positive under partial transposition (PPT). It is shown that almost all PPT entangled states are unconditionally robust, in the sense, both inseparability and positivity are…
The utilization of a $d$-level partially entangled state, shared by two parties wishing to communicate classical information without errors over a noiseless quantum channel, is discussed. We analytically construct deterministic dense coding…
Entanglement distillation, an essential quantum information processing task, refers to the conversion from multiple copies of noisy entangled states to a smaller number of highly entangled states. In this work, we study the non-asymptotic…
The goal of an entanglement distillation protocol is to convert large quantities of noisy entangled states into a smaller number of high-fidelity Bell pairs. The celebrated one-way hashing method is one such protocol, and it is known for…
Efficiency is a key issue in any real implementation of a cryptographic protocol since the physical resources are not unlimited. We will first show that Quantum Key Distribution is possible with an "Entanglement based" scheme with NPPT…
We consider the distribution of high-dimensional entangled states to multiple parties via noisy channels and the subsequent probabilistic conversion of these states to desired target states using stochastic local operations and classical…
The security of a cryptographic key that is generated by communication through a noisy quantum channel relies on the ability to distill a shorter secure key sequence from a longer insecure one. For an important class of protocols, which…
It is known that entangled mixed states that are positive under partial transposition (PPT states) must have rank at least four. In a previous paper we presented a classification of rank four entangled PPT states which we believe to be…
A nice and interesting property of any pure tensor-product state is that each such state has distillable entangled states at an arbitrarily small distance $\epsilon$ in its neighborhood. We say that such nearby states are…
Entanglement [1, 2] enables powerful new quantum technologies [3-8], but in real-world implementations, entangled states are often subject to decoherence and preparation errors. Entanglement distillation [9, 10] can often counteract these…
The quantum dense coding (DC) protocol, which has no security feature, deals with the transmission of classical information encoded in a quantum state by using shared entanglement between a single sender and a single receiver. Its…
Using a geometric measure of entanglement quantification based on Euclidean distance of the Hermitian matrices, we obtain the minimum distance between a bipartite bound entangled $n$- qudit density matrix and the maximally mixed state.This…
We derive general upper bounds on the distillable entanglement of a mixed state under one-way and two-way LOCC. In both cases, the upper bound is based on a convex decomposition of the state into 'useful' and 'useless' quantum states. By…
In this paper, we revisit the application of classical advantage distillation (CAD) to the decoy-state BB84 protocol. Prior work has shown that CAD can greatly improve maximal distances and noise tolerances of the practical decoy state…
We consider properties of states of many qubits, which arise after sending certain entangled states via various noisy channels (white noise, coloured noise, local depolarization, dephasing and amplitude damping). Entanglement of these…
Bound entangled (BE) states are strange in nature: non-zero amount of free entanglement is required to create them but no free entanglement can be distilled from them under local operations and classical communication (LOCC). Even though…
Entanglement detection in high dimensional systems is a NP-hard problem since it is lacking an efficient way. Given a bipartite quantum state of interest free entanglement can be detected efficiently by the PPT-criterion (Peres-Horodecki…
We show how to design families of operational criteria that distinguish entangled from separable quantum states. The simplest of these tests corresponds to the well-known Peres-Horodecki positive partial transpose (PPT) criterion, and the…