相关论文: Optimal dense coding with arbitrary pure entangled…

The most simplest form of quantum network is an one dimensional quantum network with a single player in each node. In remote entanglement distribution each of the players carry out measurement at the intermediate nodes to produce an…

Recent results in compressed sensing showed that the optimal subsampling strategy should take into account the sparsity pattern of the signal at hand. This oracle-like knowledge, even though desirable, nevertheless remains elusive in most…

This paper concerns non-overlapping codes, block codes motivated by synchronisation and DNA-based storage applications. Most existing constructions of these codes do not account for the restrictions posed by the physical properties of…

We consider the problem of distinguishing between the elements of a bipartite maximally entangled orthonormal basis using local operations and classical communication (LOCC) and a partially entangled state acting as a resource. We derive an…

We derive an optimal bound for arbitrary entanglement manipulation based on the transmission of a pulse in coherent states over a lossy channel followed by local operations and unlimited classical communication (LOCC). This stands on a…

We proposed a scheme of continuous-variable quantum key distribution, in which the bright Einstein-Podolsky-Rosen entangled optical beams are utilized. The source of the entangled beams is placed inside the receiving station, where half of…

A new class of quantum states is introduced by demanding that the computational measurement statistics approach the Boltzmann distribution of higher-order strongly coupled Ising models. The states, referred to as $n$-coupled states, are…

In some off-resonant cases, the reduced density matrix of two atoms symmetrically coupled with an optical cavity can very approximately approach to maximally entangled mixed states or maximal Bell violation mixed states in their evolution.…

We describe an entanglement purification protocol to generate maximally entangled states with high efficiencies from two-mode squeezed states or from mixed Gaussian continuous entangled states. The protocol relies on a local quantum…

Quantum superdense coding protocols enhance channel capacity by using shared quantum entanglement between two users. The channel capacity can be as high as 2 when one uses entangled qubits. However, this limit can be surpassed by using…

Transformations from pure to mixed states are usually associated with information loss and irreversibility. Here, a protocol is demonstrated allowing one to make these transformations reversible. The pure states are diluted with a random…

This paper considers a distributionally robust chance constraint model with a general ambiguity set. We show that a sample based approximation of this model converges under suitable sufficient conditions. We also show that upper and lower…

The ability to distribute high-quality entanglement between remote parties is a necessary primitive for many quantum communication applications. A large range of schemes for realizing the long-distance delivery of remote entanglement has…

In this paper, we have reinvestigated probabilistic quantum communication protocols and developed a nontraditional remote state preparation protocol that allows for deterministically transferring information encoded in quantum states using…

Existing decentralized coded caching solutions cannot guarantee small loads in the general scenario with arbitrary file sizes and cache sizes. In this paper, we propose an optimization framework for decentralized coded caching in the…

We analyze entanglement swapping (ES) of partially entangled pure states with arbitrary Schmidt rank from the perspective of quantum state discrimination. It is shown that the standard deterministic ES protocol is related with an optimal…

The study of transformations among pure states via Local Operations assisted by Classical Communication (LOCC) plays a central role in entanglement theory. The main emphasis of these investigations is on the deterministic, or probabilistic…

This paper presents an achievability bound that evaluates the exact probability of error of an ensemble of random codes that are decoded by a minimum distance decoder. Compared to the state-of-the-art which demands exponential computation…

Entanglement can effectively increase communication channel capacity as evidenced by dense coding that predicts a capacity gain of 1 bit when compared to entanglement-free protocols. However, dense coding relies on Bell states and when…

A central question in information theory is to determine the maximum success probability that can be achieved in sending a fixed number of messages over a noisy channel. This was first studied in the pioneering work of Shannon who…