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

"Uncertainty relation" for superdense coding

Patrick J. Coles

Published Aug 7, 2013• 0 citations
OpenAlex

Abstract

The complementarity of two observables is often captured in uncertainty relations, which quantify an inevitable tradeoff in knowledge. Here we study complementarity in the context of an information processing task: we link the complementarity of two observables to their usefulness for superdense coding (SDC). In SDC, Alice sends two classical dits of information to Bob by sending a single qudit. However, we show that encoding with commuting unitaries prevents Alice from sending more than one dit per qudit, implying that complementarity is necessary for SDC to be advantagous over a classical strategy for information transmission. When Alice encodes with products of Pauli operators for the $X$ and $Z$ bases, we quantify the complementarity of these encodings in terms of the overlap of the $X$ and $Z$ basis elements. Our main result explicitly solves for the SDC capacity as a function of the complementarity, showing that the entropy of the overlap matrix gives the capacity, when the preshared state is maximally entangled. We generalise this equation to resources with symmetric noise such as a preshared Werner state. In the most general case of arbitrary noisy resources, we obtain an analogous lower bound on the SDC capacity. Our results shed light on the role of complementarity in determining the quantum advantage in SDC and also seem fundamentally interesting since they bear a striking resemblance to uncertainty relations.

Related papers

Role of complementarity in superdense coding

Patrick J. Coles

The complementarity of two observables is often captured in uncertainty relations, which quantify an inevitable trade-off in knowledge. Here we study complementarity in the context of an information-processing task: we link the complementarity of two observables to their usefulness for superdense coding (SDC). In SDC, Alice sends two classical dits of information to Bob by sending a single qudit. However, we show that encoding with commuting unitaries prevents Alice from sending more than one dit per qudit, implying that complementarity is necessary for SDC to be advantageous over a classical strategy for information transmission. When Alice encodes with products of Pauli operators for the $X$ and $Z$ bases, we quantify the complementarity of these encodings in terms of the overlap of the $X$ and $Z$ basis elements. Our main result explicitly solves for the SDC capacity as a function of the complementarity, showing that the entropy of the overlap matrix gives the capacity, when the preshared state is maximally entangled. We generalize this equation to resources with symmetric noise such as a preshared Werner state. In the most general case of arbitrary noisy resources, we obtain an analogous lower bound on the SDC capacity. Our results shed light on the role of complementarity in determining the quantum advantage in SDC and also seem fundamentally interesting since they bear a striking resemblance to uncertainty relations.

arXiv:1308.1511•Physical Review A•Dec 12, 2013•5 citations

Complementarity in Quantum Information Processing Tasks

Jaya Chaubey, Sourav Chatterjee, Indranil Chakrabarty

Complementarity have been an intriguing feature of physical systems for a long time. In this work we establish a new kind of complimentary relations in the frame work of quantum information processing tasks. In broadcasting of entanglement we create many pairs of less entangled states from a given entangled state both by local and non local cloning operations. These entangled states can be used in various information processing tasks like teleportation and superdense coding. Since these states are less entangled states it is quite intuitive that these states are not going to be as powerful resource as the initial states. In this work we study the usefulness of these states in tasks like teleportation and super dense coding. More precisely, we found out bounds of their capabilities in terms of several complimentary relations involving fidelity of broadcasting. In principle we have considered general mixed as a resource also separately providing different examples like a) Werner like states, b) Bell diagonal states. Here we have used both local and non local cloning operations as means of broadcasting. In the later part of our work, we extend this result by obtaining bounds in form of complimentary relations in a situation where we have used $1-N$ cloning transformations instead of $1-2$ cloning transformations.

arXiv:1608.00847•Aug 2, 2016•0 citations

Optimal superdense coding capacity in the non-Markovian regime

Y. Aiache, Saif M. Al-Kuwari, K. El Anouz +1 more

Abstract Superdense coding (SDC) is a significant technique widely used in quantum information processing. Indeed, it consists of sending two bits of classical information using a single qubit, leading to faster and more efficient quantum communication. In this paper, we propose a model to evaluate the effect of backflow information in a SDC protocol through a non-Markovian dynamics. The model considers a qubit interacting with a structured Markovian environment. In order to generate a non-Markovian dynamic, an auxiliary qubit contacts a Markovian reservoir in such a way that the non-Markovian regime can be induced. By varying the coupling strength between the central qubit and the auxiliary qubit, the two dynamical regimes can be switched interchangeably. An enhancement in non-Markovian effects corresponds to an increase in this coupling strength. Furthermore, we conduct an examination of various parameters, namely temperature weight, and decoherence parameters in order to explore the behaviors of SDC, quantum fisher information (QFI), and local quantum uncertainty using an exact calculation. The obtained results show a significant relationship between non-classical correlations and QFI since they behave similarly, allowing them to detect what is beyond entanglement. In addition, the presence of non-classical correlations enables us to detect the optimal SDC capacity in a non-Markovian regime.

arXiv:2408.10842•Journal of Physics A Mathematical and Theoretical•Apr 19, 2024•4 citations

Rigidity of Superdense Coding

Ashwin Nayak, Henry Yuen

The famous superdense coding protocol of Bennett and Wiesner demonstrates that it is possible to communicate two bits of classical information by sending only one qubit and using a shared EPR pair. Our first result is that an arbitrary protocol for achieving this task (where there are no assumptions on the sender’s encoding operations or the dimension of the shared entangled state) is locally equivalent to the canonical Bennett-Wiesner protocol. In other words, the superdense coding task is rigid . In particular, we show that the sender and receiver only use additional entanglement (beyond the EPR pair) as a source of classical randomness. We also investigate several questions about higher-dimensional superdense coding, where the goal is to communicate one of d 2 possible messages by sending a d -dimensional quantum state, for general dimensions d . Unlike the d =2 case (i.e., sending a single qubit), there can be inequivalent superdense coding protocols for higher d . We present concrete constructions of inequivalent protocols, based on constructions of inequivalent orthogonal unitary bases for all d > 2. Finally, we analyze the performance of superdense coding protocols where the encoding operators are independently sampled from the Haar measure on the unitary group. Our analysis involves bounding the distinguishability of random maximally entangled states, which may be of independent interest.

arXiv:2012.01672•ACM Transactions on Quantum Computing•May 2, 2023•7 citations

Classical information capacity of superdense coding

Garry Bowen

Classical communication through quantum channels may be enhanced by sharing entanglement. Superdense coding allows the encoding, and transmission, of up to two classical bits of information in a single qubit. In this paper, the maximum classical channel capacity for states that are not maximally entangled is derived. Particular schemes are then shown to attain this capacity, first for pairs of qubits, and second for pairs of qutrits.

arXiv:quant-ph/0101117•Physical Review A•Jan 10, 2001•91 citations

Experimental demonstration of efficient superdense coding in the presence of non-Markovian noise

Bi‐Heng Liu, Xiao‐Min Hu, Yun‐Feng Huang +7 more

Many quantum information tasks rely on entanglement, which is used as a resource, for example, to enable efficient and secure communication. Typically, noise, accompanied by loss of entanglement, reduces the efficiency of quantum protocols. We demonstrate experimentally a superdense coding scheme with noise, where the decrease of entanglement in Alice's encoding state does not reduce the efficiency of the information transmission. Having almost fully dephased classical two-photon polarization state at the time of encoding, we reach values of mutual information close to 1.52 (1.89) with 3-state (4-state) encoding. This high efficiency relies both on non-Markovian features, that Bob exploits just before his Bell-state measurement, and on very high visibility (99.6$\%$) of the Hong-Ou-Mandel interference within the experimental set-up. Our proof-of-principle results pave the way for exploiting non-Markovianity to improve the efficiency and security of quantum information processing tasks.

•Apr 28, 2015•2 citations
The complementarity of two observables is often captured in uncertainty relations, which quantify an inevitable tradeoff in knowledge. Here we study complementarity in the context of an information processing task: we link the complementarity of two observables to their usefulness for superdense coding (SDC). In SDC, Alice sends two classical dits of information to Bob by sending a single qudit. However, we show that encoding with commuting unitaries prevents Alice from sending more than one dit per qudit, implying that complementarity is necessary for SDC to be advantagous over a classical strategy for information transmission. When Alice encodes with products of Pauli operators for the XXX and ZZZ bases, we quantify the complementarity of these encodings in terms of the overlap of the XXX and ZZZ basis elements. Our main result explicitly solves for the SDC capacity as a function of the complementarity, showing that the entropy of the overlap matrix gives the capacity, when the preshared state is maximally entangled. We generalise this equation to resources with symmetric noise such as a preshared Werner state. In the most general case of arbitrary noisy resources, we obtain an analogous lower bound on the SDC capacity. Our results shed light on the role of complementarity in determining the quantum advantage in SDC and also seem fundamentally interesting since they bear a striking resemblance to uncertainty relations.
The complementarity of two observables is often captured in uncertainty relations, which quantify an inevitable trade-off in knowledge. Here we study complementarity in the context of an information-processing task: we link the complementarity of two observables to their usefulness for superdense coding (SDC). In SDC, Alice sends two classical dits of information to Bob by sending a single qudit. However, we show that encoding with commuting unitaries prevents Alice from sending more than one dit per qudit, implying that complementarity is necessary for SDC to be advantageous over a classical strategy for information transmission. When Alice encodes with products of Pauli operators for the XXX and ZZZ bases, we quantify the complementarity of these encodings in terms of the overlap of the XXX and ZZZ basis elements. Our main result explicitly solves for the SDC capacity as a function of the complementarity, showing that the entropy of the overlap matrix gives the capacity, when the preshared state is maximally entangled. We generalize this equation to resources with symmetric noise such as a preshared Werner state. In the most general case of arbitrary noisy resources, we obtain an analogous lower bound on the SDC capacity. Our results shed light on the role of complementarity in determining the quantum advantage in SDC and also seem fundamentally interesting since they bear a striking resemblance to uncertainty relations.
Complementarity have been an intriguing feature of physical systems for a long time. In this work we establish a new kind of complimentary relations in the frame work of quantum information processing tasks. In broadcasting of entanglement we create many pairs of less entangled states from a given entangled state both by local and non local cloning operations. These entangled states can be used in various information processing tasks like teleportation and superdense coding. Since these states are less entangled states it is quite intuitive that these states are not going to be as powerful resource as the initial states. In this work we study the usefulness of these states in tasks like teleportation and super dense coding. More precisely, we found out bounds of their capabilities in terms of several complimentary relations involving fidelity of broadcasting. In principle we have considered general mixed as a resource also separately providing different examples like a) Werner like states, b) Bell diagonal states. Here we have used both local and non local cloning operations as means of broadcasting. In the later part of our work, we extend this result by obtaining bounds in form of complimentary relations in a situation where we have used 1−N1-N1−N cloning transformations instead of 1−21-21−2 cloning transformations.
Abstract Superdense coding (SDC) is a significant technique widely used in quantum information processing. Indeed, it consists of sending two bits of classical information using a single qubit, leading to faster and more efficient quantum communication. In this paper, we propose a model to evaluate the effect of backflow information in a SDC protocol through a non-Markovian dynamics. The model considers a qubit interacting with a structured Markovian environment. In order to generate a non-Markovian dynamic, an auxiliary qubit contacts a Markovian reservoir in such a way that the non-Markovian regime can be induced. By varying the coupling strength between the central qubit and the auxiliary qubit, the two dynamical regimes can be switched interchangeably. An enhancement in non-Markovian effects corresponds to an increase in this coupling strength. Furthermore, we conduct an examination of various parameters, namely temperature weight, and decoherence parameters in order to explore the behaviors of SDC, quantum fisher information (QFI), and local quantum uncertainty using an exact calculation. The obtained results show a significant relationship between non-classical correlations and QFI since they behave similarly, allowing them to detect what is beyond entanglement. In addition, the presence of non-classical correlations enables us to detect the optimal SDC capacity in a non-Markovian regime.
The famous superdense coding protocol of Bennett and Wiesner demonstrates that it is possible to communicate two bits of classical information by sending only one qubit and using a shared EPR pair. Our first result is that an arbitrary protocol for achieving this task (where there are no assumptions on the sender’s encoding operations or the dimension of the shared entangled state) is locally equivalent to the canonical Bennett-Wiesner protocol. In other words, the superdense coding task is rigid . In particular, we show that the sender and receiver only use additional entanglement (beyond the EPR pair) as a source of classical randomness. We also investigate several questions about higher-dimensional superdense coding, where the goal is to communicate one of d 2 possible messages by sending a d -dimensional quantum state, for general dimensions d . Unlike the d =2 case (i.e., sending a single qubit), there can be inequivalent superdense coding protocols for higher d . We present concrete constructions of inequivalent protocols, based on constructions of inequivalent orthogonal unitary bases for all d > 2. Finally, we analyze the performance of superdense coding protocols where the encoding operators are independently sampled from the Haar measure on the unitary group. Our analysis involves bounding the distinguishability of random maximally entangled states, which may be of independent interest.
Many quantum information tasks rely on entanglement, which is used as a resource, for example, to enable efficient and secure communication. Typically, noise, accompanied by loss of entanglement, reduces the efficiency of quantum protocols. We demonstrate experimentally a superdense coding scheme with noise, where the decrease of entanglement in Alice's encoding state does not reduce the efficiency of the information transmission. Having almost fully dephased classical two-photon polarization state at the time of encoding, we reach values of mutual information close to 1.52 (1.89) with 3-state (4-state) encoding. This high efficiency relies both on non-Markovian features, that Bob exploits just before his Bell-state measurement, and on very high visibility (99.6%\%%) of the Hong-Ou-Mandel interference within the experimental set-up. Our proof-of-principle results pave the way for exploiting non-Markovianity to improve the efficiency and security of quantum information processing tasks.