Dynamics of coded information over Bloch channels is investigated for different values of the channel's parameters. We show that, the suppressing of the travelling coded information over Bloch channel can be increased by decreasing the equilibrium absolute value of information carrier and consequently decreasing the distilled information by eavesdropper. The amount of decoded information can be improved by increasing the equilibrium values of the two qubits and decreasing the ratio between longitudinal and transverse relaxation times. The robustness of coded information in maximum and partial entangled states is discussed. It is shown that the maximum entangled states are more robust than the partial entangled state over this type of channels.
We examine dense coding with an arbitrary pure entangled state sharing between the sender and the receiver. Upper bounds on the average success probability in approximate dense coding and on the probability of conclusive results in unambiguous dense coding are derived. We also construct the optimal protocol which saturates the upper bound in each case.
We study optimal dense coding with thermal entangled states of a two-qubit anisotropic \emph{XXZ} model and a Heisenberg model with Dzyaloshinski-Moriya (DM) interactions. The DM interaction is another kind of anisotropic antisymmetric exchange interaction. The effects of these two kinds of anisotropies on dense coding are studied in detail for both the antiferromagnetic and ferromagnetic cases. For the two models, we give the conditions that the parameters of the models have to satisfy for a valid dense coding. We also found that even though there is entanglement, it is unavailable for our op…
The sending station being the classical device can be eavesdropped by classical means. Dense coding and quantum nature of wave function give the additional resource to raise the safety of the quantum channel as a whole.
We study the super dense coding capacity in the presence of quantum channels with correlated noise. We investigate both the cases of unitary and non-unitary encoding. Pauli channels for arbitrary dimensions are treated explicitly. The super dense coding capacity for some special channels and resource states is derived for unitary encoding. We also provide an example of a memory channel where non-unitary encoding leads to an improvement in the super dense coding capacity.
We present a scheme of probabilistic dense coding via a quantum channel of non-maximally entangled three-particle state. The quantum dense coding will be succeeded with a certain probability if the sender introduces an auxiliary particle and performs a collective unitary transformation. Furthermore, the average information transmitted in this scheme is calculated.
A two-receiver quantum dense coding scheme and an $N$-receiver quantum dense coding scheme, in the case of non-symmetric Hilbert spaces of the particles of the quantum channel, are investigated in this paper. A sender can send his messages to many receivers simultaneously. The scheme can be applied to quantum secret sharing and controlled quantum dense coding.
The effects of nuclear field and spin-orbit interaction on dense coding and swap operation are studied in detail for both the antiferromagnetic (AFM) and ferromagnetic (FM) coupling cases. The conditions for a valid dense coding and under which swap operation is feasible are given.
A protocol of quantum dense coding protection of two qubits is proposed in amplitude damping (AD) channel using weak measurement and reversal measurement. It is found that the capacity of quantum dense coding under the weak measurement and reversal measurement is always greater than that without weak measurement and reversal measurement. When the protocol is applied, for the AD channels with different damping coefficient, the result reflects that quantum entanglement can be protected and quantum dense coding becomes successful.
We present a rigorous proof of an interesting boundary effect of deterministic dense coding first observed by Mozes et al. [Phys. Rev. A 71, 012311 (2005)]. Namely, it is shown that $d^2-1$ cannot be the maximal alphabet size of any isometric deterministic dense coding schemes utilizing $d$-level partial entanglement.
Capacity of dense coding via correlated noisy channel is greater than that in uncorrelated noisy channel. It is shown that weak measurement and reversal measurement can make further effort to improve quantum dense coding capacity in correlated amplitude damping channel, but this effort is very small in correlated phase damping channel and correlated depolarizing channel.
We investigate probabilistic dense coding in non-symmetric Hilbert spaces of the sender's and the receiver's particles. The sender and the receiver share the multipartite non-maximally quantum channel. We also discuss the average information.
Ideal dense coding protocols allow one to use prior maximal entanglement to send two bits of classical information by the physical transfer of a single encoded qubit. We investigate the case when the prior entanglement is not maximal and the initial state of the entangled pair of qubits being used for the dense coding is a mixed state. We find upper and lower bounds on the capability to do dense coding in terms of the various measures of entanglement and in terms of the average mutual distinguishability of the signal states.
Dense coding or super-dense coding in the case of high-dimension quantum states between two parties and multi-parties has been studied in this paper. We construct explicitly the measurement basis and the forms of the single-body unitary operations corresponding to the basis chosen, and the rules for selecting the one-body unitary operations in a multi-party case.
A scheme to achieve dense quantum coding for the quadrature amplitudes of the electromagnetic field is presented. The protocol utilizes shared entanglement provided by nondegenerate parametric down conversion in the limit of large gain to attain high efficiency. For a constraint in the mean number of photons n associated with modulation in the signal channel, the channel capacity for dense coding is found to be ln(1+n+n^2), which always beats coherent-state communication and surpasses squeezed-state communication for n>1. For n>>1, the dense coding capacity approaches twice that of either sche…
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' side may make some quantum state useless for dense-coding. It is shown, e.g., that some states are useful for dense coding if the senders can communicate classically (but not quantumly), yet they cannot be used for dense coding, if classical communication is not allowed. These no-go results are actually independent of the particular quantification of the quantu…
We present a dense coding scheme between one sender and two receivers, which guarantees that the receivers simultaneously obtain their respective messages. In our scheme, the quantum entanglement channel is first locked by the sender so that the receivers cannot learn their messages unless they collaborate to perform the unlocking operation. We also show that the quantum Fourier transform can act as the locking operator both in simultaneous dense coding and teleportation.
We investigate a scheme for implementing quantum dense coding via atomic ensembles, where prior distribution of the quantum entangled state is not needed. Our scheme also combines another two distinct advantages: atomic ensembles qubits with long coherent time serve as memory qubits and phtonic qubit as flying qubit. Thus our suggestion may offer a simple and easy way of demonstrating quantum dense coding experimentally via atomic ensembles.
We introduce a probabilistic version of the one-shot quantum dense coding protocol in both two- and multiport scenarios, and refer to it as conclusive quantum dense coding. Specifically, we analyze the corresponding capacities of two-qubit, two-qutrit, and three-qubit shared states. We identify cases where Pauli and generalized Pauli operators are not sufficient as encoders to attain the optimal one-shot conclusive quantum dense coding capacities. We find that there is a rich connection between the capacities, and the bipartite and multipartite entanglements of the shared state.
We investigate super dense coding in the presence of noise, i.e. the subsystems of the entangled resource state have to pass a noisy unital quantum channel between the sender and the receiver. We discuss explicitly the case of Pauli channels in arbitrary dimension and derive the super dense coding capacity (i.e. the optimal information transfer) for some given resource states. We also study the case that the initial resource state can be chosen: for the qubit depolarizing channel we show that there is a threshold value for the noise parameter, below which the super dense coding protocol is opt…
We investigate the conditions under which unconditional dense coding can be achieved using continuous variable entanglement. We consider the effect of entanglement impurity and detector efficiency and discuss experimental verification. We conclude that the requirements for a strong demonstration are not as stringent as previously thought and are within the reach of present technology.
We have presented a theoretical extended version of dense coding protocol using entangled position state of two particles shared between two parties. A representation of Bell states and the required unitary operators are shown utilizing symmetric normalized Hadamard matrices. In addition, some explicit and conceivable forms for the unitary operators are presented by using some introduced basic operators. It is shown that, the proposed version is logarithmically efficient than some other multi-qubit dense coding protocols.
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 transformations with equal {\it a priori} probabilities, the capacity of dense coding is maximized. It is also proved that the optimal capacity of dense coding $χ^{*}$ satisfies $E_{R}(ρ)\leq χ^{*}\leq E_{R}(ρ)+\log_{2}d$, where $E_{R}(ρ)$ is the relative entropy of entanglement of the shared entangled state.
An asymptotic entanglement measure for any bipartite states is derived in the light of the dense coding capacity optimized with respect to local quantum operations and classical communications. General properties and some examples with explicit forms of this entanglement measure are investigated.
Usually it is assumed that quantum dense coding is due to quantum entanglement between two parties. We show that this phenomenon has its origin in {\em correlations} between two parties rather than simply in entanglement. In order to justify our argument we evaluate a capacity of the noiseless channel for two cases: (1) when Bob performs measurement just on the particle received from Alice and (2) in the case when he utilizes the whole potential of the dense coding, that is, he performs the measurement on the received particle and the particle he had prior to the communication. We also present…
We investigate a secure scheme for implementing quantum dense coding via cavity decay and liner optics devices. Our scheme combines two distinct advantages: atomic qubit sevres as stationary bit and photonic qubit as flying bit, thus it is suitable for long distant quantum communication.
Dense coding has been implemented using the generalized Grover's algorithm and its inverse operation. Exploiting the superpositions of two Einstein-Podolsky-Rosen (EPR) states, messages that are possible to be transmitted increase. Our scheme is demonstrated using nuclear magnetic resonance (NMR). Experimental results show a good agreement between theory and experiment.
In a recent Brief Report, Lee et al. [L. Lee, D. Ahn, and S.W. Hwang, Phys. Rev. A 66, 024304 (2002)] have claimed that using pairwise entangled qubits gives rise to an exponentially more efficient dense coding when two parties are involved than using maximally entangled qubits shared among N parties. Here, we show that their claim is not true.
Simultaneous dense coding guarantees that Bob and Charlie simultaneously receive their respective information from Alice in their respective processes of dense coding. The idea is to use the so-called locking operation to "lock" the entanglement channels, thus requiring a joint unlocking operation by Bob and Charlie in order to simultaneously obtain the information sent by Alice. We present some new results on simultaneous dense coding: (1) We propose three simultaneous dense coding protocols, which use different $N$-dimensional entanglement (Bell state, W state and GHZ state). (2) Besides the…
We establish a one-to-one correspondence between (1) quantum teleportation schemes, (2) dense coding schemes, (3) orthonormal bases of maximally entangled vectors, (4) orthonormal bases of unitary operators with respect to the Hilbert-Schmidt scalar product, and (5) depolarizing operations, whose Kraus operators can be chosen to be unitary. The teleportation and dense coding schemes are assumed to be ``tight'' in the sense that all Hilbert spaces involved have the same finite dimension d, and the classical channel involved distinguishes d^2 signals. A general construction procedure for orthono…
We introduce the notion of distributed quantum dense coding, i.e. the generalization of quantum dense coding to more than one sender and more than one receiver. We show that global operations (as compared to local operations) of the senders do not increase the information transfer capacity, in the case of a single receiver. For the case of two receivers, using local operations and classical communication, a non-trivial upper bound for the capacity is derived. We propose a general classification scheme of quantum states according to their usefulness for dense coding. In the bipartite case (for …
We study multipartite super dense coding in the presence of a covariant noisy channel. We investigate the case of many senders and one receiver, considering both unitary and non-unitary encoding. We study the scenarios where the senders apply local encoding or global encoding. We show that, up to some pre-processing on the original state, the senders cannot do better encoding than local, unitary encoding. We then introduce general Pauli channels as a significant example of covariant maps. Considering Pauli channels, we provide examples for which the super dense coding capacity is explicitly de…
The paper presents the detailed study of controlled dense coding scheme for different types of $3$ and $4-$ particle states. It consists of GHZ state, GHZ type states, Maximal Slice state, Four particle GHZ state and W class of states. It is shown that GHZ-type states can be used for controlled dense coding in a probabilistic sense. We have shown relations among parameter of GHZ type state, concurrence of the shared bipartite state by two parties with respect to GHZ type and Charlie's measurement angle $θ$. We have seen that tripartite W state and quadripartite W state cannot be used in contro…
A set of protocols for teleportation and dense coding tasks with the use of a N particle quantum channel, presented by entangled states of the GHZ class, is introduced, when N>2. Using a found representation for the multiparticle entangled states of the GHZ class, it has shown, that for dense coding schemes enhancement of the classical capacity of the channel due from entanglement is N/N-1. If N>2 there is no one - to -one correspondence between teleportation and dense coding schemes in comparison with the EPR channel is exploited. A set of schemes, for which two additional operations as entan…
Distributed Quantum Dense Coding Enhanced With Non-classical Routing
Indian Institute of Science Education and Research, Pune（印度科学教育研究所浦那分校）；Harish-Chandra Research Institute, A CI of Homi Bhabha National Institute（哈里什-昌德拉研究所，霍米·巴巴国立学院下属机构）
The remarkable transmission of two bits of information via a single qubit entangled with another at the destination, is presented as an expansion of the unremarkable classical circuit that transmits the bits with two direct qubit-qubit couplings between source and destination
In this paper, we show how continuous-variable dense coding can be implemented using entangled light generated from a membrane-in-the-middle geometry. The mechanical resonator is assumed to be a high reflectivity membrane hung inside a high quality factor cavity. We show that the mechanical resonator is able to generate an amount of entanglement between the optical modes at the output of the cavity, which is strong enough to approach the capacity of quantum dense coding at small photon numbers. The suboptimal rate reachable by our optomechanical protocol is high enough to outperform the classi…
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 schemes for certain classes of non-maximally entangled states, and numerically obtain schemes in the general case. We study the dependency of the information capacity of such schemes on the partially entangled state shared by the two parties. Surprisingly, for $d>2$ it is possible to have deterministic dense coding with less than one ebit. In this case the …
We investigate the dense coding in the case of non-symmetric Hilbert spaces of the sender and receiver's particles sharing the quantum maximally entangled state. The efficiency of classical information gain is also considered. We conclude that when a more level particle is with the sender, she can get a non-symmetric quantum channel from a symmetric one by entanglement transfer. Thus the efficiency of information transmission is improved.
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 then each subsystem is held by a distinct party. We present a sufficient condition for a stabilizer state to be useful for deterministic distributed dense coding with respect to a given partition plan. The corresponding protocol is also constructed. Furthermore, we propose a method to partially solve a more general problem of finding the set of achievable alpha…
A complementarity relation is established between the capacity of multiport classical information transmission via quantum states and multiparty quantum correlation measures for three-qubit pure states. The multiparty quantum correlation measures considered are the generalized geometric measure, the tangle, and the discord monogamy score. The complementarity relation is revealed by the identification of a one-parameter family of pure three-qubit states, which we call the maximally dense coding capable family of states. These states have the maximal multiport dense coding capacity among all thr…
A controlled quantum dense coding scheme is investigated with a four-particle non-maximal quantum channel. The amount of classical information is shown to be capable of being controlled by the controllers through adjustments of the local measurement angles and to depend on the coefficients of the quantum channel; in addition, the four particles are distributed in two inverse ways in such an quantum channel. A restricted condition for distributing the particles to realize quantum dense coding in an arbitrary ($N+2$)-particle quantum channel is proposed.
The quantum cost is a key ingredient to evaluate the quality of quantum protocols from a practical viewpoint. We show that the quantum cost of d-dimensional dense coding protocol is equal to d+3 when transmitting the classical message (0,0), and that is equal to d+4 when transmitting other classical message. It appears linear growth with the dimension and thus makes sense for implementation. In contrast, the quantum cost of high-dimensional teleportation protocols is equal to 13, which is the maximum value of the cost for the two-dimensional case. As an application, we establish the relation b…
We propose quantum dense coding protocol for optical images. This protocol extends the earlier proposed dense coding scheme for continuous variables [S.L.Braunstein and H.J.Kimble, Phys.Rev.A 61, 042302 (2000)] to an essentially multimode in space and time optical quantum communication channel. This new scheme allows, in particular, for parallel dense coding of non-stationary optical images. Similar to some other quantum dense coding protocols, our scheme exploits the possibility of sending a classical message through only one of the two entangled spatially-multimode beams, using the other one…
The question of the measurements on the Bell states by making use of mode change (from mixed to pure) of one qubit is considered. Such a mode change cannot be taken advantage of for superluminal communication in teleportation, and it may define constraints on the size of the gates.
In this paper, we study quantum dense coding between two arbitrarily fixed particles in a (N+2)-particle maximally-entangled states through introducing an auxiliary qubit and carrying out local measurements. It is shown that the transmitted classical information amount through such an entangled quantum channel usually is less than two classical bits. However, the information amount may reach two classical bits of information, and the classical information capacity is independent of the number of the entangled particles in the initial entangled state under certain conditions. The results offer …
In this paper, we provide an operational criterion for controlled dense coding with a general class of three-qubit partially entangled states. A general three-qubit pure entangled state can be classified into two inequivalent classes according to their genuine tripartite entanglement. We claim that if a three-qubit state shows entanglement characteristic similar to $GHZ$-class then such non-trivial tripartite states are useful in {\it controlled dense coding} whereas states belonging to $W$-class are not useful for that. We start with a particular class of non-trivial partially entangled state…
We investigate the effect of noisy channels in a classical information transfer through a multipartite state which acts as a substrate for the distributed quantum dense coding protocol between several senders and two receivers. The situation is qualitatively different from the case with one or more senders and a single receiver. We obtain an upper bound on the multipartite capacity which is tightened in case of the covariant noisy channel. We also establish a relation between the genuine multipartite entanglement of the shared state and the capacity of distributed dense coding using that state…
We study the performance of the super dense coding protocol in the presence of quantum channels with covariant noise. We first consider the bipartite case and review in a unified way the case of general Pauli channels. We discuss both the cases of unitary and non-unitary encoding. We also study the multipartite scenario and investigate the case of many senders and one receiver.
A quantum steganography protocol with large payload is proposed, based on dense coding and entanglement swapping of GHZ states. Its super quantum channel is formed by building up the hidden channel within the original quantum secure direct communication (QSDC) scheme. Based on the original QSDC, secrets messages are transmitted by integrating dense coding of GHZ states and entanglement swapping of GHZ states. Its capacity of super quantum channel achieves six bits per round covert communication, much higher than the previous quantum steganography protocols. Its imperceptibility is good, since …
Quantum dense coding is a protocol for transmitting two classical bits of information from a sender (Alice) to a remote receiver (Bob) by sending only one quantum bit (qubit). In this article, we propose an experimentally feasible scheme to realize quantum dense coding \textit{via} entanglement swapping in a cavity array containing a certain number of two-level atoms. Proper choice of system parameters such as atom-cavity couplings and inter-cavity couplings allows perfect transfer of information. A high fidelity transfer of information is shown to be possible by using recently achieved experi…
Quantum dense coding is one of the most important protocols in quantum communication. It derives from the idea of using quantum resources to boost the communication capacity and now serves as a key primitive across a variety of quantum information protocols. Here, we focus on the basic theoretical ideas behind quantum dense coding, discussing its development history from discrete and continuous variables to quantum networks, then to its variant protocols and applications in quantum secure communication. With this basic background in hand, we then review the main experimental achievements, from…
We consider generalisations of the dense coding protocol with an arbitrary number of senders and either one or two receivers, sharing a multiparty quantum state, and using a noiseless channel. For the case of a single receiver, the capacity of such information transfer is found exactly. It is shown that the capacity is not enhanced by allowing the senders to perform joint operations. We provide a nontrivial upper bound on the capacity in the case of two receivers. We also give a classification of the set of all multiparty states in terms of their usefulness for dense coding. We provide example…
Quantum dense coding has been demonstrated experimentally in terms of quantum logic gates and circuits in quantum computation and NMR technique. Two bits of information have been transmitted through manipulating one of the maximally entangled two-state quantum pair, which is completely consistent with the original ideal of Bennett-Wiesner proposal. Although information transmission happens between spins over inter-atomic distance, the scheme of entanglement transformation and measurement can be used in other processes of quantum information and quantum computing.
A highly entangled bipartite quantum state is more advantageous for the quantum dense coding protocol than states with low entanglement. Such a correspondence, however, does not exist even for pure quantum states in the multipartite domain. We establish a connection between the multiparty capacity of classical information transmission in quantum dense coding and several multipartite quantum correlation measures of the shared state, used in the dense coding protocol. In particular, we show that for the noiseless channel, if multipartite quantum correlations of an arbitrary multipartite state of…
A multiple round quantum dense coding (MRQDC) scheme based on the quantum phase estimation algorithm is proposed. Using an $m+1$ qubit system, Bob can transmit $2^{m+1}$ messages to Alice, through manipulating only one qubit and exchanging it between Alice and Bob for $m$ rounds. The information capacity is enhanced to $m+1$ bits. We have implemented the scheme in a three- qubit nuclear magnetic resonance (NMR) quantum computer. The experimental results show a good agreement between theory and experiment.
We show that the classical capacity of quantum states, as quantified by its ability to perform dense coding, respects an exclusion principle, for arbitrary pure or mixed three-party states in any dimension. This states that no two bipartite states which are reduced states of a common tripartite quantum state can have simultaneous quantum advantage in dense coding. The exclusion principle is robust against noise. Such principle also holds for arbitrary number of parties. This exclusion principle is independent of the content and distribution of entanglement in the multipartite state. We also fi…
Using invariance of the $n$-th tensored state w.r.t. the $n$-th symmetric group, we propose a 'variable length' universal entanglement concentration without classical communication. Like variable length data compression, arbitrary unknown states are concentrated into perfect Bell states and not approximate Bell states and the number of Bell states obtained is equal to the optimal rate asymptotically with the probability 1. One of the point of our scheme is that we need no classical communication at all. Using this method, we can construct a universal teleportation and a universal dense coding.
We present an explicit protocol ${\cal E}_0$ for faithfully teleporting an arbitrary two-qubit state via a genunie four-qubit entangled state. By construction, our four-partite state is not reducible to a pair of Bell states. Its properties are compared and contrasted with those of the four-party GHZ and W states. We also give a dense coding scheme ${\cal D}_0$ involving our state as a shared resource of entanglement. Both ${\cal D}_0$ and ${\cal E}_0$ indicate that our four-qubit state is a likely candidate for the genunine four-partite analogue to a Bell state.
We present a procedure inspired by dense coding, which enables a highly efficient transmission of information of a continuous nature. The procedure requires the sender and the recipient to share a maximally entangled state. We deal with the concrete problem of aligning reference frames or trihedra by means of a quantum system. We find the optimal covariant measurement and compute the corresponding average error, which has a remarkably simple close form. The connection of this procedure with that of estimating unitary transformations on qubits is briefly discussed.
