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

arXiv:quant-ph/9812087

Complete Quantum Communication with Security

Arindam Mitra

Published Dec 31, 1998• 9 citations
arXivHTMLPDF

Abstract

The long-standing problem of quantum information processing is to remove the classical channel from quantum communication. Introducing a new information processing technique, it is discussed that both insecure and secure quantum communications are possible without the requirement of classical channel.
DOI
10.48550/arxiv.quant-ph/9812087

Related papers

A Survey on Quantum Channel Capacities

László Gyöngyösi, Sándor Imre, Hung Viet Nguyen

Quantum information processing exploits the quantum nature of information. It offers fundamentally new solutions in the field of computer science and extends the possibilities to a level that cannot be imagined in classical communication systems. For quantum communication channels, many new capacity definitions were developed in comparison to classical counterparts. A quantum channel can be used to realize classical information transmission or to deliver quantum information, such as quantum entanglement. Here we review the properties of the quantum communication channel, the various capacity measures and the fundamental differences between the classical and quantum channels.

arXiv:1801.02019•IEEE Communications Surveys & Tutorials•Jan 1, 2018•376 citations

Quantum information processing: basic ideas, implementations, and possible impact on communications

Anders Karlsson

The tutorial will review the field of quantum information processing, i.e. quantum cryptography, quantum error correction codes, quantum computing..., starting from basic ideas, to the present state-of-the-art. We will also identify some critical technologies as well as discuss the potential impact on communications.

European Conference on Optical Communication•Jan 1, 1997•0 citations

Simulation of the Quantum Key Distribution Algorithm Using the Intel Quantum SDK

Yaknan John Gambo, Tejas Shinde, Kevin Rasch +2 more

Information security is an important fabric of our world today. Technologies used in the development of information security have constantly been evolving in response to new threats. Cryptographic algorithms like the RSA, DSA, AES etc. are currently being used in securing information even over insecure channels. The coming of quantum computers has now posed a great threat to classical cryptosystems which can be broken in polynomial time thanks to Shor’s algorithm. A good hacker with good quantum computing power can break into encrypted messages easily. The Quantum Key Distribution (QKD) algorithm based on the BB84 protocol provides a solution to this problem. It makes it possible for communicating parties to exchange secret keys securely before a conversation can ensue. Verifying if these keys have been tampered with is a good first step to start before any other. QKD technology has made it possible to exchange these keys via an insecure channel and lets communicating parties know if an eavesdropper has tempered with the message. In this work, we discuss the QKD algorithm and simulated it on the newly released Intel quantum SDK.

International Conference on Advanced Computer Information Technologies (ACIT)•Sep 21, 2023•1 citation

Quantum Merkle Puzzles

Gilles Brassard, Louis Salvail

Starting in 1974, Ralph Merkle proposed the first unclassified systems for secure communications over insecure channels. When legitimate communicating parties are willing to spend an amount of computational effort proportional to some parameter N, an eavesdropper cannot break into their communication without spending a time in the order ofN2, which is quadratically more than the legitimate effort. We investigate quantum analogues to this technique. First, we show that Merkle's systems are completely insecure if the legitimate parties are classical but the eavesdropper uses quantum computation. Then, we describe simple modifications on Merkle's proposals, in which the legitimate parties still use classical communication but benefit from local quantum computation to agree on a common key. We show that the optimal quantum eavesdropping strategy against our protocols requires a time in the order o/7V3/2. We conjecture these Quantum Merkle Puzzles to be optimal in the classical communication model, in which case quantum mechanics does more harm than good for the purpose of secure communications over insecure classical channels. This is in sharp contrast with Quantum Key Distribution, which ensures unconditionally secure communications over quantum channels.

International Conference on Quantum, Nano and Micro Technologies (ICQNM)•Feb 1, 2008•24 citations

A new information science

David Williams

Quantum information processing is based on quantum mechanical principles and includes quantum computing and cryptography.

Materials Today•Jun 18, 2007•0 citations

Security in quantum cryptography and quantum networks

Jozef Gruska

Security and privacy have become such important commodities in the information and globalization era that it would be extremely beneficial to comprehensively explore possibilities for providing (near) perfect performance in these fields. A method based on quantum phenomena and the laws and limitations of quantum information processing and communication was recently developped with the aim of providing so-called unconditional security in sensitive cryptographic tasks. During the last 20 years, quantum cryptography has made remarkable (even previously unimaginable) progress. The goal of this paper is to present a brief introduction to the principles, methods and achievements of quantum cryptography and to discuss its recent advances and the challenges it poses, especially in the area of quantum network security

•Jan 1, 2005•0 citations
Quantum information processing exploits the quantum nature of information. It offers fundamentally new solutions in the field of computer science and extends the possibilities to a level that cannot be imagined in classical communication systems. For quantum communication channels, many new capacity definitions were developed in comparison to classical counterparts. A quantum channel can be used to realize classical information transmission or to deliver quantum information, such as quantum entanglement. Here we review the properties of the quantum communication channel, the various capacity measures and the fundamental differences between the classical and quantum channels.
Information security is an important fabric of our world today. Technologies used in the development of information security have constantly been evolving in response to new threats. Cryptographic algorithms like the RSA, DSA, AES etc. are currently being used in securing information even over insecure channels. The coming of quantum computers has now posed a great threat to classical cryptosystems which can be broken in polynomial time thanks to Shor’s algorithm. A good hacker with good quantum computing power can break into encrypted messages easily. The Quantum Key Distribution (QKD) algorithm based on the BB84 protocol provides a solution to this problem. It makes it possible for communicating parties to exchange secret keys securely before a conversation can ensue. Verifying if these keys have been tampered with is a good first step to start before any other. QKD technology has made it possible to exchange these keys via an insecure channel and lets communicating parties know if an eavesdropper has tempered with the message. In this work, we discuss the QKD algorithm and simulated it on the newly released Intel quantum SDK.
Starting in 1974, Ralph Merkle proposed the first unclassified systems for secure communications over insecure channels. When legitimate communicating parties are willing to spend an amount of computational effort proportional to some parameter N, an eavesdropper cannot break into their communication without spending a time in the order ofN2, which is quadratically more than the legitimate effort. We investigate quantum analogues to this technique. First, we show that Merkle's systems are completely insecure if the legitimate parties are classical but the eavesdropper uses quantum computation. Then, we describe simple modifications on Merkle's proposals, in which the legitimate parties still use classical communication but benefit from local quantum computation to agree on a common key. We show that the optimal quantum eavesdropping strategy against our protocols requires a time in the order o/7V3/2. We conjecture these Quantum Merkle Puzzles to be optimal in the classical communication model, in which case quantum mechanics does more harm than good for the purpose of secure communications over insecure classical channels. This is in sharp contrast with Quantum Key Distribution, which ensures unconditionally secure communications over quantum channels.
Security and privacy have become such important commodities in the information and globalization era that it would be extremely beneficial to comprehensively explore possibilities for providing (near) perfect performance in these fields. A method based on quantum phenomena and the laws and limitations of quantum information processing and communication was recently developped with the aim of providing so-called unconditional security in sensitive cryptographic tasks. During the last 20 years, quantum cryptography has made remarkable (even previously unimaginable) progress. The goal of this paper is to present a brief introduction to the principles, methods and achievements of quantum cryptography and to discuss its recent advances and the challenges it poses, especially in the area of quantum network security