相关论文: How many ebits can be unlocked with one classical …

Time evolution of entanglement of N quantum dots is analyzed within the spin-1/2 van der Waals (or Lipkin-Meshkov-Glick) XY model. It is shown that, for a single dot initially excited and disentangled from the remaining unexcited dots, the…

In [M. Piani et al., arXiv:1103.4032 (2011)] an activation protocol was introduced which maps the general non-classical (multipartite) correlations between given systems into bipartite entanglement between the systems and local ancillae by…

In this paper we consider the following question: how many bits of classical communication and shared random bits are necessary to simulate a quantum protocol involving Alice and Bob where they share k entangled quantum bits and do not…

The optimal rate of reliable communication over a quantum channel can be enhanced by pre-shared entanglement. Whereas the enhancement may be unbounded in infinite-dimensional settings even when the input power is constrained, a…

It is believed that a particle cannot carry more than one bit of information. It is pointed out that particle or single-particle quantum state can carry more than one bit of information. It implies that minimum energy cost of transmitting a…

We calculate the entanglement-assisted classical capacity of symmetric and asymmetric Pauli channels where two consecutive uses of the channels are correlated. It is evident from our study that in the presence of memory, a higher amount of…

A class of quantum protocols to teleport bipartite (entangled) states of two qubits is suggested. Our schemes require a single entangled pair shared by the two parties and the transmission of three bits of classical information, as well as…

How entangled is a randomly chosen bipartite stabilizer state? We show that if the number of qubits each party holds is large the state will be close to maximally entangled with probability exponentially close to one. We provide a similar…

Uncloneable encryption is a cryptographic primitive which encrypts a classical message into a quantum ciphertext, such that two quantum adversaries are limited in their capacity of being able to simultaneously decrypt, given the key and…

Suppose that $m$ senders want to transmit classical information to $n$ receivers with zero probability of error using a noisy multipartite communication channel. The senders are allowed to exchange classical, but not quantum, messages among…

The ability to reach a maximally entangled state from a separable one through the use of a two-qubit unitary operator is analyzed for mixed states. This extension from the known case of pure states shows that there are at least two families…

We find that a bipartite quantum state is entangled if and only if it is quantum coherent with respect to complete bases of states in the corresponding system that are distinguishable under local quantum operations and classical…

The concept of entanglement splitting is introduced by asking whether it is possible for a party possessing half of a pure bipartite quantum state to transfer some of his entanglement with the other party to a third party. We describe the…

We show that, if the accessible information is used as a security quantifier, quantum channels with a certain symmetry can convey private messages at a tremendously high rate, as high as less than one bit below the rate of non-private…

We consider the classical correlations that two observers can extract by measurements on a bipartite quantum state, and we discuss how they are related to the quantum mutual information of the state. We show with several examples how…

We introduce and analyse the problem of encoding classical information into different resources of a quantum state. More precisely, we consider a general class of communication scenarios characterised by encoding operations that commute…

We explore several new converse bounds for classical communication over quantum channels in both the one-shot and asymptotic regimes. First, we show that the Matthews-Wehner meta-converse bound for entanglement-assisted classical…

We explore the possibility of performing super dense coding with non-maximally entangled states as a resource. Using this we find that one can send two classical bits in a probabilistic manner by sending a qubit. We generalize our scheme to…

A bipartite quantum state (for two systems in any dimensions) can be decomposed as a superposition of many components. For a superposition of more than two components we prove that there is a bound of the entanglement of the superposition…

We present an improved protocol for entanglement purification of bipartite mixed states. The protocol requires two-way classical communication and hence implies an improved lower bound on the quantum capacity with two-way classical…