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

Quantum Computing, Quantum Key Distribution, and Quantum Communication

Koji Nagata, Tadao Nakamura

Published Mar 1, 2016• 0 citations
OpenAlex

Abstract

We present quantum key distribution based on Deutsch's algorithm using an entangled state. The security of the protocol is based on it of Ekert 91 protocol. That is, the existence of eavesdroppers must destroy entanglement. Next, we study quantum communication based on two quantum algorithms, such as the Bernstein-Vazirani algorithm and Simon's algorithm. We discuss the fact that quantum communication overcomes classical communication by a factor of $N$ in the Bernstein-Vazirani algorithm case. Also we discuss the fact that quantum communication overcomes classical communication by a factor of $O(\sqrt{2^N}/N)$ in Simon's algorithm case.

Related papers

Distance Based Security using Quantum Entanglement:a survey

Vani Jayasri Geddada, P. Lakshmi

Quantum computing is a swiftly blooming technology that straps up the process of quantum mechanics to solve problems too complex for conventional computers. Quantum Cryptography applies algorithms to encrypt messages that it is never read by anyone outside of the unauthorized recipient. Using Quantum mechanics, for secure communication, we have to follow either a superposition or entanglement algorithm. When compared to superposition, entanglement algorithms are providing more security. Why because it is difficult for intruders to identify how the qubits maintain the relationship. In the existing system, Quantum Key Distribution for short distances has already implemented its even commercially available using entanglement algorithm (Artur Ekert E91 Protocol). In the proposed system, quantum communication over very long distances. In this paper, using Quantum entanglement; the keys are exchanged securely and identify eavesdropping in the communication channel.

International Conference on Computing, Communication and Networking Technologies (ICCCNT)•Oct 3, 2022•4 citations

Quantum Computing in Secure Communication: Challenges, Techniques, and Future Directions

A.V Krishna, V. Kumar, H. S. Sathish +1 more

The emergence of quantum computing has introduced both opportunities and threats to modern secure communication systems. Classical cryptographic algorithms, which rely on computational complexity, are vulnerable to quantum algorithms capable of solving problems such as integer factorization and discrete logarithms efficiently. This paper explores the role of quantum computing in secure communication, focusing on quantum cryptographic techniques such as Quantum Key Distribution (QKD) and Quantum Secure Direct Communication (QSDC). A comprehensive review of existing literature is presented, followed by an analysis of methodologies used in quantum-secure communication systems. The study evaluates the advantages, limitations, and practical challenges of implementing quantum communication technologies. Finally, future research directions and the integration of quantum technologies into next-generation communication networks are discussed.

International Journal For Multidisciplinary Research•Apr 8, 2026•0 citations

Quantum Cryptography and Quantum Key Distribution

Chindiyababy, Ramkumar Jayaraman, Manoj Kumar

Quantum cryptography provides secret communication, which offers various security factors like confidentiality, integrity, and authentication assurance based on the law of physics. The law of physics states that quantum computing can also be applied into the communication sector, which is particularly in the field of cryptography. Then quantum can significantly distribute the data securely by applying quantum key distribution (QKD), quantum key sharing, etc. In the classical cryptography, it is difficult to compute secret keys using security concepts like key exchange and authentication, etc., and it fails to provide adequate protection during data communication as it needs some effective computation in terms of security. The lack of security in the data communication can be overcome by using the concept of quantum computing. Generally, in quantum computing, elementary quantum systems like polarized photons are used to transmit digital information based on the principle of uncertainty as it gives rise to a significant phenomenon of effective security in terms of communication compared to existing concepts related to cryptography. In quantum computing, the detection ratio for identifying the data which are sent through a communication channel is more difficult as it uses qubits and photons to represent the data that are sent. Quantum channels are used to distribute the information between two users as it passes through the unprotected classical channels as it is unknown to anyone else. Assuming that Alice and Bob use a latent noise channel to send a key, reconciliation is the process of correcting errors between Alice and Bob’s version of the key. This is done by public discussion, which leaks some information about the secret key to an undercover. This chapter gives a discussion on QKD concepts as it helps to provide a secure communication, where the information is broadcasting through a quantum channel. Finally, the various existing quantum protocols are described in relation to some security measures based on QKD, and the standard QKD protocol of BB84 is discussed.

CRC Press eBooks•Jun 13, 2022•1 citation

Quantum Cryptography Through Some Algorithm for Quantum Computers

Koji Nagata, Do Ngoc Diep, Tadao Nakamura

We propose quantum cryptography based on an algorithm of determining a function. The security of our cryptography is based on the Ekert 1991 protocol, that is, we use an entangled state. Eve must destroy the entangled state. Consider a function. Alice knows all the mappings concerning the function. Bob knows none of them. His aim is of obtaining all of them without Eve's attack. In classical case, Bob needs some queries. In quantum case, Bob needs just a query. By measuring the single entangled state, which is sent by Alice, Bob can obtain all the mappings concerning the function, simultaneously. This is faster than classical cryptography.

•Jan 1, 2020•0 citations

Quantum Secure Communication

Muhammad Suhail Zubairy

Cryptography is a method of secure communication between two or more parties. The crucial step is exchanging a key in a secure manner. There are, however, two problems with conventional cryptography. First the sender and the receiver should exchange the key through highly reliable and secure channels. The second problem is that a clever eavesdropper can, by a careful analysis of the sent information, reconstruct the key. In this chapter, schemes to overcome these problems are presented. First a scheme for exchanging a key over public channels, the so-called RSA algorithm, is discussed. Then the protocols for the quantum key distribution (QKD), the Bennett–Brassard-84 (BB-84) and Bennett-92(B-92) protocols, are then presented. The QKD protocols are exclusively derived using Bohr’s principle of complementarity. An application of these ideas to the design of secure quantum money is discussed.

Oxford University Press eBooks•May 7, 2020•1 citation

Protocols for Quantum Communication

Serge Massar, Patrice Mégret, Marc Wuilpart +2 more

We show how the techniques developed for long distance quantum key distribution in op-tical fibers can be used to demonstrate other quantum information processing and com-munication protocols. We present a fiber optics realization of the Deutsch-Jozsa and Bernstein-Vazirani algorithms. We describe a method, called ”error filtration”, for re-ducing errors in quantum communication channels, and present an experimental imple-mentation thereof. We discuss the cryptographic primitive of string flipping, and present an experimental implementation which has higher security than achievable using any classical protocol.

IEEE Lasers and Electro-Optics Society Annual Meeting (LEOS)•Jan 1, 2005•0 citations
We present quantum key distribution based on Deutsch's algorithm using an entangled state. The security of the protocol is based on it of Ekert 91 protocol. That is, the existence of eavesdroppers must destroy entanglement. Next, we study quantum communication based on two quantum algorithms, such as the Bernstein-Vazirani algorithm and Simon's algorithm. We discuss the fact that quantum communication overcomes classical communication by a factor of NNN in the Bernstein-Vazirani algorithm case. Also we discuss the fact that quantum communication overcomes classical communication by a factor of O(2N/N)O(\sqrt{2^N}/N)O(2N​/N) in Simon's algorithm case.
Quantum computing is a swiftly blooming technology that straps up the process of quantum mechanics to solve problems too complex for conventional computers. Quantum Cryptography applies algorithms to encrypt messages that it is never read by anyone outside of the unauthorized recipient. Using Quantum mechanics, for secure communication, we have to follow either a superposition or entanglement algorithm. When compared to superposition, entanglement algorithms are providing more security. Why because it is difficult for intruders to identify how the qubits maintain the relationship. In the existing system, Quantum Key Distribution for short distances has already implemented its even commercially available using entanglement algorithm (Artur Ekert E91 Protocol). In the proposed system, quantum communication over very long distances. In this paper, using Quantum entanglement; the keys are exchanged securely and identify eavesdropping in the communication channel.
The emergence of quantum computing has introduced both opportunities and threats to modern secure communication systems. Classical cryptographic algorithms, which rely on computational complexity, are vulnerable to quantum algorithms capable of solving problems such as integer factorization and discrete logarithms efficiently. This paper explores the role of quantum computing in secure communication, focusing on quantum cryptographic techniques such as Quantum Key Distribution (QKD) and Quantum Secure Direct Communication (QSDC). A comprehensive review of existing literature is presented, followed by an analysis of methodologies used in quantum-secure communication systems. The study evaluates the advantages, limitations, and practical challenges of implementing quantum communication technologies. Finally, future research directions and the integration of quantum technologies into next-generation communication networks are discussed.
Quantum cryptography provides secret communication, which offers various security factors like confidentiality, integrity, and authentication assurance based on the law of physics. The law of physics states that quantum computing can also be applied into the communication sector, which is particularly in the field of cryptography. Then quantum can significantly distribute the data securely by applying quantum key distribution (QKD), quantum key sharing, etc. In the classical cryptography, it is difficult to compute secret keys using security concepts like key exchange and authentication, etc., and it fails to provide adequate protection during data communication as it needs some effective computation in terms of security. The lack of security in the data communication can be overcome by using the concept of quantum computing. Generally, in quantum computing, elementary quantum systems like polarized photons are used to transmit digital information based on the principle of uncertainty as it gives rise to a significant phenomenon of effective security in terms of communication compared to existing concepts related to cryptography. In quantum computing, the detection ratio for identifying the data which are sent through a communication channel is more difficult as it uses qubits and photons to represent the data that are sent. Quantum channels are used to distribute the information between two users as it passes through the unprotected classical channels as it is unknown to anyone else. Assuming that Alice and Bob use a latent noise channel to send a key, reconciliation is the process of correcting errors between Alice and Bob’s version of the key. This is done by public discussion, which leaks some information about the secret key to an undercover. This chapter gives a discussion on QKD concepts as it helps to provide a secure communication, where the information is broadcasting through a quantum channel. Finally, the various existing quantum protocols are described in relation to some security measures based on QKD, and the standard QKD protocol of BB84 is discussed.
We propose quantum cryptography based on an algorithm of determining a function. The security of our cryptography is based on the Ekert 1991 protocol, that is, we use an entangled state. Eve must destroy the entangled state. Consider a function. Alice knows all the mappings concerning the function. Bob knows none of them. His aim is of obtaining all of them without Eve's attack. In classical case, Bob needs some queries. In quantum case, Bob needs just a query. By measuring the single entangled state, which is sent by Alice, Bob can obtain all the mappings concerning the function, simultaneously. This is faster than classical cryptography.
Cryptography is a method of secure communication between two or more parties. The crucial step is exchanging a key in a secure manner. There are, however, two problems with conventional cryptography. First the sender and the receiver should exchange the key through highly reliable and secure channels. The second problem is that a clever eavesdropper can, by a careful analysis of the sent information, reconstruct the key. In this chapter, schemes to overcome these problems are presented. First a scheme for exchanging a key over public channels, the so-called RSA algorithm, is discussed. Then the protocols for the quantum key distribution (QKD), the Bennett–Brassard-84 (BB-84) and Bennett-92(B-92) protocols, are then presented. The QKD protocols are exclusively derived using Bohr’s principle of complementarity. An application of these ideas to the design of secure quantum money is discussed.
We show how the techniques developed for long distance quantum key distribution in op-tical fibers can be used to demonstrate other quantum information processing and com-munication protocols. We present a fiber optics realization of the Deutsch-Jozsa and Bernstein-Vazirani algorithms. We describe a method, called ”error filtration”, for re-ducing errors in quantum communication channels, and present an experimental imple-mentation thereof. We discuss the cryptographic primitive of string flipping, and present an experimental implementation which has higher security than achievable using any classical protocol.