Related papers: Optimal probabilistic dense coding schemes

I. This paper is devoted to the problem of error detection with quantum codes. In the first part we examine possible problem settings for quantum error detection. Our goal is to derive a functional that describes the probability of…

It is known that unambiguous discrimination among non-orthogonal but linearly independent quantum states is possible with a certain probability of success. Here, we consider a variant of that problem. Instead of discriminating among all of…

Dense coding is the seminal example of how entanglement can boost qubit communication, from sending one bit to sending two bits. This is made possible by projecting separate particles onto a maximally entangled basis. We investigate more…

We present a scheme for teleporting an unknown, two-particle entangled state with a message from a sender (Alice) to a receiver (Bob) via a six-particle entangled channel. We also present another scheme for teleporting an unknown…

We address the problem of distinguishing among a finite collection of quantum states, when the states are not entirely known. For completely specified states, necessary and sufficient conditions on a quantum measurement minimizing the…

We consider the possibility of using stabilizer states to perform deterministic dense coding among multiple senders and a single receiver. In the model we studied, the utilized stabilizer state is partitioned into several subsystems and…

We discuss a scheme for a full superdense coding of entangled photon states employing only linear-optics elements. By using the mixed basis consisting of four states that are unambiguously distinguishable by a standard and polarizing beam…

It has recently been shown that there are efficient algorithms for quantum computers to solve certain problems, such as prime factorization, which are intractable to date on classical computers. The chances for practical implementation,…

The quantum advantage of dense coding is studied, considering general encoding quantum operations. Particular attention is devoted to the case of many senders, and it is shown that restrictions on the possible operations on the senders'…

State transfer across discrete quantum networks is one of the elementary tasks of quantum information processing. Its aim is the faithful placement of information into a specific position in the network. However, all physical systems suffer…

Performing experiments on small-scale quantum computers is certainly a challenging endeavor. Many parameters need to be optimized to achieve high-fidelity operations. This can be done efficiently for operations acting on single qubits as…

We propose efficient-phase-encoding protocols for continuous-variable quantum key distribution using coherent states and postselection. By these phase encodings, the probability of basis mismatch is reduced and total efficiency is…

A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…

Decoy states have recently been proposed as a useful method for substantially improving the performance of quantum key distribution. Here, we present a general theory of the decoy state protocol based on only two decoy states and one signal…

We consider a symmetric quantum communication scenario in which the signal states are edges of a quantum pyramid of arbitrary dimension and arbitrary shape, and all edge states are transmitted with the same probability. The receiver could…

We discuss properties of probabilistic coding of two qubits to one qutrit and generalize the scheme to higher dimensions. We show that the protocol preservers entanglement between qubits to be encoded and environment and can be also applied…

I investigate dense coding with a general mixed state on the Hilbert space $C^{d}\otimes C^{d}$ shared between a sender and receiver. The following result is proved. When the sender prepares the signal states by mutually orthogonal unitary…

We study the teleportation scheme performed by means of a partially entangled pure state. We found that the information belonging to the quantum channel can be distributed into both the system of the transmitter and the system of the…

In this paper, we introduce optimal versions of a multi-port based teleportation scheme allowing to send a large amount of quantum information. We fully characterise probabilistic and deterministic case by presenting expressions for the…

We investigate schemes for quantum secret sharing and quantum dense coding via tripartite entangled states. We present a scheme for sharing classical information via entanglement swapping using two tripartite entangled GHZ states. In order…