Related papers: Quantum states representing perfectly secure bits …
We analyze the set of two-qubit states from which a secret key can be extracted by single-copy measurements plus classical processing of the outcomes. We introduce a key distillation protocol and give the corresponding necessary and…
Entanglement distillation is a key step in quantum information, both theoretically and practically. It has been proven that non-positive-partial transpose (NPT) entangled states of rank at most four is 1-distillable under local operation…
We prove an analytic positive lower bound for the geometric distance between entangled positive partial transpose (PPT) states of a broad class and any private state that delivers one secure key bit. Our proof holds for any Hilbert space of…
The need for secrecy and security is essential in communication. Secret sharing is a conventional protocol to distribute a secret message to a group of parties, who cannot access it individually but need to cooperate in order to decode it.…
We present a lower bound of concurrence for arbitrary dimensional bipartite quantum states. This lower bound may be used to improve all the known lower bounds of concurrence. Moreover, the lower bound gives rise to an operational sufficient…
We propose a scheme for distillation of free bipartite entanglement from bipartite bound-entangled states. The crucial element of our scheme is an ancillary system that is coupled to the initial bound-entangled state via appropriate weak…
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…
We show that bipartite quantum states of any dimension, which do not have a positive partial transpose, become 1-distillable when one adds an infinitesimal amount of bound entanglement. To this end we investigate the activation properties…
We describe how to achieve optimal entanglement generation and one-way entanglement distillation rates by coherent implementation of a class of secret key generation and secret key distillation protocols, respectively. This short paper is a…
Quantum entanglement, as the strictly non-classical phenomena, is the kernel of quantum computing and quantum simulation, and has been widely applied ranging from fundamental tests of quantum physics to quantum information processing. The…
Two deterministic secure quantum communication schemes are proposed, one based on pure entangled states and the other on $d$-dimensional single-photon states. In these two schemes, only single-photon measurements are required for the two…
We show the unconditional security of decoy-state method quantum cryptography with whatever intensity error pattern provided that the error is not too large. Our result immediately applies to the existing experimental data. Our result is…
We present a general technique for hiding a classical bit in multipartite quantum states. The hidden bit, encoded in the choice of one of two possible density operators, cannot be recovered by local operations and classical communication…
We analyze tight informationally complete measurements for arbitrarily large multipartite systems and study their configurations of entanglement. We demonstrate that tight measurements cannot be exclusively composed neither of fully…
We investigate Gaussian quantum states in view of their exceptional role within the space of all continuous variables states. A general method for deriving extremality results is provided and applied to entanglement measures, secret key…
The unambiguous detection and quantification of entanglement is a hot topic of scientific research, though it is limited to low dimensions or specific classes of states. Here we identify an additional class of quantum states, for which…
A new quantum cryptography protocol, based on all unselected states of a qubit as a sort of alphabet with continuous set of letters, is proposed. Its effectiveness is calculated and shown to be essentially higher than those of the other…
It is well known that any entangled mixed state in $2\otimes 2$ systems can be purified via infinite copies of the mixed state. But can one distill a pure maximally entangled state from finite copies of a mixed state in any bipartite system…
Based on the fact that the entanglement can not be created locally, we proposed a quantum bit commitment protocol, in which entangled states and quantum algorithms is used. The bit is not encoded with the form of the quantum states, and…
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…