Two protocols for deterministic secure quantum communication (DSQC) using GHZ-like states have been proposed. It is shown that one of these protocols can be modified to an equivalent but more efficient protocol of quantum secure direct communication (QSDC). Security and efficiency of the proposed protocols are analyzed in detail and are critically compared with the existing protocols. It is shown that the proposed protocols are highly efficient. It is also shown that all the physical systems where dense coding is possible can be used to design maximally efficient protocol of DSQC and QSDC. Further, it is shown that dense coding is sufficient but not essential for DSQC and QSDC protocols of the present kind. We have shown that there exist a large class of quantum state which can be used to design maximally efficient DSQC and QSDC protocols of the present kind. It is further, observed that maximally efficient QSDC protocols are more efficient than their DSQC counterparts. This additional efficiency arises at the cost of message transmission rate.
Two protocols for deterministic secure quantum communication (DSQC) using GHZ-like states have been proposed. It is shown that one of these protocols can be modified to an equivalent but more efficient protocol of quantum secure direct communication (QSDC). Security and efficiency of the proposed protocols are analyzed in detail and are critically compared with the existing protocols. It is shown that the proposed protocols are highly efficient. It is also shown that all the physical systems where dense coding is possible can be used to design maximally efficient protocol of DSQC and QSDC. Further, it is shown that dense coding is sufficient but not essential for DSQC and QSDC protocols of the present kind. We have shown that there exist a large class of quantum state which can be used to design maximally efficient DSQC and QSDC protocols of the present kind. It is further, observed that maximally efficient QSDC protocols are more efficient than their DSQC counterparts. This additional efficiency arises at the cost of message transmission rate.
Two effective stable quantum communication protocols using 3-qubit and 4-qubit symmetric W states have recently been suggested. These two protocols based on dense coding are extended and their efficiencies are greatly increased. Simplebounds are obtained on the qubit efficiency of determinist safe quantum communication (DSQC) and quantum secure direct communication (QSDC) protocols, and it is shown that dense coding is not sufficient for the design of DSQC and QSDC protocols that are maximally effective. This fact is used to develop DSQC and QSDC protocols that are maximally effective using 3-qubit and 4-qubit W states.
Deterministic secure quantum communication (DSQC) can transmit ciphered message with information theoretical security, in which the message is directly modulated on the quantum state and transmitted from Alice to Bob. Thus, key is not pre-shared, but rather communicated after the security of the ciphered message transmission is assured. In most of previous DSQC protocols, quantum memory or entanglement is necessary, which is still a big challenge with current technology. And the imperfections of practical devices, such as loss, weak coherent source, and so on, may also down play the security and efficiency of these DSQC protocols. In this article, a DSQC protocol with practical devices is proposed. In our protocol, both quantum memory and entanglement are not require. And DSQC with distance as long as 100–200 km and repetition as high as is possible.
Quantum secure direct communication (QSDC) is one of the most important branches of quantum communication. In contrast to the quantum key distribution (QKD) which distributes a secure key between distant parties, QSDC directly transmits secret message instead of sharing key in advance. To establish a secure QSDC protocol, on the one hand, the security of the quantum channel should be confirmed before the exchange of the secret message. On the other hand, the quantum state should be transmitted in a quantum data block since the security of QSDC is based on the error rate analysis in the theories on statistics. Compared with the deterministic quantum key distribution (DQKD) which can also be used to transmit deterministic information, QSDC schemes do not need extra classical bits to read the secret message except for public discussion. In this article, we introduce the basic principles of QSDC and review the development in this field by introducing typical QSDC protocols chronologically. The first QSDC protocol was proposed by Long and Liu, which can be used to establish a common key between distant parties. In their scheme, the method for transmitting quantum states in a block by block way and in multiple steps was proposed and the information leakage before eavesdropping detection was solved. Subsequently, Deng et al. presented two pioneering QSDC schemes, an entangled-state-based two-step QSDC scheme and a single-photon-state-based quantum one-time pad scheme, in which the basic principle and criteria for QSDC were pointed out. From then on, many interesting QSDC schemes have been proposed, including the high-dimension QSDC scheme based on quantum superdense coding, multi-step QSDC scheme based on Greenberger-Horne-Zeilinger states, QSDC scheme based on quantum encryption with practical non-maximally entangled quantum channel, and so on. We also introduce the anti-noise QSDC schemes which were designed for coping with the collective-dephasing noise and the collective-rotation noise, respectively. In 2011, Wang et al. presented the first QSDC which exploited the hyperentangled state as the information carrier and several QSDC schemes based on the spatial degree of freedom (DOF) of photon, single-photon multi-DOF state and hyperentanglement were proposed subsequently. In addition to the point-to-point QSDC schemes, we also review the QSDC networks. Finally, a perspective of QSDC research is given in the last section.
Deterministic secure quantum communication (DSQC) can transmit secret messages between two parties without first generating a shared secret key. Compared with quantum key distribution (QKD), DSQC avoids the waste of qubits arising from basis reconciliation and thus reaches higher efficiency. In this paper, based on data block transmission and order rearrangement technologies, we propose a DSQC protocol. It utilizes a set of single d-level systems as message carriers, which are used to directly encode the secret message in one communication process. Theoretical analysis shows that these employed technologies guarantee the security, and the use of a higher dimensional quantum system makes our protocol achieve higher security and efficiency. Since only quantum memory is required for implementation, our protocol is feasible with current technologies. Furthermore, Trojan horse attack (THA) is taken into account in our protocol. We give a THA model and show that THA significantly increases the multi-photon rate and can thus be detected.
This paper introduces a new quantum protocol for secure direct communication. This protocol is based on Entanglement and Super-Dense coding. In this paper we present some basic definitions of entanglement in quantum mechanics, present how to use the maximally entangled states known as Bell States, and super dense coding technique to achieve secure direct message communication. Finally, we will apply some error models that could affect the transmission of the quantum data on the quantum channels, and how to treat these errors and acquire a safe transmission of the data.
A two-step deterministic secure quantum communication (DSQC) scheme using blocks of three-qubit W state is proposed. In this scheme, the secret messages can be encoded by employing four two-particle unitary operations and directly decoded by utilizing the corresponding measurements in Bell basis or single-particle basis. Comparing with most previous DSQC protocols, the present scheme has a high total efficiency, which comes up to 50%. Apart from this, it has still the advantages of high capacity as each W state can carry two bits of secret information, and high intrinsic efficiency because almost all the instances are useful. Furthermore, the security of this communication can be ensured by the decoy particle checking technique and the two-step transmitting idea.