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:2310.20688 · Physical Review A

Dimensional advantage in secure information trading via the noisy dense-coding protocol

Ayan Patra, Rivu Gupta, Tamoghna Das, Aditi Sen

Published Sep 16, 2024• 7 citations
arXivHTMLPDF

Abstract

The quantum dense-coding (DC) protocol, which has no security feature, deals with the transmission of classical information encoded in a quantum state by using shared entanglement between a single sender and a single receiver. Its appropriate variant has been established as a quantum key distribution (QKD) scheme for shared two-qubit maximally entangled states, with the security proof utilizing the uncertainty relation of complementary observables and the Shor-Preskill entanglement purification scheme. We present the DC-based QKD protocol for higher-dimensional systems and report the lower bounds on the secret key rate, when the shared state is a two-qudit maximally entangled state, and mixtures of maximally entangled states with different ranks. The analysis also includes the impact of noisy channels on the secure key rates, before and after encoding. In both the noiseless and the noisy scenarios, we demonstrate that the key rate as well as the robustness of the protocol against noise increases with the dimension. Further, we prove that the set of useless states in the DC-based QKD protocol is convex and compact.

DOI
10.1103/physreva.110.032419

Related papers

Noise adaptive two-way secure deterministic quantum key distribution

Abinash Kar, Ayan Patra, Aditi Sen De +1 more

We introduce noise-adaptive quantum key distribution (QKD) protocols, in which the honest parties optimize the encoding (state preparation) and decoding (measurement basis) operations according to the noise models affecting the honest subsystems induced by an eavesdropper. This extends conventional QKD schemes that employ fixed encoding and decoding strategies independent of the noise characteristics of the communication channel. We investigate three representative protocols: entanglement-based secure dense coding (SDC), the entanglement-free Lucamarini and Mancini (LM05), and a two-way prepare-and-measure Bennett Brassard (BB84) protocols. Using entropic uncertainty relations, we derive the corresponding secret key rates for both adaptive and conventional non-adaptive scenarios under collective attacks. For independent but identical noise acting on the forward and backward transmission channels, as well as for correlated and non-Markovian environments, we identify classes of channels for which adaptive schemes yield enhanced secret key rates for the considered protocols. In contrast, we also determine Pauli channels, including depolarizing and bit flip channels, for which adaptive strategies provide no benefit. We further show that these optimal sets are generally non-unique and can differ substantially from the unitaries that maximize dense-coding capacity in the absence of security constraints. Our results establish noise-adaptive encoding and decoding as a powerful framework for improving secure communication over realistic noisy quantum channels.

quant-pharXiv:2605.27902•May 28, 2026•0 citations

Superdense Coding Using Higher Dimensional Embedding

Elio Thadhani, Sharjeel Ahmad, Hussain Ali Razvi +2 more

Quantum dense coding is a foundational protocol in quantum communication, allowing two classical bits to be transmitted by sending a single qubit when a maximally entangled pair is shared. In this work, we consider Embedded Dense Coding (EDC)-a generalization of deterministic dense coding that embeds one subsystem into a higher-dimensional Hilbert space. To assess the operational advantage of EDC compared to standard dense coding, we consider the probability of transmission error when fixing the rate of entanglement consumed per classical message sent. We first demonstrate that EDC enables a smaller one-shot transmission error compared to standard dense coding when using quantum channels with nonzero rates of dephasing and loss. We then demonstrate that even with noiseless communication channels, EDC leads to smaller overall errors when the sender and receiver have noisy local processors. This advantage is shown through concrete implementations of EDC on IBM's Heron processor.

Entropy•Apr 1, 2026•0 citations

Distributed quantum dense coding with two receivers in noisy environments

Tamoghna Das, R. Prabhu, Aditi Sen +1 more

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 the 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, both in the noiseless and the noisy scenarios. Specifically, we find that, in the case of multiple senders and two receivers, the corresponding generalized Greenberger-Horne-Zeilinger states possess higher dense coding capacities as compared to a significant fraction of pure states having the same multipartite entanglement.

arXiv:1412.6247•Physical Review A•Nov 24, 2015•31 citations

Deterministic Quantum Dense Coding Based on Non-Maximal Entangled Channel

Xuanxuan Xin, Zhixing Li, Zhen Wang

In quantum communication, the concept of dense coding traditionally relies on maximally entangled states as quantum channels. Recent advancements have expanded this framework to include non-maximally entangled states within the probabilistic dense coding paradigm. However, such schemes introduce a significant limitation: the receiver cannot always retrieve the complete dense coding information sent by the sender. Consequently, the receiver must inform the sender of the amount of information successfully received. Based on this feedback, the sender determines whether retransmission is necessary, leading to inefficient use of the quantum channel and reduced communication efficiency. To address these shortcomings, we propose an alternative deterministic quantum dense coding scheme that utilizes non-maximally entangled states as the quantum channel. This deterministic approach eliminates the need for retransmissions and significantly enhances communication efficiency while maintaining compatibility with non-maximally entangled states. Our scheme represents a substantial improvement over existing probabilistic methods and paves the way for more efficient quantum communication protocols.

Entropy•Jan 22, 2025•1 citation

Enhancing Dense Coding Reliability under Noisy Quantum Channels Through Redundancy Strategies

Krishna Madhav Nukala, Dadinaboina A. K.Rao, N. Nagasoudhamani +3 more

Quantum dense coding enables the transmission of two classical bits of information through the exchange of a single qubit, provided that an entangled state is shared between the communicating parties. While this protocol achieves a fundamental increase in channel capacity, its practical realization is strongly influenced by the presence of noise in realistic quantum channels. This work presents a simulation-based study of dense coding performance under two representative noise models: the depolarizing channel and the amplitude damping channel. Using Qiskit Aer, the bit error rate (BER), frame error rate (FER), and effective channel capacity are evaluated across a range of noise parameters. In addition, a classical threefold repetition strategy is examined as a lightweight error-mitigation technique. Results indicate that depolarizing noise produces more rapid degradation in both BER and channel capacity compared to amplitude damping, while repetition coding provides partial improvement in reliability at the expense of resource overhead. These findings highlight the trade-offs between efficiency and robustness in noisy implementations of dense coding and motivate further exploration of more advanced quantum error correction methods.

International Conference on Ubiquitous Computing and Intelligent Information Systems (ICUIS)•Nov 26, 2025•1 citation

Experimentally feasible quantum-key-distribution scheme using qubit-like qudits and its comparison with existing qubit- and qudit-based protocols

H. F. Chau, Qinan Wang, Cardythy Wong

Recently, Chau [Phys. Rev. A 92, 062324 (2015)] introduced an experimentally feasible qudit-based quantum-key-distribution (QKD) scheme. In that scheme, one bit of information is phase encoded in the prepared state in a ${2}^{n}$-dimensional Hilbert space in the form $(|i\ensuremath{\rangle}\ifmmode\pm\else\textpm\fi{}|j\ensuremath{\rangle})/\sqrt{2}$ with $n\ensuremath{\ge}2$. For each qudit prepared and measured in the same two-dimensional Hilbert subspace, one bit of raw secret key is obtained in the absence of transmission error. Here we show that by modifying the basis announcement procedure, the same experimental setup can generate $n$ bits of raw key for each qudit prepared and measured in the same basis in the noiseless situation. The reason is that in addition to the phase information, each qudit also carries information on the Hilbert subspace used. The additional $(n\ensuremath{-}1)$ bits of raw key comes from a clever utilization of this extra piece of information. We prove the unconditional security of this modified protocol and compare its performance with other existing provably secure qubit- and qudit-based protocols on market in the one-way classical communication setting. Interestingly, we find that for the case of $n=2$, the secret key rate of this modified protocol using nondegenerate random quantum code to perform one-way entanglement distillation is equal to that of the six-state scheme.

arXiv:1603.02370•Physical Review A•Feb 7, 2017•7 citations
The quantum dense-coding (DC) protocol, which has no security feature, deals with the transmission of classical information encoded in a quantum state by using shared entanglement between a single sender and a single receiver. Its appropriate variant has been established as a quantum key distribution (QKD) scheme for shared two-qubit maximally entangled states, with the security proof utilizing the uncertainty relation of complementary observables and the Shor-Preskill entanglement purification scheme. We present the DC-based QKD protocol for higher-dimensional systems and report the lower bounds on the secret key rate, when the shared state is a two-qudit maximally entangled state, and mixtures of maximally entangled states with different ranks. The analysis also includes the impact of noisy channels on the secure key rates, before and after encoding. In both the noiseless and the noisy scenarios, we demonstrate that the key rate as well as the robustness of the protocol against noise increases with the dimension. Further, we prove that the set of useless states in the DC-based QKD protocol is convex and compact.
We introduce noise-adaptive quantum key distribution (QKD) protocols, in which the honest parties optimize the encoding (state preparation) and decoding (measurement basis) operations according to the noise models affecting the honest subsystems induced by an eavesdropper. This extends conventional QKD schemes that employ fixed encoding and decoding strategies independent of the noise characteristics of the communication channel. We investigate three representative protocols: entanglement-based secure dense coding (SDC), the entanglement-free Lucamarini and Mancini (LM05), and a two-way prepare-and-measure Bennett Brassard (BB84) protocols. Using entropic uncertainty relations, we derive the corresponding secret key rates for both adaptive and conventional non-adaptive scenarios under collective attacks. For independent but identical noise acting on the forward and backward transmission channels, as well as for correlated and non-Markovian environments, we identify classes of channels for which adaptive schemes yield enhanced secret key rates for the considered protocols. In contrast, we also determine Pauli channels, including depolarizing and bit flip channels, for which adaptive strategies provide no benefit. We further show that these optimal sets are generally non-unique and can differ substantially from the unitaries that maximize dense-coding capacity in the absence of security constraints. Our results establish noise-adaptive encoding and decoding as a powerful framework for improving secure communication over realistic noisy quantum channels.
Quantum dense coding is a foundational protocol in quantum communication, allowing two classical bits to be transmitted by sending a single qubit when a maximally entangled pair is shared. In this work, we consider Embedded Dense Coding (EDC)-a generalization of deterministic dense coding that embeds one subsystem into a higher-dimensional Hilbert space. To assess the operational advantage of EDC compared to standard dense coding, we consider the probability of transmission error when fixing the rate of entanglement consumed per classical message sent. We first demonstrate that EDC enables a smaller one-shot transmission error compared to standard dense coding when using quantum channels with nonzero rates of dephasing and loss. We then demonstrate that even with noiseless communication channels, EDC leads to smaller overall errors when the sender and receiver have noisy local processors. This advantage is shown through concrete implementations of EDC on IBM's Heron processor.
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 the 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, both in the noiseless and the noisy scenarios. Specifically, we find that, in the case of multiple senders and two receivers, the corresponding generalized Greenberger-Horne-Zeilinger states possess higher dense coding capacities as compared to a significant fraction of pure states having the same multipartite entanglement.
In quantum communication, the concept of dense coding traditionally relies on maximally entangled states as quantum channels. Recent advancements have expanded this framework to include non-maximally entangled states within the probabilistic dense coding paradigm. However, such schemes introduce a significant limitation: the receiver cannot always retrieve the complete dense coding information sent by the sender. Consequently, the receiver must inform the sender of the amount of information successfully received. Based on this feedback, the sender determines whether retransmission is necessary, leading to inefficient use of the quantum channel and reduced communication efficiency. To address these shortcomings, we propose an alternative deterministic quantum dense coding scheme that utilizes non-maximally entangled states as the quantum channel. This deterministic approach eliminates the need for retransmissions and significantly enhances communication efficiency while maintaining compatibility with non-maximally entangled states. Our scheme represents a substantial improvement over existing probabilistic methods and paves the way for more efficient quantum communication protocols.
Quantum dense coding enables the transmission of two classical bits of information through the exchange of a single qubit, provided that an entangled state is shared between the communicating parties. While this protocol achieves a fundamental increase in channel capacity, its practical realization is strongly influenced by the presence of noise in realistic quantum channels. This work presents a simulation-based study of dense coding performance under two representative noise models: the depolarizing channel and the amplitude damping channel. Using Qiskit Aer, the bit error rate (BER), frame error rate (FER), and effective channel capacity are evaluated across a range of noise parameters. In addition, a classical threefold repetition strategy is examined as a lightweight error-mitigation technique. Results indicate that depolarizing noise produces more rapid degradation in both BER and channel capacity compared to amplitude damping, while repetition coding provides partial improvement in reliability at the expense of resource overhead. These findings highlight the trade-offs between efficiency and robustness in noisy implementations of dense coding and motivate further exploration of more advanced quantum error correction methods.
Recently, Chau [Phys. Rev. A 92, 062324 (2015)] introduced an experimentally feasible qudit-based quantum-key-distribution (QKD) scheme. In that scheme, one bit of information is phase encoded in the prepared state in a 2n{2}^{n}2n-dimensional Hilbert space in the form $(|i\ensuremath{\rangle}\ifmmode\pm\else\textpm\fi{}|j\ensuremath{\rangle})/\sqrt{2}$ with $n\ensuremath{\ge}2$. For each qudit prepared and measured in the same two-dimensional Hilbert subspace, one bit of raw secret key is obtained in the absence of transmission error. Here we show that by modifying the basis announcement procedure, the same experimental setup can generate nnn bits of raw key for each qudit prepared and measured in the same basis in the noiseless situation. The reason is that in addition to the phase information, each qudit also carries information on the Hilbert subspace used. The additional $(n\ensuremath{-}1)$ bits of raw key comes from a clever utilization of this extra piece of information. We prove the unconditional security of this modified protocol and compare its performance with other existing provably secure qubit- and qudit-based protocols on market in the one-way classical communication setting. Interestingly, we find that for the case of n=2n=2n=2, the secret key rate of this modified protocol using nondegenerate random quantum code to perform one-way entanglement distillation is equal to that of the six-state scheme.