Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0612149 · International Journal of Quantum Information

A SUFFICIENT AND NECESSARY CONDITION FOR SUPERDENSE CODING OF QUANTUM STATES

Daowen Qiu

Published Oct 1, 2008• 1 citation
arXivHTMLPDF

Abstract

Recently, Harrow et al. [Phys. Rev. Lett.92 (2004) 187901] 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 some entangled states. In particular, we present a sufficient and necessary condition for the states being enabled to be exactly prepared with probability equal to unity, in terms of the initial entangled states (maybe nonmaximally). In contrast, if the initially shared entanglement is maximal, then the probabilities for preparing these quantum states are smaller than unity. Furthermore, the lower bound on the probability for preparing some states are derived.

DOI
10.1142/s0219749908004298

Related papers

Overcoming a limitation of deterministic dense coding with a nonmaximally entangled initial state

Paul Bourdon, E. Gerjuoy

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 $|\ensuremath{\Psi}\ensuremath{\rangle}$. If $|\ensuremath{\Psi}\ensuremath{\rangle}$ 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 $|\ensuremath{\Psi}\ensuremath{\rangle}$ 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}^{2}\ensuremath{-}1$ messages. Encoding ${d}^{2}\ensuremath{-}2$ messages is possible; see, for example, the numerical studies by Mozes et al. [Phys. Rev. A 71, 012311 (2005)]. Answering a question raised by Wu et al. [Phys. Rev. A 73, 042311 (2006)], we show that when $|\ensuremath{\Psi}\ensuremath{\rangle}$ is not maximally entangled, the communications limit of ${d}^{2}\ensuremath{-}2$ messages persists even when the requirement that Alice encode by unitary operations on her qudit is weakened to allow encoding by more general quantum operators. We then describe a dense-coding protocol that can overcome this limitation with high probability, assuming the largest Schmidt coefficient of $|\ensuremath{\Psi}\ensuremath{\rangle}$ is sufficiently close to $\sqrt{1/d}$. In this protocol, ${d}^{2}\ensuremath{-}2$ of the messages are encoded via unitary operations on Alice's qudit, and the final $({d}^{2}\ensuremath{-}1)$-th message is encoded via a non-trace-preserving quantum operation.

arXiv:0906.0384•Physical Review A•Feb 16, 2010•4 citations

Quantum dense coding using three qubits

Jose Luis Cereceda

We consider a situation in which two parties, Alice and Bob, share a 3-qubit system coupled in an initial maximally entangled, GHZ state. By manipulating locally two of the qubits, Alice can prepare any one of the eight 3-qubit GHZ states. Thus the sending of Alice's two qubits to Bob, entails 3 bits of classical information which can be recovered by Bob by means of a measurement distinguishing the eight (orthonormal) GHZ states. This contrasts with the 2-qubit case, in which Alice can prepare any of the four Bell states by acting locally only on one of the qubits.

arXiv:quant-ph/0105096•May 21, 2001•14 citations

Sharing quantum nonlocality and genuine nonlocality with independent observables

Tinggui Zhang, Shao-Ming Fei

Recently the authors of Phys. Rev. Lett. 125, 090401 (2020) considered the following scenario: Alice and Bob each have half of a pair of entangled qubit states. Bob measures his half and then passes his part to a second Bob who measures again, and so on. The goal is to maximize the number of Bobs that can have an expected violation of the Clauser-Horne-Shimony-Holt (CHSH) inequality with the single Alice. By taking the maximally entangled pure two-qubit state $|\ensuremath{\phi}\ensuremath{\rangle}=\frac{1}{\sqrt{2}}(|00\ensuremath{\rangle}+|11\ensuremath{\rangle})$ as an example, it has been constructively proved that arbitrarily many independent Bobs can share the nonlocality with the single Alice. Here we demonstrate that arbitrarily many independent observers can share the nonlocality of a single arbitrary dimensional bipartite entangled but not necessary two-qubit entangled state. Furthermore, taking the generalized Greenberger-Horne-Zeilinger (GHZ) states as an example, we show that at most two Charlies can share the genuine nonlocality of a single generalized GHZ state with an Alice and a Bob.

arXiv:2103.14836•Physical Review A•Mar 18, 2021•51 citations

Superdense Coding of Quantum States

Aram W. Harrow, Patrick M. Hayden, Debbie Leung

We describe a method for nonobliviously communicating a 2l-qubit quantum state by physically transmitting l+o(l) qubits, and by consuming l ebits of entanglement plus some shared random bits. In the nonoblivious scenario, the sender has a classical description of the state to be communicated. Our method can be used to communicate states that are pure or entangled with the sender's system; l+o(l) and 3l+o(l) shared random bits are sufficient, respectively.

arXiv:quant-ph/0307221•Physical Review Letters•May 4, 2004•183 citations

Semiquantum Key Distribution Using Entangled States

Jian Wang, Sheng Zhang, Quan Zhang +1 more

Recently, Boyer et al. presented a novel semiquantum key distribution protocol [ Phys. Rev. Lett. 99 (2007) 140501 ] by using four quantum states, each of which is randomly prepared in the Z or X basis. Here we present a semi-quantum key distribution protocol by using maximally entangled states in which quantum Alice shares a secret key with classical Bob. Quantum Alice has the ability to prepare Bell states and perform Bell basis or computational basis measurement. Classical Bob is restricted to measuring, preparing a particle in the computational basis, reflecting or reordering the particles. The qubit efficiency of the protocol improves to 50% and the protocol can be modified to a measure-resend protocol or a protocol without quantum memory. We also show that the protocol is secure against eavesdropping.

arXiv:1104.1267•Chinese Physics Letters•Oct 1, 2011•100 citations

Optimal Superdense Coding of Entangled States

A. Abeyesinghe, Patrick M. Hayden, G. Smith +1 more

In this paper, 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$2l$-qubit quantum state could be communicated to a receiver by physically transmitting only$l+o(l)$qubits in addition to consuming$l$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 maximally entangled states and the earlier two-for-one result of the unentangled case, all without the use of any shared randomness. We also present two applications of our result: a direct proof of the achievability of the optimal superdense coding protocol for entangled states produced by a memoryless source, and a demonstration that the quantum identification capacity of an ebit is two qubits.

arXiv:quant-ph/0407061•IEEE Transactions on Information Theory•Jul 26, 2006•33 citations
Recently, Harrow et al. [Phys. Rev. Lett.92 (2004) 187901] 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 some entangled states. In particular, we present a sufficient and necessary condition for the states being enabled to be exactly prepared with probability equal to unity, in terms of the initial entangled states (maybe nonmaximally). In contrast, if the initially shared entanglement is maximal, then the probabilities for preparing these quantum states are smaller than unity. Furthermore, the lower bound on the probability for preparing some states are derived.
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 $|\ensuremath{\Psi}\ensuremath{\rangle}$. If $|\ensuremath{\Psi}\ensuremath{\rangle}$ represents a maximally entangled state (i.e., each of its Schmidt coefficients is 1/d\sqrt{1/d}1/d​), then Alice can convey to Bob one of d2{d}^{2}d2 distinct messages. If $|\ensuremath{\Psi}\ensuremath{\rangle}$ 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}^{2}\ensuremath{-}1$ messages. Encoding ${d}^{2}\ensuremath{-}2$ messages is possible; see, for example, the numerical studies by Mozes et al. [Phys. Rev. A 71, 012311 (2005)]. Answering a question raised by Wu et al. [Phys. Rev. A 73, 042311 (2006)], we show that when $|\ensuremath{\Psi}\ensuremath{\rangle}$ is not maximally entangled, the communications limit of ${d}^{2}\ensuremath{-}2$ messages persists even when the requirement that Alice encode by unitary operations on her qudit is weakened to allow encoding by more general quantum operators. We then describe a dense-coding protocol that can overcome this limitation with high probability, assuming the largest Schmidt coefficient of $|\ensuremath{\Psi}\ensuremath{\rangle}$ is sufficiently close to 1/d\sqrt{1/d}1/d​. In this protocol, ${d}^{2}\ensuremath{-}2$ of the messages are encoded via unitary operations on Alice's qudit, and the final $({d}^{2}\ensuremath{-}1)$-th message is encoded via a non-trace-preserving quantum operation.
We consider a situation in which two parties, Alice and Bob, share a 3-qubit system coupled in an initial maximally entangled, GHZ state. By manipulating locally two of the qubits, Alice can prepare any one of the eight 3-qubit GHZ states. Thus the sending of Alice's two qubits to Bob, entails 3 bits of classical information which can be recovered by Bob by means of a measurement distinguishing the eight (orthonormal) GHZ states. This contrasts with the 2-qubit case, in which Alice can prepare any of the four Bell states by acting locally only on one of the qubits.
Recently the authors of Phys. Rev. Lett. 125, 090401 (2020) considered the following scenario: Alice and Bob each have half of a pair of entangled qubit states. Bob measures his half and then passes his part to a second Bob who measures again, and so on. The goal is to maximize the number of Bobs that can have an expected violation of the Clauser-Horne-Shimony-Holt (CHSH) inequality with the single Alice. By taking the maximally entangled pure two-qubit state $|\ensuremath{\phi}\ensuremath{\rangle}=\frac{1}{\sqrt{2}}(|00\ensuremath{\rangle}+|11\ensuremath{\rangle})$ as an example, it has been constructively proved that arbitrarily many independent Bobs can share the nonlocality with the single Alice. Here we demonstrate that arbitrarily many independent observers can share the nonlocality of a single arbitrary dimensional bipartite entangled but not necessary two-qubit entangled state. Furthermore, taking the generalized Greenberger-Horne-Zeilinger (GHZ) states as an example, we show that at most two Charlies can share the genuine nonlocality of a single generalized GHZ state with an Alice and a Bob.
Recently, Boyer et al. presented a novel semiquantum key distribution protocol [ Phys. Rev. Lett. 99 (2007) 140501 ] by using four quantum states, each of which is randomly prepared in the Z or X basis. Here we present a semi-quantum key distribution protocol by using maximally entangled states in which quantum Alice shares a secret key with classical Bob. Quantum Alice has the ability to prepare Bell states and perform Bell basis or computational basis measurement. Classical Bob is restricted to measuring, preparing a particle in the computational basis, reflecting or reordering the particles. The qubit efficiency of the protocol improves to 50% and the protocol can be modified to a measure-resend protocol or a protocol without quantum memory. We also show that the protocol is secure against eavesdropping.
In this paper, 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 a2l2l2l-qubit quantum state could be communicated to a receiver by physically transmitting onlyl+o(l)l+o(l)l+o(l)qubits in addition to consuminglllebits 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 maximally entangled states and the earlier two-for-one result of the unentangled case, all without the use of any shared randomness. We also present two applications of our result: a direct proof of the achievability of the optimal superdense coding protocol for entangled states produced by a memoryless source, and a demonstration that the quantum identification capacity of an ebit is two qubits.