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

Entropy

Deterministic Quantum Dense Coding Based on Non-Maximal Entangled Channel

Xuanxuan Xin, Zhixing Li, Zhen Wang

Published Jan 22, 2025• 1 citation
Publisher

Abstract

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.

DOI
10.3390/e27020104

Related papers

Probabilistic Error-Corrected Controlled Dense Coding Under Bit-Flip Channels via Auxiliary Particles and Partially Entangled States

Zitong Diao, Jie Tang, Zhaoqi Lei +4 more

Quantum dense coding could be used to transmit two classical bits with one qubit when a maximally entangled state is shared. In realistic channels, entanglement degradation reduces the channel capacity, while bit-flip noise increases decoding errors. To address these issues, we propose a novel probabilistic controlled dense coding protocol that employs the three-qubit repetition code for error correction and an auxiliary qubit for probabilistic decoding. Moreover, this proposed scheme includes a third party to supervise the communication based on a three-qubit entanglement state. The implementation steps of our protocol are presented in detail, and numerical simulations show that it achieves higher average information than dense coding without error correction. The scheme provides a robust solution for quantum communication under noisy conditions and non-maximally entangled state.

Entropy•Jul 8, 2026•0 citations

Nontraditional Deterministic Remote State Preparation Using a Non-Maximally Entangled Channel without Additional Quantum Resources

Xuanxuan Xin, Shiwen He, Yongxing Li +1 more

In this paper, we have reinvestigated probabilistic quantum communication protocols and developed a nontraditional remote state preparation protocol that allows for deterministically transferring information encoded in quantum states using a non-maximally entangled channel. With an auxiliary particle and a simple measurement method, the success probability of preparing a d-dimensional quantum state is increased to 1 without spending additional quantum resources in advance to improve quantum channels, such as entanglement purification. Furthermore, we have designed a feasible experimental scheme to demonstrate the deterministic paradigm of transporting a polarization-encoded photon from one location to another using a generalized entangled state. This approach provides a practical method to address decoherence and environmental noises in actual quantum communication.

arXiv:2203.08474•Entropy•May 8, 2023•0 citations

Controlled dense coding using three-particle in non-symmetric quantum state

Chengxia Zhang

A scheme of controlled dense coding was proposed by using non-symmetric quantum channel in3×2×2 dimensional entangled state.The collapse of the state and entanglement between Alice and Bob were controlled by Charlie's local measurement on his particle in two dimension.Then the 3×2 dimensional non-symmetric quantum channel was controlled.It can be seen that the average amount of transmitted information of dense coding was controlled by Charlie's measurement angle.One can find that the average amount of information is more than 2 bits by using maximally entangled state in the non-symmetric quantum channel.Thus,this scheme is high-efficiency.In the case the entanglement is non-maximally,the transmitted information is determined by the measurement angle 6 and the coefficient /3 of the entangled state.

Chinese Journal of Quantum Electronics•Jan 1, 2014•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

A quantum blind signature scheme based on dense coding for non-entangled states

Ke 柯 Xing 邢, Ai-Han 爱菡 Yin 殷, Yong-Qi 勇奇 Xue 薛

In some schemes, quantum blind signatures require the use of difficult-to-prepare multiparticle entangled states. By considering the communication overhead, quantum operation complexity, verification efficiency and other relevant factors in practical situations, this article proposes a non-entangled quantum blind signature scheme based on dense encoding. The information owner utilizes dense encoding and hash functions to blind the information while reducing the use of quantum resources. After receiving particles, the signer encrypts the message using a one-way function and performs a Hadamard gate operation on the selected single photon to generate the signature. Then the verifier performs a Hadamard gate inverse operation on the signature and combines it with the encoding rules to restore the message and complete the verification. Compared with some typical quantum blind signature protocols, this protocol has strong blindness in privacy protection, and higher flexibility in scalability and application. The signer can adjust the signature operation according to the actual situation, which greatly simplifies the complexity of the signature. By simultaneously utilizing the secondary distribution and rearrangement of non-entangled quantum states, a non-entangled quantum state representation of three bits of classical information is achieved, reducing the use of a large amount of quantum resources and lowering implementation costs. This improves both signature verification efficiency and communication efficiency while, at the same time, this scheme meets the requirements of unforgeability, non-repudiation, and prevention of information leakage.

Chinese Physics B•Feb 22, 2024•6 citations

Communication Advantages from Quantum Dense Network Coding

Ian George, Brian Doolittle

A central problem in quantum information theory is understanding how quantum resources can be used to communicate information more efficiently than classical resources. We introduce quantum dense network coding -- a protocol that transmits the output of a non-Boolean function to a receiver using provably half as many qubits as bits for each sender by not transmitting the entirety of the function inputs. We show this advantage requires both shared entanglement and quantum communication, is robust to noise, and the gap in success probability between quantum and classical communication can be amplified exponentially in the number of senders. Finally, we show that dense network coding gives rise to a novel, information-theoretically secure, quantum cryptographic protocol, which we call measurement-device-independent quantum key growing.

quant-pharXiv:2607.08133•Jul 10, 2026•0 citations
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 could be used to transmit two classical bits with one qubit when a maximally entangled state is shared. In realistic channels, entanglement degradation reduces the channel capacity, while bit-flip noise increases decoding errors. To address these issues, we propose a novel probabilistic controlled dense coding protocol that employs the three-qubit repetition code for error correction and an auxiliary qubit for probabilistic decoding. Moreover, this proposed scheme includes a third party to supervise the communication based on a three-qubit entanglement state. The implementation steps of our protocol are presented in detail, and numerical simulations show that it achieves higher average information than dense coding without error correction. The scheme provides a robust solution for quantum communication under noisy conditions and non-maximally entangled state.
In this paper, we have reinvestigated probabilistic quantum communication protocols and developed a nontraditional remote state preparation protocol that allows for deterministically transferring information encoded in quantum states using a non-maximally entangled channel. With an auxiliary particle and a simple measurement method, the success probability of preparing a d-dimensional quantum state is increased to 1 without spending additional quantum resources in advance to improve quantum channels, such as entanglement purification. Furthermore, we have designed a feasible experimental scheme to demonstrate the deterministic paradigm of transporting a polarization-encoded photon from one location to another using a generalized entangled state. This approach provides a practical method to address decoherence and environmental noises in actual quantum communication.
A scheme of controlled dense coding was proposed by using non-symmetric quantum channel in3×2×2 dimensional entangled state.The collapse of the state and entanglement between Alice and Bob were controlled by Charlie's local measurement on his particle in two dimension.Then the 3×2 dimensional non-symmetric quantum channel was controlled.It can be seen that the average amount of transmitted information of dense coding was controlled by Charlie's measurement angle.One can find that the average amount of information is more than 2 bits by using maximally entangled state in the non-symmetric quantum channel.Thus,this scheme is high-efficiency.In the case the entanglement is non-maximally,the transmitted information is determined by the measurement angle 6 and the coefficient /3 of the entangled state.
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.
In some schemes, quantum blind signatures require the use of difficult-to-prepare multiparticle entangled states. By considering the communication overhead, quantum operation complexity, verification efficiency and other relevant factors in practical situations, this article proposes a non-entangled quantum blind signature scheme based on dense encoding. The information owner utilizes dense encoding and hash functions to blind the information while reducing the use of quantum resources. After receiving particles, the signer encrypts the message using a one-way function and performs a Hadamard gate operation on the selected single photon to generate the signature. Then the verifier performs a Hadamard gate inverse operation on the signature and combines it with the encoding rules to restore the message and complete the verification. Compared with some typical quantum blind signature protocols, this protocol has strong blindness in privacy protection, and higher flexibility in scalability and application. The signer can adjust the signature operation according to the actual situation, which greatly simplifies the complexity of the signature. By simultaneously utilizing the secondary distribution and rearrangement of non-entangled quantum states, a non-entangled quantum state representation of three bits of classical information is achieved, reducing the use of a large amount of quantum resources and lowering implementation costs. This improves both signature verification efficiency and communication efficiency while, at the same time, this scheme meets the requirements of unforgeability, non-repudiation, and prevention of information leakage.
A central problem in quantum information theory is understanding how quantum resources can be used to communicate information more efficiently than classical resources. We introduce quantum dense network coding -- a protocol that transmits the output of a non-Boolean function to a receiver using provably half as many qubits as bits for each sender by not transmitting the entirety of the function inputs. We show this advantage requires both shared entanglement and quantum communication, is robust to noise, and the gap in success probability between quantum and classical communication can be amplified exponentially in the number of senders. Finally, we show that dense network coding gives rise to a novel, information-theoretically secure, quantum cryptographic protocol, which we call measurement-device-independent quantum key growing.