Next Article in Journal
Hyperbolic Diffusion Functionals on a Ring with Finite Velocity
Next Article in Special Issue
Solving Flexible Job-Shop Scheduling Problems Based on Quantum Computing
Previous Article in Journal
Quantum Entanglement Asymmetry and the Cosmic Matter–Antimatter Imbalance: A Theoretical and Observational Analysis
Previous Article in Special Issue
Perturbational Decomposition Analysis for Quantum Ising Model with Weak Transverse Fields
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Deterministic Quantum Dense Coding Based on Non-Maximal Entangled Channel

1
College of Arts and Science, Qingdao Binhai University, Qingdao 266555, China
2
Dalian University of Technology and Belarusian State University Joint Institute, Dalian University of Technology, Dalian 116024, China
3
School of Physics and Electronic Technology, Liaoning Normal University, Dalian 116029, China
*
Authors to whom correspondence should be addressed.
These authors contributed equally to this work.
Entropy 2025, 27(2), 104; https://doi.org/10.3390/e27020104
Submission received: 26 December 2024 / Revised: 11 January 2025 / Accepted: 17 January 2025 / Published: 22 January 2025
(This article belongs to the Special Issue Quantum Information: Working Towards Applications)

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.

1. Introduction

With the rapid advancement of quantum information science [1], the field of quantum communication has experienced significant progress, underpinned by both theoretical breakthroughs and experimental implementations [2,3,4,5,6,7,8]. Central to these advancements is the phenomenon of quantum entanglement [9,10,11,12,13], a uniquely quantum resource that plays a foundational role in enabling various quantum communication protocols. Entanglement serves as the critical enabler for transformative technologies such as quantum dense coding [3,14,15,16,17], which enhances communication efficiency by encoding classical information into quantum states. Additionally, it facilitates quantum teleportation [18,19,20,21,22], a protocol that transfers quantum states across spatially separated systems, and quantum secure direct communication (QSDC) [23,24,25,26], which ensures the direct and secure transfer of information without requiring a shared secret key. Together, these protocols exemplify the transformative potential of entanglement-based quantum communication, highlighting its critical role in shaping the future of secure and efficient information exchange. In the conventional quantum dense coding scheme [3], it is imperative for the two communicating parties to establish a maximally entangled channel, i.e., a shared maximally entangled state, to ensure deterministic transmission of information. However, the preparation of maximally entangled states in practice remains a formidable challenge [27,28,29]. While it is possible to establish a general entanglement channel between the two communicating parties using current experimental techniques, the unavoidable environmental noise and system decoherence make it difficult to establish and store a maximally entangled channel under harsh conditions [30,31,32,33,34]. Since non-maximally entangled states are easier to prepare and store relative to ideal maximally entangled states, research on quantum communication has expanded from maximally entangled channels to non-maximally entangled channels [35,36,37,38,39,40,41]. In traditional quantum dense coding schemes based on non-maximal entanglement channels [38,42,43,44,45,46], due to the fact that the channel between Sender Alice and Receiver Bob is not built by the maximally entangled state (Bell state), Bob cannot directly measure the quantum state of the qubit reserved by Bob and qubit sent by Alice. He needs to perform unitary operations to transform the quantum state of these two qubits with the help of auxiliary qubits. To let Alice make sure that he has lost information and that she needs to send the lost information again, Bob must report the measurement result of the auxiliary qubit.
To address the issue of probabilistic dense coding, we have provided here an alternative deterministic quantum dense coding scheme based on a non-maximally entangled channel. In this deterministic communication scheme, we design a set of unitary operations encoded with 00 , 01 , 10 , and 11. Then, using the auxiliary qubit and specific unitary operations performed by Alice, Bob can directly obtain two bits of information encoded in quantum states. Regardless of whether the quantum channel used is an ideal maximally entangled state or a more easily prepared and stored non-maximally entangled state, there is no theoretical probability of failure for dense coding. Our approach contributes to making quantum communication more efficient and easier to use in practical quantum communication scenarios by increasing the utilisation of quantum entanglement and reducing the associated overhead. In addition, this scheme offers the potential for wider applications in quantum communication networks, where maximizing entanglement utilization and minimizing quantum resource cost are essential for scalable and reliable information transmission.

2. Deterministic Quantum Dense Coding on Non-Maximum Entangled State

This section presents a detailed account of our quantum dense coding scheme. Let us consider the scenario in which Alice and Bob share a non-maximally entangled pure state. The qubit designated as A is in the possession of Alice, while the qubit designated as B is in the possession of Bob. The quantum state of the entanglement is given by
ψ 1 A B = α 00 A B + β 11 A B
where the coefficients α and β are both complex, with the modulus of α less than that of β , i.e., 0 < | α | < | β | . Additionally, the two coefficients satisfy the following normalization condition: | α | 2 + | β | 2 = 1 . It is assumed here that the communicating parties have verified the legitimacy of the received information through the quantum identity authentication process [47,48,49,50,51].

2.1. Unitary Operations

In this section, we introduce the unitary operations and orthogonal basis employed in this deterministic communication scheme. It is similar to the initial quantum dense coding scheme and probabilistic dense coding scheme in that Alice will perform four different unitary operations on her qubit, but the difference is that Alice needs to add an auxiliary qubit e with the initial quantum state 0 e . The joint quantum state employed in this scheme becomes
ψ 0 A B e = ψ 1 A B 0 e = α 00 A B 0 e + β 11 A B 0 e .
It can be demonstrated that the joint bases of the quantum state of qubit A, B, and e are the bases 000 e A B , 101 e A B , 010 e A B , 111 e A B , 100 e A B , 001 e A B , 110 e A B , and 011 e A B . Alice is capable of executing four operations on the qubit A and the auxiliary qubit e she adds. These four unitary operations, as outlined in this scheme, are comprised of three unitary matrices as follows:
U = x α sin θ y α cos θ 0 0 y α cos θ x α sin θ 0 0 0 0 x β cos θ y β sin θ 0 0 y β sin θ x β cos θ ,
U x , e = I A σ x e I B ,
U x , A = σ x A I α I B ,
where
x = β 2 sin 2 θ 1 2 sin 2 θ y = α 2 sin 2 θ 1 2 sin 2 θ .
α and β are the coefficients associated with the entanglement channel, and θ is the coefficient associated with the measured basis vectors. These three coefficients need to be disclosed, as with conventional quantum-dense coding schemes. To ensure that the values of x and y are reasonable, a necessary condition is that the absolute value of sin α must be less than the lesser of the modes of α and β . In addition, the matrix U is unitary, i.e., U U = 1 . The four unitary operations, designated as U, U U x , e , U x , A U , and U x , A U U x , e , are applied in sequence to the quantum state | ψ 0 A B e , and the resulting four states are
U ψ 0 A B e = x sin θ 00 + cos θ 11 A B 0 e + y cos θ 00 sin θ 11 A B 1 e ,
U U x , e ψ 0 A B e = y cos θ 00 sin θ 11 A B 0 e + x sin θ 00 + cos θ 11 A B 1 e ,
U x , A U ψ 0 A B e = x sin θ 10 + cos θ 01 A B 0 e + y cos θ 10 sin θ 01 A B 1 e ,
U x , A U U x , e ψ 0 A B e = y cos θ 10 sin θ 01 A B 0 e + x sin θ 10 + cos θ 01 A B 1 e .

2.2. Orthogonal Complete Basis

In order to distinguish the aforementioned quantum states and realize deterministic dense coding, we have designed the following orthogonal basis for orthogonal measurement:
ψ 1 A B = sin θ 00 A B + cos θ 11 A B ψ 2 A B = cos θ 00 A B sin θ 11 A B ψ 3 A B = sin θ 10 A B + cos θ 01 A B ψ 4 A B = cos θ 10 A B sin θ 11 A B
Obviously, the four quantum states displayed in Equation (11) are mutually orthogonal and collectively form the basis for a four-dimensional Hilbert space. We can define an operator T i j as follows:
T i j = 2 ψ 1 i j i j ψ 1 ψ 2 i j i j ψ 2 + ψ 3 i j i j ψ 3 + 2 ψ 4 i j i j ψ 4 .
By performing the operator on the quantum state of qubit A and qubit B, Bob can deduce the quantum state from the Hamilton value obtained. When the Hamilton values are 2 , 1 , 1, and 2, the quantum states are ψ 1 A B , ψ 2 A B , ψ 3 A B , and ψ 4 A B , respectively.

2.3. Process of Dense Coding

Alice introduces an auxiliary qubit e, designated as | ψ 0 e , into the entangled state, represented as | ψ 1 A B , which is shared between herself and Bob. The entangled state can be demonstrated as follows: ψ 1 A B 0 e . Subsequently, Alice selects one of the unitary operations from the set U, U U x , e , U x , A U , or U x , A U U x , e , and applies it to qubit A and qubit e. Consequently, the quantum state is transformed as follows:
U ψ 1 A B x ψ 1 A B 0 e + y ψ A B 1 e U U x , e ψ 1 A B x ψ 1 A B 1 e + y ψ 2 A B 0 e U x , A U ψ 1 A B x ψ 3 A B 0 e + y ψ 4 A B 1 e U x , A U U x , e ψ 1 A B x ψ 3 A B 1 e + y ψ 4 A B 0 e ,
Next, Alice performs an orthogonal measurement on qubit e. If the measurement is 0 e , the state will collapse into
U ψ 1 A B x ψ 1 A B 0 e + y ψ 2 A B 1 e ψ 1 A B 0 e ,
U U x , e ψ 2 A B x ψ 1 A B 1 e + y ψ 2 A B 0 e ψ 2 A B 0 e ,
U x , A U ψ 3 A B x ψ 3 A B 0 e + y ψ 4 A B 1 e ψ 3 A B 0 e ,
U x , A U U x , e ψ 4 A B x ψ 3 A B 1 e + y ψ 4 A B 0 e ψ 4 A B 0 e .
If the measurement is 1 e , the state will collapse into
U ψ 1 A B x ψ 1 A B 0 e + y ψ 2 A B 1 e ψ 2 A B 1 e ,
U U x , e ψ 2 A B x ψ 1 A B 1 e + y ψ 2 A B 0 e ψ 1 A B 1 e ,
U x , A U ψ 3 A B x ψ 3 A B 0 e + y ψ 4 A B 1 e ψ 4 A B 1 e ,
U x , A U U x , e ψ 4 A B x ψ 3 A B 1 e + y ψ 4 A B 0 e ψ 3 A B 1 e .
Alice then sends qubit A to Bob, along with the measurement result of qubit e via a classical channel. In order to perform an orthogonal measurement on the quantum state of qubit A and qubit B, Bob utilizes the basis defined in Equation (11), which comprises the four quantum states: ψ 1 A B , ψ 2 A B , ψ 3 A B , ψ 4 A B . The measurement result allows Bob to ascertain precisely which operation Alice has performed. In this process, Bob can obtain two bits of information. To illustrate, if the measurement outcome for qubit A and qubit B is found to be the state vector of the form | ψ 1 A B and the measurement outcome for qubit e is found to be the state vector of the form | 0 e , then it can be concluded that the operation performed by Alice is the unitary operator U. In the event that the measurement result of qubit A and qubit B is represented by the state vector | ψ 4 A B and the measurement result of qubit e is represented by the state vector | 1 e , it follows that Bob will conclude that the operation performed by Alice is the composite operation U x , A U . As can be seen from Table 1, the information that Bob can obtain in different situations is dependent on the encoded value, which is represented by the digits 00, 01, 10, and 11. The values represented by these digits are U, U U x , e , U x , A U , and U x , A U U x , e .

2.4. Discussion

Prior to the formal dense encoding, a quantum identity authentication process allows for defending against man-in-the-middle (MITM) attacks as well as for verifying the legitimacy of the receiver. During the dense coding process, even if an eavesdropper has access to the measurements of the auxiliary particles, they will not be able to access the information to be delivered. This is because the eavesdropper is not aware of the operations performed by the sender in relation to the auxiliary particles. From the process outlined above, it is evident that in deterministic dense coding, if we take ψ 1 A B = sin θ 00 A B + cos θ 11 A B as the quantum channel, dense coding is performed optimally when the value of the angle parameter, represented by the variable θ , is within the range of 0 to α . The specific value of α can be determined as needed. In a classical communication of this process, only the measurement results of the auxiliary qubit are transferred. It is therefore necessary to ensure that third parties cannot directly obtain the encoded information by listening to the measurement results of the auxiliary qubit. We now turn to consider the optimal range of the variable θ from the perspective of information security. In this case, regardless of the value of the non-maximal state of α that constitutes the quantum channel, and irrespective of the degree of entanglement of the entangled states, two bits of information can be transferred with each communication, provided that the appropriate unitary operation is selected. It is required that the value of θ in the unitary operation Equation (5) and basis Equation (11) satisfies the condition of 0 < θ < arcsin α . As the value of θ decreases, the value of x 2 , where x 2 = cos 2 θ α 2 1 2 sin 2 θ , increases. In the event that the value of x 2 is excessive and the third eavesdropper, Crosen, is in receipt of the measurement result pertaining to the auxiliary qubit between Alice and Bob, Crosen is able to infer the following from Equation (10): In the event that the measurement result of the auxiliary qubit is 0, it will correspond with high probability to the unitary operation U and U x , A U . Similarly, when the measurement result of the auxiliary qubit is 1, it will correspond with high probability to the unitary operations U U x , e and U x , A U U x , e . It is evident that information disclosure has occurred in these instances. Therefore, in order to guarantee information security, it is imperative that the value of θ is not excessively diminished. Furthermore, the entangled state value of α in the quantum channel should not be too small either, given that θ is less than arcsin α .

3. Conclusions

In conclusion, this work extends deterministic quantum dense coding to non-maximally entangled channels, marking a significant advancement over traditional probabilistic dense coding protocols using non-maximally entangled states. The proposed scheme ensures the deterministic transmission of two bits of classical information per communication, effectively addressing the limitations of probabilistic approaches. A key advantage of this method is that it eliminates the need for the receiver to report the measurement results of the auxiliary qubit back to the transmitter, thereby reducing the communication overhead. Additionally, the scheme requires only a single unitary operation by the sender during the entire communication process, in contrast to probabilistic schemes that demand separate operations by both the sender and receiver for each communication round. These improvements streamline the communication process, reduce resource consumption, and enhance the overall efficiency of quantum information transfer. This deterministic approach not only optimizes the use of quantum channels but also lays a foundation for more practical and scalable implementations of quantum dense coding in future quantum communication networks.

Author Contributions

Conceptualization, X.X. and Z.W.; methodology, X.X., Z.W. and Z.L.; software, X.X.; validation, X.X. and Z.W.; formal analysis, X.X.; investigation, X.X.; resources, X.X.; data curation, X.X.; writing—original draft preparation, X.X.; writing—review and editing, X.X.; visualization, X.X.; supervision, X.X., Z.W. and Z.L. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The data that support the findings of this study are available from the corresponding author(s) upon reasonable request.

Acknowledgments

All authors thank Chong Li for his fruitful discussions.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Nielsen, M.A.; Chuang, I.L. Quantum Computation and Quantum Information; Cambridge University Press: Cambridge, UK, 2010. [Google Scholar]
  2. Ekert, A.K. Quantum cryptography based on Bell’s theorem. Phys. Rev. Lett. 1991, 67, 661–663. [Google Scholar] [CrossRef] [PubMed]
  3. Bennett, C.H.; Wiesner, S.J. Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Phys. Rev. Lett. 1992, 69, 2881–2884. [Google Scholar] [CrossRef]
  4. Duan, L.M.; Lukin, M.D.; Cirac, J.I.; Zoller, P.F. Long-distance quantum communication with atomic ensembles and linear optics. Nature 2001, 414, 413–418. [Google Scholar] [CrossRef]
  5. Gisin, N.; Thew, R. Quantum communication. Nat. Photonics 2007, 1, 165–171. [Google Scholar] [CrossRef]
  6. Wasielewski, M.R.; Forbes, M.D.; Frank, N.L.; Kowalski, K.; Scholes, G.D.; Yuen-Zhou, J.; Baldo, M.A.; Freedman, D.E.; Goldsmith, R.H.; Goodson, T., III; et al. Exploiting chemistry and molecular systems for quantum information science. Nat. Rev. Chem. 2020, 4, 490–504. [Google Scholar] [CrossRef]
  7. Gühne, O.; Haapasalo, E.; Kraft, T.; Pellonpää, J.P.; Uola, R. Colloquium: Incompatible measurements in quantum information science. Rev. Mod. Phys. 2023, 95, 011003. [Google Scholar] [CrossRef]
  8. Darienzo, M.; Kelly, A.M.; Schneble, D.; Wei, T.C. Student attitudes toward quantum information science and technology in a high school outreach program. Phys. Rev. Phys. Educ. Res. 2024, 20, 020126. [Google Scholar] [CrossRef]
  9. Einstein, A.; Podolsky, B.; Rosen, N. Can quantum-mechanical description of physical reality be considered complete? Phys. Rev. 1935, 47, 777. [Google Scholar] [CrossRef]
  10. Schrödinger, E. Die gegenwärtige Situation in der Quantenmechanik. Naturwissenschaften 1935, 23, 844–849. [Google Scholar] [CrossRef]
  11. Šupić, I.; Bowles, J.; Renou, M.O.; Acín, A.; Hoban, M.J. Quantum networks self-test all entangled states. Nat. Phys. 2023, 19, 670–675. [Google Scholar] [CrossRef]
  12. Santos, A.C.; Bachelard, R. Generation of maximally entangled long-lived states with giant atoms in a waveguide. Phys. Rev. Lett. 2023, 130, 053601. [Google Scholar] [CrossRef]
  13. Shaw, A.L.; Chen, Z.; Choi, J.; Mark, D.K.; Scholl, P.; Finkelstein, R.; Elben, A.; Choi, S.; Endres, M. Benchmarking highly entangled states on a 60-atom analogue quantum simulator. Nature 2024, 628, 71–77. [Google Scholar] [CrossRef] [PubMed]
  14. Lo, H.K.; Popescu, S. Classical communication cost of entanglement manipulation: Is entanglement an interconvertible resource? Phys. Rev. Lett. 1999, 83, 1459. [Google Scholar] [CrossRef]
  15. Guo, Y.; Liu, B.H.; Li, C.F.; Guo, G.C. Advances in quantum dense coding. Adv. Quantum Technol. 2019, 2, 1900011. [Google Scholar] [CrossRef]
  16. Liang, S.; Cheng, J.; Qin, J.; Li, J.; Shi, Y.; Zeng, B.; Yan, Z.; Jia, X.; Xie, C.; Peng, K. Frequency-Division Multiplexing Continuous Variable Quantum Dense Coding with Broadband Entanglement. Laser Photonics Rev. 2024, 18, 2400094. [Google Scholar] [CrossRef]
  17. Yang, X.; Bai, M.Q.; Mo, Z.W.; Xiang, Y. Bidirectional and cyclic quantum dense coding in a high-dimension system. Quantum Inf. Process. 2020, 19, 43. [Google Scholar] [CrossRef]
  18. Bennett, C.H.; Brassard, G.; Crépeau, C.; Jozsa, R.; Peres, A.; Wootters, W.K. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Phys. Rev. Lett. 1993, 70, 1895. [Google Scholar] [CrossRef] [PubMed]
  19. Stenholm, S.; Bardroff, P.J. Teleportation of N-dimensional states. Phys. Rev. A 1998, 58, 4373. [Google Scholar] [CrossRef]
  20. Karlsson, A.; Bourennane, M. Quantum teleportation using three-particle entanglement. Phys. Rev. A 1998, 58, 4394. [Google Scholar] [CrossRef]
  21. Li, C.; Song, H.S.; Luo, Y.X. Criterion for general quantum teleportation. Phys. Lett. A 2002, 297, 121–125. [Google Scholar] [CrossRef]
  22. Hu, X.M.; Guo, Y.; Liu, B.H.; Li, C.F.; Guo, G.C. Progress in quantum teleportation. Nat. Rev. Phys. 2023, 5, 339–353. [Google Scholar] [CrossRef]
  23. Deng, F.G.; Long, G.L.; Liu, X.S. Two-step quantum direct communication protocol using the Einstein-Podolsky-Rosen pair block. Phys. Rev. A 2003, 68, 042317. [Google Scholar] [CrossRef]
  24. Deng, F.G.; Long, G.L. Secure direct communication with a quantum one-time pad. Phys. Rev. A—At. Mol. Opt. Phys. 2004, 69, 052319. [Google Scholar] [CrossRef]
  25. Wu, J.; Long, G.L.; Hayashi, M. Quantum secure direct communication with private dense coding using a general preshared quantum state. Phys. Rev. Appl. 2022, 17, 064011. [Google Scholar] [CrossRef]
  26. Li, X.J.; Wang, M.; Pan, X.B.; Zhang, Y.R.; Long, G.L. One-photon-interference quantum secure direct communication. Entropy 2024, 26, 811. [Google Scholar] [CrossRef] [PubMed]
  27. Lin, Y.; Leibrandt, D.R.; Leibfried, D.; Chou, C.W. Quantum entanglement between an atom and a molecule. Nature 2020, 581, 273–277. [Google Scholar] [CrossRef] [PubMed]
  28. Lago-Rivera, D.; Grandi, S.; Rakonjac, J.V.; Seri, A.; de Riedmatten, H. Telecom-heralded entanglement between multimode solid-state quantum memories. Nature 2021, 594, 37–40. [Google Scholar] [CrossRef] [PubMed]
  29. Wein, S.C.; Loredo, J.C.; Maffei, M.; Hilaire, P.; Harouri, A.; Somaschi, N.; Lemaître, A.; Sagnes, I.; Lanco, L.; Krebs, O.; et al. Photon-number entanglement generated by sequential excitation of a two-level atom. Nat. Photonics 2022, 16, 374–379. [Google Scholar] [CrossRef]
  30. Braun, D.; Haake, F.; Strunz, W.T. Universality of Decoherence. Phys. Rev. Lett. 2001, 86, 2913–2917. [Google Scholar] [CrossRef]
  31. Carvalho, A.R.R.; Mintert, F.; Buchleitner, A. Decoherence and Multipartite Entanglement. Phys. Rev. Lett. 2004, 93, 230501. [Google Scholar] [CrossRef]
  32. Lindner, B.; Garcia-Ojalvo, J.; Neiman, A.; Schimansky-Geier, L. Effects of noise in excitable systems. Phys. Rep. 2004, 392, 321–424. [Google Scholar] [CrossRef]
  33. Tyloo, M.; Coletta, T.; Jacquod, P. Robustness of Synchrony in Complex Networks and Generalized Kirchhoff Indices. Phys. Rev. Lett. 2018, 120, 084101. [Google Scholar] [CrossRef]
  34. Ronellenfitsch, H.; Dunkel, J.; Wilczek, M. Optimal Noise-Canceling Networks. Phys. Rev. Lett. 2018, 121, 208301. [Google Scholar] [CrossRef]
  35. Banaszek, K. Optimal quantum teleportation with an arbitrary pure state. Phys. Rev. A 2000, 62, 024301. [Google Scholar] [CrossRef]
  36. Li, W.L.; Li, C.F.; Guo, G.C. Probabilistic teleportation and entanglement matching. Phys. Rev. A 2000, 61, 034301. [Google Scholar] [CrossRef]
  37. Roa, L.; Delgado, A.; Fuentes-Guridi, I. Optimal conclusive teleportation of quantum states. Phys. Rev. A 2003, 68, 022310. [Google Scholar] [CrossRef]
  38. Roa, L.; Groiseau, C. Probabilistic teleportation without loss of information. Phys. Rev. A 2015, 91, 012344. [Google Scholar] [CrossRef]
  39. Liu, J.-M.; Wang, Y.-Z. Probabilistic remote state preparation by W states. Chin. Phys. 2004, 13, 147. [Google Scholar]
  40. Yu, C.S.; Song, H.S.; Wang, Y.H. Remote preparation of a qudit using maximally entangled states of qubits. Phys. Rev. A 2006, 73, 022340. [Google Scholar] [CrossRef]
  41. Wu, W.; Liu, W.T.; Chen, P.X.; Li, C.Z. Deterministic remote preparation of pure and mixed polarization states. Phys. Rev. A 2010, 81, 042301. [Google Scholar] [CrossRef]
  42. Hao, J.C.; Li, C.F.; Guo, G.C. Probabilistic dense coding and teleportation. Phys. Lett. A 2000, 278, 113–117. [Google Scholar] [CrossRef]
  43. Zhang, G.-H.; Yan, F.-L. Probabilistic Dense Coding Using Non-Maximally Entangled Three-Particle States. Chin. Phys. Lett. 2009, 26, 090302. [Google Scholar]
  44. Tian, M.B.; Zhang, G.F. Improving the capacity of quantum dense coding by weak measurement and reversal measurement. Quantum Inf. Process. 2018, 17, 1–10. [Google Scholar] [CrossRef]
  45. Kögler, R.A.; Neves, L. Optimal probabilistic dense coding schemes. Quantum Inf. Process. 2017, 16, 92. [Google Scholar] [CrossRef]
  46. Wang, M.Y.; Yang, L.G.; Yan, F.L. General probabilistic dense coding scheme. Chin. Phys. Lett. 2005, 22, 1053–1056. [Google Scholar]
  47. Dušek, M.; Haderka, O.; Hendrych, M.; Myška, R. Quantum identification system. Phys. Rev. A 1999, 60, 149. [Google Scholar] [CrossRef]
  48. Dutta, A.; Pathak, A. A short review on quantum identity authentication protocols: How would Bob know that he is talking with Alice? Quantum Inf. Process. 2022, 21, 369. [Google Scholar] [CrossRef]
  49. Zhou, L.; Sheng, Y.B. One-step device-independent quantum secure direct communication. Sci. China Phys. Mech. Astron. 2022, 65, 250311. [Google Scholar] [CrossRef]
  50. Dutta, A.; Pathak, A. Controlled secure direct quantum communication inspired scheme for quantum identity authentication. Quantum Inf. Process. 2022, 22, 13. [Google Scholar] [CrossRef]
  51. Zhang, Q.; Du, M.M.; Zhong, W.; Sheng, Y.B.; Zhou, L. Single-Photon Based Three-Party Quantum Secure Direct Communication with Identity Authentication. Ann. Phys. 2024, 536, 2300407. [Google Scholar] [CrossRef]
Table 1. Different measurements correspond to different coded information.
Table 1. Different measurements correspond to different coded information.
Orthogonal MeasurementMeasurement of Auxiliary Qubit eUnitary MatrixCoded Message
ψ 1 A B 0 e U00
ψ 1 A B 1 e U U x , e 01
ψ 2 A B 0 e U U x , e 01
ψ 2 A B 1 e U00
ψ 3 A B 0 e U x , A U 10
ψ 3 A B 1 e U x , A U U x , e 11
ψ 4 A B 0 e U x , A U U x , e 11
ψ 4 A B 1 e U x , A U 10
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Xin, X.; Li, Z.; Wang, Z. Deterministic Quantum Dense Coding Based on Non-Maximal Entangled Channel. Entropy 2025, 27, 104. https://doi.org/10.3390/e27020104

AMA Style

Xin X, Li Z, Wang Z. Deterministic Quantum Dense Coding Based on Non-Maximal Entangled Channel. Entropy. 2025; 27(2):104. https://doi.org/10.3390/e27020104

Chicago/Turabian Style

Xin, Xuanxuan, Zhixing Li, and Zhen Wang. 2025. "Deterministic Quantum Dense Coding Based on Non-Maximal Entangled Channel" Entropy 27, no. 2: 104. https://doi.org/10.3390/e27020104

APA Style

Xin, X., Li, Z., & Wang, Z. (2025). Deterministic Quantum Dense Coding Based on Non-Maximal Entangled Channel. Entropy, 27(2), 104. https://doi.org/10.3390/e27020104

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop