© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

arXiv:1106.3956 · International Journal of Quantum Information

Secure N-dimensional simultaneous dense coding and applications

Haozhen Situ, D. Qiu, Paulo Mateus, Nikola Paunković

Published Oct 1, 2015• 12 citations

Abstract

Simultaneous dense coding (SDC) guarantees that Bob and Charlie simultaneously receive their respective information from Alice in their respective processes of dense coding. The idea is to use the so-called locking operation to “lock” the entanglement channels, thus requiring a joint unlocking operation by Bob and Charlie in order to simultaneously obtain the information sent by Alice. We present some new results on SDC: (1) We propose three SDC protocols, which use different N-dimensional entanglement (Bell state, W state and GHZ state). (2) Besides the quantum Fourier transform, two new locking operators are introduced (the double controlled-NOT operator and the SWAP operator). (3) In the case that spatially distant Bob and Charlie have to finalize the protocol by implementing the unlocking operation through communication, we improve our protocol’s fairness, with respect to Bob and Charlie, by implementing the unlocking operation in series of steps. (4) We improve the security of SDC against the intercept–resend attack. (5) We show that SDC can be used to implement a fair contract signing protocol. (6) We also show that the N-dimensional quantum Fourier transform can act as the locking operator in simultaneous teleportation of N-level quantum systems.

DOI: 10.1142/s0219749915500513

Related papers

Simultaneous dense coding

Haozhen Situ, Daowen Qiu

We present a dense coding scheme between one sender and two receivers, which guarantees that the receivers simultaneously achieve their respective information. In our scheme, the sender first performs a locking operation to entangle the particles from two independent quantum entanglement channels, so that the receivers cannot achieve their information unless they collaborate to perform the unlocking operation. We also show that the quantum Fourier transform can act as the locking operator both in simultaneous dense coding and teleportation. Finally we compare simultaneous dense coding with quantum secret sharing of classical messages.

arXiv:0909.3613•Journal of Physics A Mathematical and Theoretical•Jan 12, 2010•26 citations

Quantum Secure Direct Communication with Four-Particle Genuine Entangled State and Dense Coding

Xiu Xiao-Ming, Li Dong, Gao Ya-Jun +1 more

A quantum secure direct communication scheme using dense coding is proposed. At first, the sender (Alice) prepares four-particle genuine entangled states and shares them with the receiver (Bob) by sending two particles in each entangled state to him. Secondly, Alice encodes secret information by performing the unitary transformations on her particles and transmits them to Bob. Finally, Bob performs the joint measurements on his particles to decode the secret information. The two-step security test guarantees the security of communication.

Communications in Theoretical Physics•Jul 1, 2009•24 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

Absolutely secure distributed superdense coding: entanglement requirement for optimality

Sagnik Dutta, Asmita Banerjee, Prasanta Kumar Panigrahi

Abstract Superdense coding uses entanglement as a resource to communicate classical information efficiently through quantum channels. A superdense coding method is optimal when its capacity reaches Holevo bound. We show that for optimality, maximal entanglement is a necessity across the bipartition of Alice and Bob, but neither absolute nor genuine multipartite entanglement is required. Unlike the previous schemes, which can transmit either even or odd bits of information, we demonstrate a generalized dense coding protocol using the genuine multipartite entangled GHZ state to send arbitrary information bits. Expressed in the eigenbasis of different Pauli operators, GHZ state is characterized by a unique parity pattern which enables us to formulate a security checking technique to ensure absolute security of the protocol. We show this method is better applicable in a scenario, where the initial information is distributed among spatially separated parties. Finally, optimizing the number of qubit(s) sent to Bob, we construct a distributed dense coding method, which completely depicts absolutely secure quantum communication between many to one party.

arXiv:2111.01563•Physica Scripta•Jan 11, 2023•12 citations

On Quantum Dense Coding for Bipartite Systems

Yaokun Liu

Quantum communication, as a vital area of quantum information science, aims to leverage quantum phenomena—particularly entanglement—to achieve tasks that are impossible or inefficient in classical systems. It plays a key role in the development of secure communication protocols and advanced information processing. This paper focuses on one such protocol, dense coding, which enables the transmission of two classical bits using only one entangled quantum particle.”We introduce the mathematical and physical foundations of quantum communication, such as the entangled state and Kronecker product. Then we propose the quantum communication protocol, namely dense coding using Bell states. It offer unique advantages that are beyond the classical parts. For this purpose, we in detail analyze the quantum measurements using Pauli gates and identity matrix, as well as the transmission of particle from Alice to Bob. They are necessary steps for dense coding. Then we analyze how Bob finishes the protocol using measurement over two qubits.

Theoretical and Natural Science•Sep 24, 2025•0 citations

A Simultaneous Quantum Secure Direct Communication Scheme between the Central Party and OtherMParties

Gao Ting, Yan Feng-Li, Zhi‐Xi Wang

We propose a simultaneous quantum secure direct communication scheme between one party and other three parties via four-particle GHZ states and swapping quantum entanglement. In the scheme, three spatially separated senders, Alice, Bob and Charlie, transmit their secret messages to a remote receiver Diana by performing a series of local operations on their respective particles according to the quadripartite stipulation. From Alice, Bob, Charlie and Diana's Bell measurement results, Diana can infer the secret messages. If a perfect quantum channel is used, the secret messages are faithfully transmitted from Alice, Bob and Charlie to Diana via initially shared pairs of four-particle GHZ states without revealing any information to a potential eavesdropper. As there is no transmission of the qubits carrying the secret message in the public channel, it is completely secure for the direct secret communication. This scheme can be considered as a network of communication parties where each party wants to communicate secretly with a central party or server.

arXiv:quant-ph/0509033•Chinese Physics Letters•Sep 22, 2005•60 citations

Simultaneous dense coding (SDC) guarantees that Bob and Charlie simultaneously receive their respective information from Alice in their respective processes of dense coding. The idea is to use the so-called locking operation to “lock” the entanglement channels, thus requiring a joint unlocking operation by Bob and Charlie in order to simultaneously obtain the information sent by Alice. We present some new results on SDC: (1) We propose three SDC protocols, which use different N-dimensional entanglement (Bell state, W state and GHZ state). (2) Besides the quantum Fourier transform, two new locking operators are introduced (the double controlled-NOT operator and the SWAP operator). (3) In the case that spatially distant Bob and Charlie have to finalize the protocol by implementing the unlocking operation through communication, we improve our protocol’s fairness, with respect to Bob and Charlie, by implementing the unlocking operation in series of steps. (4) We improve the security of SDC against the intercept–resend attack. (5) We show that SDC can be used to implement a fair contract signing protocol. (6) We also show that the N-dimensional quantum Fourier transform can act as the locking operator in simultaneous teleportation of N-level quantum systems.

We present a dense coding scheme between one sender and two receivers, which guarantees that the receivers simultaneously achieve their respective information. In our scheme, the sender first performs a locking operation to entangle the particles from two independent quantum entanglement channels, so that the receivers cannot achieve their information unless they collaborate to perform the unlocking operation. We also show that the quantum Fourier transform can act as the locking operator both in simultaneous dense coding and teleportation. Finally we compare simultaneous dense coding with quantum secret sharing of classical messages.

A quantum secure direct communication scheme using dense coding is proposed. At first, the sender (Alice) prepares four-particle genuine entangled states and shares them with the receiver (Bob) by sending two particles in each entangled state to him. Secondly, Alice encodes secret information by performing the unitary transformations on her particles and transmits them to Bob. Finally, Bob performs the joint measurements on his particles to decode the secret information. The two-step security test guarantees the security of 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.

Abstract Superdense coding uses entanglement as a resource to communicate classical information efficiently through quantum channels. A superdense coding method is optimal when its capacity reaches Holevo bound. We show that for optimality, maximal entanglement is a necessity across the bipartition of Alice and Bob, but neither absolute nor genuine multipartite entanglement is required. Unlike the previous schemes, which can transmit either even or odd bits of information, we demonstrate a generalized dense coding protocol using the genuine multipartite entangled GHZ state to send arbitrary information bits. Expressed in the eigenbasis of different Pauli operators, GHZ state is characterized by a unique parity pattern which enables us to formulate a security checking technique to ensure absolute security of the protocol. We show this method is better applicable in a scenario, where the initial information is distributed among spatially separated parties. Finally, optimizing the number of qubit(s) sent to Bob, we construct a distributed dense coding method, which completely depicts absolutely secure quantum communication between many to one party.

Quantum communication, as a vital area of quantum information science, aims to leverage quantum phenomena—particularly entanglement—to achieve tasks that are impossible or inefficient in classical systems. It plays a key role in the development of secure communication protocols and advanced information processing. This paper focuses on one such protocol, dense coding, which enables the transmission of two classical bits using only one entangled quantum particle.”We introduce the mathematical and physical foundations of quantum communication, such as the entangled state and Kronecker product. Then we propose the quantum communication protocol, namely dense coding using Bell states. It offer unique advantages that are beyond the classical parts. For this purpose, we in detail analyze the quantum measurements using Pauli gates and identity matrix, as well as the transmission of particle from Alice to Bob. They are necessary steps for dense coding. Then we analyze how Bob finishes the protocol using measurement over two qubits.

We propose a simultaneous quantum secure direct communication scheme between one party and other three parties via four-particle GHZ states and swapping quantum entanglement. In the scheme, three spatially separated senders, Alice, Bob and Charlie, transmit their secret messages to a remote receiver Diana by performing a series of local operations on their respective particles according to the quadripartite stipulation. From Alice, Bob, Charlie and Diana's Bell measurement results, Diana can infer the secret messages. If a perfect quantum channel is used, the secret messages are faithfully transmitted from Alice, Bob and Charlie to Diana via initially shared pairs of four-particle GHZ states without revealing any information to a potential eavesdropper. As there is no transmission of the qubits carrying the secret message in the public channel, it is completely secure for the direct secret communication. This scheme can be considered as a network of communication parties where each party wants to communicate secretly with a central party or server.