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

Universal Journal of Physics and Application

Challenges of Superdense Coding with Accelerated Fermions

Mehrnoosh Farahmand, Hosein Mohammadzadeh

Published Oct 1, 2017• 0 citations
Publisher

Abstract

Two particles, even being far from each other have quantum correlation as a result of the existence of entanglement between them. Therefore, information can be shared by entangled particles, sitting in separate places. Superdense coding is one of the quantum protocols that rely on entanglement. In this paper, we review superdense coding with a non-inertial observer in the beyond single mode approximation and investigate the probability of success for superdense coding. We analyze the mutual information due to the effects of acceleration on the quantum and classical correlations of the state. Entanglement behavior is studied considering an entanglement measure the so-called the concurrence. Comparing the mutual information and the concurrence with the probability of superdense coding is shown that quantities have different behaviors, particularly, when the beyond single mode approximation plays a powerful role.

DOI
10.13189/ujpa.2017.110501

Related papers

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

Semi-device-independent certification of entanglement in superdense coding

George Moreno, Ranieri Nery, Carlos de Gois +2 more

Superdense coding is a paradigmatic protocol in quantum information science, employing a quantum communication channel to send classical information more efficiently. As we show here, it can be understood as a particular case of a prepare and measure experiment, a scenario that has attracted growing attention for its fundamental and practical applications. Formulating superdense coding as a prepare and measure scenario allows us to provide a semi-device-independent witness of entanglement that significantly improves over previous tests. Furthermore, we also show how to adapt our results into self-testing of maximally entangled states and also provide a semidefinite program formulation allowing one to efficiently optimize, for any shared quantum state, the probability of success in the superdense coding protocol.

arXiv:2102.02709•Physical Review A•Feb 25, 2021•29 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•6 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

Quantum Two-Way Protocol Beyond Superdense Coding: Joint Transfer of Data and Entanglement

Kristian Skafte Jensen, Lorenzo Valentini, René Bødker Christensen +2 more

We introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs. The proposed protocol jointly addresses the provision of entangled pairs and superdense coding, introducing an integrated approach for managing entanglement within the communication protocol. To assess the performance of the proposed protocol, we consider its data rate and resource usage, and we analyse this both in an ideal setting with no decoherence, and in a more realistic setting where decoherence must be taken into account. In the ideal case, the proposal offers a 50% increase in both data rate and resource usage efficiency compared to conventional protocols. Even when decoherence is taken into consideration, the quantum protocol performs better as long as the decoherence time is not extremely short. Finally, we present the results of implementing the protocol in a computer simulation based on the Netsquid framework. We compare the simulation results with the theoretical values.

arXiv:2309.02837•IEEE Transactions on Quantum Engineering•Jan 1, 2025•9 citations

Probabilistic superdense coding

Arun Kumar Pati, Preeti Parashar, Pankaj Agrawal

We explore the possibility of performing superdense coding with nonmaximally entangled states as a resource. Using this we find that one can send two classical bits in a probabilistic manner by sending a qubit. We generalize our scheme to higher dimensions and show that one can communicate $2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{2}d$ classical bits by sending a $d$-dimensional quantum state with a certain probability of success. The success probability in superdense coding is related to the success probability of distinguishing nonorthogonal states. The optimal average success probabilities are explicitly calculated. We consider the possibility of sending $2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{2}d$ classical bits with a shared resource of a higher dimensional entangled state $(D\ifmmode\times\else\texttimes\fi{}D,D>d)$. It is found that more entanglement does not necessarily lead to higher success probability. This also answers the question as to why we need ${\mathrm{log}}_{2}d$ ebits to send $2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{2}d$ classical bits in a deterministic fashion.

arXiv:quant-ph/0412039•Physical Review A•Jul 22, 2005•99 citations
Two particles, even being far from each other have quantum correlation as a result of the existence of entanglement between them. Therefore, information can be shared by entangled particles, sitting in separate places. Superdense coding is one of the quantum protocols that rely on entanglement. In this paper, we review superdense coding with a non-inertial observer in the beyond single mode approximation and investigate the probability of success for superdense coding. We analyze the mutual information due to the effects of acceleration on the quantum and classical correlations of the state. Entanglement behavior is studied considering an entanglement measure the so-called the concurrence. Comparing the mutual information and the concurrence with the probability of superdense coding is shown that quantities have different behaviors, particularly, when the beyond single mode approximation plays a powerful role.
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.
Superdense coding is a paradigmatic protocol in quantum information science, employing a quantum communication channel to send classical information more efficiently. As we show here, it can be understood as a particular case of a prepare and measure experiment, a scenario that has attracted growing attention for its fundamental and practical applications. Formulating superdense coding as a prepare and measure scenario allows us to provide a semi-device-independent witness of entanglement that significantly improves over previous tests. Furthermore, we also show how to adapt our results into self-testing of maximally entangled states and also provide a semidefinite program formulation allowing one to efficiently optimize, for any shared quantum state, the probability of success in the superdense coding protocol.
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.
We introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs. The proposed protocol jointly addresses the provision of entangled pairs and superdense coding, introducing an integrated approach for managing entanglement within the communication protocol. To assess the performance of the proposed protocol, we consider its data rate and resource usage, and we analyse this both in an ideal setting with no decoherence, and in a more realistic setting where decoherence must be taken into account. In the ideal case, the proposal offers a 50% increase in both data rate and resource usage efficiency compared to conventional protocols. Even when decoherence is taken into consideration, the quantum protocol performs better as long as the decoherence time is not extremely short. Finally, we present the results of implementing the protocol in a computer simulation based on the Netsquid framework. We compare the simulation results with the theoretical values.
We explore the possibility of performing superdense coding with nonmaximally entangled states as a resource. Using this we find that one can send two classical bits in a probabilistic manner by sending a qubit. We generalize our scheme to higher dimensions and show that one can communicate 2log2d2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{2}d2log2​d classical bits by sending a ddd-dimensional quantum state with a certain probability of success. The success probability in superdense coding is related to the success probability of distinguishing nonorthogonal states. The optimal average success probabilities are explicitly calculated. We consider the possibility of sending 2log2d2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{2}d2log2​d classical bits with a shared resource of a higher dimensional entangled state $(D\ifmmode\times\else\texttimes\fi{}D,D>d)$. It is found that more entanglement does not necessarily lead to higher success probability. This also answers the question as to why we need log2d{\mathrm{log}}_{2}dlog2​d ebits to send 2log2d2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{2}d2log2​d classical bits in a deterministic fashion.