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 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.
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 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.
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 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.
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 usefulness of different classes of genuine quadripartite entangled states as quantum resources for teleportation and superdense coding. We examine the possibility of teleporting unknown one, two and three qubit states. We show that one can use the teleportation protocol to send any general one and two qubit states. A restricted class of three qubit states can also be faithfully teleported. We also explore superdense coding protocol in single-receiver and multi-receiver scenarios. We show that there exist genuine quadripartite entangled states that can be used to transmit fou…
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…
We investigate economic protocol to securely encoding classical information among three users via entangled GHZ states. We implement the scheme in cavity QED with atomic qubits where the atoms interact simultaneously with a highly detuned cavity mode with the assistance of a classical field. The scheme is insensitive to the cavity decay and the thermal field, thus based on cavity QED techniques presently it might be realizable.
We demonstrate a prototype-implementation of deterministic information encoding for quantum key distribution (QKD) following the ping-pong coding protocol [K. Bostroem, T. Felbinger, Phys. Rev. Lett. 89 (2002) 187902-1]. Due to the deterministic nature of this protocol the need for post-processing the key is distinctly reduced compared to non-deterministic protocols. In the course of our implementation we analyze the practicability of the protocol and discuss some security aspects of information transfer in such a deterministic scheme.
We investigate the usefulness of a recently introduced five qubit state by Brown $\it et al. \normalfont$ \cite{Brown} for quantum teleportation, quantum state sharing and superdense coding. It is shown that this five-qubit state can be utilized for perfect teleportation of arbitrary single and two qubit systems. We devise various schemes for quantum state sharing of an arbitrary single and two particle state via cooperative teleportation. We later show that this state can be used for superdense coding as well. It is found that five classical bits can be sent by sending only three quantum bits…
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.
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 high-dimensional entanglement. We report an experiment that exceeds the limit using high-quality entangled ququarts with fidelities up to 0.98, demonstrating a channel capacity of $2.09\pm0.01$. The measured channel capacity is also higher than that obtained when transmitting only one ququart. We use the setup to transmit a five-color image with a fidelity of 0.…
We present a one-shot method for preparing pure entangled states between a sender and a receiver at a minimal cost of entanglement and quantum communication. In the case of preparing unentangled states, an earlier paper showed that a 2n-qubit quantum state could be communicated to a receiver by physically transmitting only n+o(n) qubits in addition to consuming n ebits of entanglement and some shared randomness. When the states to be prepared are entangled, we find that there is a reduction in the number of qubits that need to be transmitted, interpolating between no communication at all for m…
A fully general strong converse for channel coding states that when the rate of sending classical information exceeds the capacity of a quantum channel, the probability of correctly decoding goes to zero exponentially in the number of channel uses, even when we allow code states which are entangled across several uses of the channel. Such a statement was previously only known for classical channels and the quantum identity channel. By relating the problem to the additivity of minimum output entropies, we show that a strong converse holds for a large class of channels, including all unital qubi…
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 to throw light upon the security affairs of the quantum dense coding protocol, we also suggest a secure quantum dense coding scheme via W state in analogy with the theory of sharing information among involved users.
Under two-party deterministic dense-coding, Alice communicates (perfectly distinguishable) messages to Bob via a qudit from a pair of entangled qudits in pure state |Psi>. If |Psi> represents a maximally entangled state (i.e., each of its Schmidt coefficients is sqrt(1/d)), then Alice can convey to Bob one of d^2 distinct messages. If |Psi> is not maximally entangled, then Ji et al. [Phys. Rev. A 73, 034307 (2006)] have shown that under the original deterministic dense-coding protocol, in which messages are encoded by unitary operations performed on Alice's qudit, it is impossible to encode d^…
We study the conditions when mixtures of entangled pure states with maximally mixed one-qudit reduced density matrices remain entangled. We found that the resulting mixed state remains entangled when the number of entangled pure states to be mixed is less than or equal to the dimension of the pure states. For the latter case of mixing a number of pure states equal to their dimension, we found that the mixed state is entangled provided that the entangled pure states to be mixed are not equally weighted. We also found that one can restrict the set of pure states that one can mix from in order to…
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 present two optimal methods of teleporting an unknown qubit using any pure entangled state. We also discuss how such methods can also have succesful application in quantum secret sharing with pure multipartite entangled states.
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 the entangled beams are transmitted with round trip and the other half are retained by the receiver. The amplitude and phase signals modulated on the signal beam by the sender are simultaneously extracted by the authorized receiver with the scheme of the dense-coding correlation measurement for continuous quantum variables, thus the channel capacity is signi…
An interesting aspect of multipartite entanglement is that for perfect teleportation and superdense coding, not the maximally entangled W states but a special class of non-maximally entangled W-like states are required. Therefore, efficient preparation of such W-like states is of great importance in quantum communications, which has not been studied as much as the preparation of W states. In this letter, we propose a simple optical scheme for efficient preparation of large-scale polarization based entangled W-like states by fusing two W-like states or expanding a W-like state with an ancilla p…
We propose a scheme to produce the pure entangled states through type II downconversion. In the scheme, the vacuum states are excluded and the a prori pure entangled states are produced and verified without destroying the state itself. This can help to carry out the many unditional experiments related to quantum entanglement.
We explicate an example of the so called Task oriented Maximally Entangled states (TMES) in the context of teleportation and superdense coding. In physical situation, this state can emerge from decoherence of more entangled state or may be prepared for the purpose at hand, with less entanglement resource. We find that a variant of the Brown state can be utilized for perfect teleportation of single and two qubit states. In case of superdense coding, it is observed that five cbits can be transmitted by sending only three qubits.
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 …
A complete analysis of entangled bipartite qutrit pure states is carried out based on a simple entanglement measure. An analysis of all possible extremally entangled pure bipartite qutrit states is shown to reduce, with the help of SLOCC transformations, to three distinct types. The analysis and the results should be helpful for finding different entanglement types in multipartite pure state systems.
I show that two distant parties can transform pure entangled states to arbitrary pure states by stochastic local operations and classical communication (SLOCC) at the single copy level, if they share bound entangled states. This is the effect of bound entanglement since this entanglement processing is impossible by SLOCC alone. Similar effect of bound entanglement occurs in three qubits where two incomparable entangled states of GHZ and W can be inter-converted. In general multipartite settings composed by $N$ distant parties, all $N$-partite pure entangled states are inter-convertible by SLOC…
We present an entanglement purification protocol for a mixture of a pure entangled state and a pure product state, which are orthogonal to each other. The protocol is combination of bisection method and one-way hashing protocol. We give recursive formula for the rate of the protocol for different states, i.e. the number of maximally entangled two-qubit pairs obtained with the protocol per a single copy of the initial state. We also calculate numerically the rate for some states.
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 splitters we can deterministically transfer four messages by manipulating just one of the two entangled photons. The sender achieves the determinism of the transfer either by giving up the control over 50% of sent messages (although known to her) or by discarding 33% of incoming photons.
Any pure entangled state of two particles violates a Bell inequality for two-particle correlation functions (Gisin's theorem). We show that there exist pure entangled N>2 qubit states that do not violate any Bell inequality for N particle correlation functions for experiments involving two dichotomic observables per local measuring station. We also find that Mermin-Ardehali-Belinskii-Klyshko inequalities may not always be optimal for refutation of local realistic description.
We derive a sufficient condition for a set of pure states, each entangled in two remote $N$-dimensional systems, to be transformable to $k$-dimensional-subspace equivalent entangled states ($k\leq N$) by same local operations and classical communication. If $k=N$, the condition is also necessary. This condition reveals the function of the relative marginal density operators of the entangled states in the entanglement manipulation without sufficient information of the initial states.
We show that all pure entangled states of two $d$-dimensional quantum systems (i.e., two qudits) can be generated from an initial separable state via a universal Yang--Baxter matrix if one is assisted by local unitary transformations.
Quantum computation is based on tensor products and entangled states. We discuss an alternative to the quantum framework where tensor products are replaced by geometric products and entangled states by multivectors. The resulting theory is analogous to quantum computation but does not involve quantum mechanics. We discuss in detail similarities and differences between the two approaches and illustrate the formulas by explicit geometric objects where multivector versions of the Bell-basis, GHZ, and Hadamard states are visualized by means of colored oriented polylines.
We prove that a pure entangled state of two subsystems with equal spin is equivalent to a two-mode spin-squeezed state under local operations except for a set of bipartite states with measure zero, and we provide a counterexample to the generalization of this result to two subsystems of unequal spin.
Entangled pure-states, Werner-states and generalized mixed-states of any structure, spanning a 2x2 Hilbert space are created by a novel high-brilliance universal source of polarization-entangled photon pairs. The violation of a Bell inequality has been tested for the first time with a pure-state, indeed a conceptually relevant ideal condition, and with Werner-states. The generalized ''maximally entangled mixed states'' (MEMS) were also synthetized for the first time and their exotic properties investigated by means of a quantum tomographic technique.
We derive the optimal exponent of the error probability of the quantum fixed-length pure state source coding in both cases of blind coding and visible coding. The optimal exponent is universally attained by Jozsa et al. (PRL, 81, 1714 (1998))'s universal code. In the direct part, a group representation theoretical type method is essential. In the converse part, Nielsen and Kempe (PRL, 86, 5184 (2001))'s lemma is essential.
The spectral decomposition of all (n,2,2) Bell operators ($2^{2^n}$ in number, $n \ge 2$), as introduced by Werner and Wolf, is done. Its implications on the characterization of Bell operators as probes of entanglement are considered in detail.
We report an exhaustive numerical analysis of violations of local realism by two qutrits in all possible pure entangled states. In Bell type experiments we allow any pairs of local unitary U(3) transformations to define the measurement bases. Surprisingly, Schmidt rank-2 states, resembling pairs of maximally entangled qubits, lead to the most noise-robust violations of local realism. The phenomenon seems to be even more pronounced for four and five dimensional systems, for which we tested a few interesting examples.
We demonstrate one-sided device-independent self-testing of any pure entangled two-qubit state based on a fine-grained steering inequality. The maximum violation of a fine-grained steering inequality can be used to witness certain steerable correlations, which certify all pure two-qubit entangled states. Our experimental results identify which particular pure two-qubit entangled state has been self-tested and which measurement operators are used on the untrusted side. Furthermore, we analytically derive the robustness bound of our protocol, enabling our subsequent experimental verification of …
We present a scheme for quantum secure direct communication with quantum encryption. The two authorized users use repeatedly a sequence of the pure entangled pairs (quantum key) shared for encrypting and decrypting the secret message carried by the traveling photons directly. For checking eavesdropping, the two parties perform the single-photon measurements on some decoy particles before each round. This scheme has the advantage that the pure entangled quantum signal source is feasible at present and any eavesdropper cannot steal the message.
We look for local unitary operators $W_1 \otimes W_2$ which would rotate all equally entangled two-qubit pure states by the same but arbitrary amount. It is shown that all two-qubit maximally entangled states can be rotated through the same but arbitrary amount by local unitary operators. But there is no local unitary operator which can rotate all equally entangled non-maximally entangled states by the same amount, unless it is unity. We have found the optimal sets of equally entangled non-maximally entangled states which can be rotated by the same but arbitrary amount via local unitary operat…
Nonlocal correlations as revealed by the violations to Bell inequalities are incompatible with local models without any nonlocal correlations. However some tripartite entangled states, e.g., symmetric pure states, exhibit a stronger nonlocality even incompatible with hybrid local/nonlocal models allowing nonlocal correlations between any two parties. Here we propose a three-particle Hardy-type test without inequality, as illustrated by a gedanken experiment, that is failed by all non-signaling local models while is passed by all tripartite entangled asymmetric pure states. Our result implies t…
In this paper, we construct a measure of entanglement by generalizing the quadric polynomial of the Segre variety for general multipartite states. We give explicit expressions for general pure three-partite and four-partite states. Moreover, we will discuss and compare this measure of entanglement with the generalized concurrence.
We report on the experimental generation of an entangled state with a spectrally pure heralded single-photon state and a weak coherent state. By choosing group-velocity matching in the nonlinear crystal, our system for producing entangled photons was 60 times brighter than that in the earlier experiment [Phys. Rev. Lett. 90, 240401 (2003)], with no need of bandpass filters. This entanglement system is useful for quantum information protocols that require indistinguishable photons from independent sources.
Recently, Li. \emph{et. al.} [Int. J. Theor. Phys., 48, 2777 (2009)] derived a necessary and sufficient condition for LOCC cloning of a set of bipartite orthogonal partially but equally entangled state. We demonstrates that, the result is based on a wrong observation regarding a set of non-maximally entangled states with equal entanglement. We also provide a simple example in favor of our comment.
Suppose two distant observers Alice and Bob share a pure biparticle entangled state secretly chosen from a set, it is shown that Alice (Bob) can probabilistic concentrate the state to a maximally entangled state by applying local operations and classical communication (LQCC) if and only if the states in the set share the same marginal density operator for her (his) subsystem. Applying this result, we present probabilistic superdense coding and show that perfect purification of mixed state is impossible using only LQCC on individual particles.
An entanglement measure for pure-state continuous-variable bi-partite problem, the Schmidt number, is analytically calculated for one simple model of atom-field scattering.
We show that a single Bell's inequality with two dichotomic observables for each observer, which is originated from Hardy's nonlocality proof without inequalities, is violated by all entangled pure states of a given number of particles, each of which may have a different number of energy levels. Thus Gisin's theorem is proved in its most general form from which it follows that for pure states Bell's nonlocality and quantum entanglement are equivalent.
In this paper, we propose a novel scheme to generate two-ion maximally entangled states from either pure product states or mixed states using linear optics. Our new scheme is mainly based on the ionic interference. Because the proposed scheme can generate pure maximally entangled states from mixed states, we denote it as purification-like generation scheme. The scheme does not need a Bell state analyzer as the existing entanglement generation schemes do, it also avoids the difficulty of synchronizing the arrival time of the two scattered photons faced by the existing schemes, thus the proposed…
While it has recently been demonstrated how to certify the maximal amount of randomness from any pure two-qubit entangled state in a device-independent way [E. Woodhead et al., Phys. Rev. Research 2, 042028(R)(2020)], the problem of optimal randomness certification from entangled states of higher local dimension remains open. Here we introduce a method for device-independent certification of the maximal possible amount of $2\log_23$ random bits using pure bipartite entangled two-qutrit states and extremal nine-outcome general non-projective measurements. To this aim, we exploit the extended Be…
We consider the problem of $1$-sided device-independent self-testing of any pure entangled two-qubit state based on steering inequalities which certify the presence of quantum steering. In particular, we note that in the $2-2-2$ steering scenario (involving $2$ parties, $2$ measurement settings per party, $2$ outcomes per measurement setting), the maximal violation of a fine-grained steering inequality can be used to witness certain extremal steerable correlations, which certify all pure two-qubit entangled states. We demonstrate that the violation of analogous CHSH inequality of steering or n…
We study if all maximally entangled states are pure through several entanglement monotones. In the bipartite case, we find that the same conditions which lead to the uniqueness of the entropy of entanglement as a measure of entanglement, exclude the existence of maximally mixed entangled states. In the multipartite scenario, our conclusions allow us to generalize the idea of monogamy of entanglement: we establish the \textit{polygamy of entanglement}, expressing that if a general state is maximally entangled with respect to some kind of multipartite entanglement, then it is necessarily factori…
We study the feasibility of extracting a pure entangled state of non-complementary, and potentially well separated, regions of a quantum many-body system. It is shown that this can indeed be accomplished in non-equilibrium scenarios as well as the ground state of the considered spin chain models when one locally measures observables such as magnetization in separated blocks of spins. A general procedure is presented, which can search for the optimal way to extract a pure entangled state through local projections. Our results indicate a connection of the projective extraction of entanglement to…
We discuss and generalize multi-particle entanglement based on statistical correlations using Ursell-Mayer type of cluster coefficients. Cluster coefficients are used to distinguish different, independent entangled systems as well as those which are connected through local unitary transformations. We propose a genuinely and maximally entangled five-particle state for efficient information processing. The physical realization of entangled states and information processing protocols are analyzed using quantum gates and circuit diagrams. We show that the direct as well as controlled communication…
The idea of self-testing is to render guarantees concerning the inner workings of a device based on the measurement statistics. It is one of the most formidable quantum certification and benchmarking schemes. Recently it was shown by Coladangelo et. al. (Nat Commun 8, 15485 (2017)) that all pure bipartite entangled states can be self tested in the device independent scenario by employing subspace methods introduced by Yang et. al. (Phys. Rev. A 87, 050102(R)). Here, we have adapted their method to show that any bipartite pure entangled state can be certified in the semi-device independent scen…
We present a quantum secure direct communication protocol where the channels are not maximally entangled states. The communication parties utilize decoy photons to check eavesdropping. After ensuring the security of the quantum channel, the sender encodes the secret message and transmits it to the receiver by using Controlled-NOT operation and von Neumann measurement. The protocol is simple and realizable with present technology. We also show the protocol is secure for noisy quantum channel.
Recently, Harrow et al. [Phys. Rev. Lett. 92, 187901 (2004)] gave a method for preparing an arbitrary quantum state with high success probability by physically transmitting some qubits, and by consuming a maximally entangled state, together with exhausting some shared random bits. In this paper, we discover that some states are impossible to be perfectly prepared by Alice and Bob initially sharing those entangled states that are superposed by the ground states, as the states to be prepared. In particular, we present a sufficient and necessary condition for the states being enabled to be exactl…
Employing the general BXOR operation and local state discrimination, the mixed state of the form ρ^{(k)}_{d}=\frac{1}{d^{2}}\sum_{m,n=0}^{d-1}(|ϕ_{mn}><ϕ_{mn}|)^{\otim es k} is proved to be quasi-pure, where $\{|ϕ_{mn}>\}$ is the canonical set of mutually orthogonal maximally entangled states in $d\times d$. Therefore irreversibility does not occur in the process of distillation for this family of states. Also, the distillable entanglement is calculated explicitly.