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

Journal of Experimental and Theoretical Physics

A Simple Quantum Statistical Interpretation of the Key Secrecy Criterion in Quantum Cryptography

S. N. Molotkov

Published Sep 1, 2020• 0 citations
Publisher

Abstract

Abstract In spite of the fact that quantum cryptography is currently the only field of quantum informatics that has been developed from the fundamental physical principles of quantum mechanics to practical applications in the field of transmission and security of information, many results remain, in our opinion, obscure to a wide physics community. The goal of the present study is to give, using minimal and simple mathematical tools, a simple and physically intuitively clear interpretation of the central result of quantum cryptography—a key secrecy criterion based on the trace metric—the distance between two quantum states. The interpretation proposed is self-sufficient and uses the standard Born quantum statistical interpretation of the density matrix—a quantum ensemble—a statistical mixture of quantum states.

DOI
10.1134/s1063776120080117

Related papers

Distinguishability of quantum states and shannon complexity in quantum cryptography

Igor M. Arbekov, S. N. Molotkov

The proof of the security of quantum key distribution is a rather complex problem. Security is defined in terms different from the requirements imposed on keys in classical cryptography. In quantum cryptography, the security of keys is expressed in terms of the closeness of the quantum state of an eavesdropper after key distribution to an ideal quantum state that is uncorrelated to the key of legitimate users. A metric of closeness between two quantum states is given by the trace metric. In classical cryptography, the security of keys is understood in terms of, say, the complexity of key search in the presence of side information. In quantum cryptography, side information for the eavesdropper is given by the whole volume of information on keys obtained from both quantum and classical channels. The fact that the mathematical apparatuses used in the proof of key security in classical and quantum cryptography are essentially different leads to misunderstanding and emotional discussions [1]. Therefore, one should be able to answer the question of how different cryptographic robustness criteria are related to each other. In the present study, it is shown that there is a direct relationship between the security criterion in quantum cryptography, which is based on the trace distance determining the distinguishability of quantum states, and the criterion in classical cryptography, which uses guesswork on the determination of a key in the presence of side information.

Journal of Experimental and Theoretical Physics•Jul 1, 2017•21 citations

Concatenation of Keys in Quantum Cryptography: How Quantum Entanglement “Penetrates to” Classical Devices

S. N. Molotkov

Abstract Quantum mechanics admits collective measurements that are related to the projection onto entangled states and allow one to retrieve more classical information from an ensemble of quantum states compared with individual measurements. In this relation, a fundamental question arises for key secrecy in quantum cryptography. Should the secrecy criterion be formulated with regard to all keys distributed both on previous and future quantum key distribution (QKD) sessions, or it suffices to guarantee key secrecy only in an individual QKD session? The study of this question is the subject of the present paper.

Journal of Experimental and Theoretical Physics•Oct 1, 2018•2 citations

Entanglement and Geometrical Distances in Quantum Information and Quantum Cryptography

Rotem Liss

The counter-intuitive features of Quantum Mechanics make it possible to solve problems and perform tasks that are beyond the abilities of classical computers and classical communication devices. The area of quantum information processing studies how representing information by quantum states can help achieving such improvements.In this research, we use basic notions of quantum information (mainly entanglement, Bloch sphere, and geometrical distances between quantum states) for analyzing relations of quantum states to each other and quantum cryptographic protocols.Entanglement is an important feature of quantum states. Intuitively (and, partly, inaccurately), entanglement represents quantum (non-classical) correlations between several different quantum systems. Entanglement is one of the most important quantum phenomena, and it has many uses in quantum information, quantum communication, and quantum computing.Some quantum states can be geometrically represented by the Bloch sphere: the unit sphere in the three-dimensional Euclidean space. The "standard" quantum states, to which the laws of Quantum Mechanics directly apply, are called pure states. Other states are the mixed states: probability distributions ("mixtures") of several pure states. The points on the Bloch sphere are the pure states, and those inside the Bloch sphere are the mixed states. This geometrical representation is useful and intuitive for many purposes.We provide a geometrical analysis of entanglement for all the quantum mixed states of rank 2 (all the mixtures of exactly two pure states): for any such state (in any dimension), we define a generalized Bloch sphere by using the two pure states, and we analyze this state and its neighbor states inside this Bloch sphere. We look at the set of non-entangled states ("separable states") in the Bloch sphere and characterize it into exactly five possible classes. We give examples for each class and prove that there are no other classes. In addition, we suggest possible definitions of "entanglement measures" by using the "trace distance" from the nearest separable state.Many types of distances between quantum states can be defined. One of the most useful distances is the trace distance, which bounds the "distinguishability" between the states. The trace distance is very useful in quantum information and quantum cryptography, and it also has a simple geometrical interpretation: it is half of the Euclidean distance between the states in the Bloch sphere.Quantum key distribution (QKD) protocols make it possible for two participators to achieve the classically-impossible task of generating a secret random shared key even if their adversary is computationally unlimited. Several important QKD protocols, including the first protocol of Bennett and Brassard (BB84), have their unconditional security proved against adversaries performing the most general attacks in a theoretical (idealized) setting. We discuss a slightly different protocol, named "BB84-INFO-z", and prove it secure against a broad class of attacks (the collective attacks). Moreover, we make use of the "trace distance" for making our security proof more "composable" than similar security proofs for BB84: namely, for making a step towards proving that the secret key remains secret even when the two participators actually use it for cryptographic purposes.

•Aug 31, 2022•1 citation

On sufficient statistics in quantum cryptography: quantum key distribution with mismatching detector efficiency

Kirill A. Balygin, S. N. Molotkov

Abstract Accounting for the different quantum efficiency of detectors is fundamentally important for ensuring the cryptographic security of practical systems of quantum cryptography. A method for accounting for different quantum efficiency of detectors is proposed. The method is, in fact, analytical and applicable to any quantum key distribution protocols.

Laser Physics•Feb 18, 2021•0 citations

Quantum entanglement and composite keys in quantum cryptography

S. N. Molotkov

The security of quantum cryptography protocols after a quantum key distribution (QKD) session is formulated in terms of proximity between two situations: quantum states corresponding to real and ideal situations after QKD. The measure of proximity is the trace distance. It is more reasonable to formulate security directly in terms of the smallness of probability of successive guessing of keys by an eavesdropper after an arbitrary number of QKD sessions. There is a fundamental question the answer to which is a priori very unobvious: Is the security criterion in terms of the proximity of the real and ideal situations for a single QKD session sufficient to guarantee the security of keys in terms of the smallness of probability of guessing of keys by the eavesdropper after an arbitrary number of QKD sessions? It has been shown that the answer to this question is positive.

Journal of Experimental and Theoretical Physics Letters•Jun 1, 2017•2 citations

QUANTUM CRYPTOGRAPHY: A NEW GENERATION OF INFORMATION SECURITY SYSTEM

Ritesh Kumar Jain, Kamal Kant Hiran, Gaurav Paliwal

Quantum Cryptography is an approach to securing communications by applying the phenomena of quantum physics. Unlike traditional classical cryptography, which uses mathematical techniques to restrict eavesdroppers, quantum cryptography is focused on the physics of information. The security of these transmissions is based on the inviolability of the laws of quantum mechanics. The quantum cryptography relies on two important elements of quantum mechanics-the Heisenberg Uncertainty principle and the principle of photon polarization. This paper summarizes the current state of quantum cryptography and the real–world application implementation of this technology.

•Jan 1, 2012•10 citations
Abstract In spite of the fact that quantum cryptography is currently the only field of quantum informatics that has been developed from the fundamental physical principles of quantum mechanics to practical applications in the field of transmission and security of information, many results remain, in our opinion, obscure to a wide physics community. The goal of the present study is to give, using minimal and simple mathematical tools, a simple and physically intuitively clear interpretation of the central result of quantum cryptography—a key secrecy criterion based on the trace metric—the distance between two quantum states. The interpretation proposed is self-sufficient and uses the standard Born quantum statistical interpretation of the density matrix—a quantum ensemble—a statistical mixture of quantum states.
The proof of the security of quantum key distribution is a rather complex problem. Security is defined in terms different from the requirements imposed on keys in classical cryptography. In quantum cryptography, the security of keys is expressed in terms of the closeness of the quantum state of an eavesdropper after key distribution to an ideal quantum state that is uncorrelated to the key of legitimate users. A metric of closeness between two quantum states is given by the trace metric. In classical cryptography, the security of keys is understood in terms of, say, the complexity of key search in the presence of side information. In quantum cryptography, side information for the eavesdropper is given by the whole volume of information on keys obtained from both quantum and classical channels. The fact that the mathematical apparatuses used in the proof of key security in classical and quantum cryptography are essentially different leads to misunderstanding and emotional discussions [1]. Therefore, one should be able to answer the question of how different cryptographic robustness criteria are related to each other. In the present study, it is shown that there is a direct relationship between the security criterion in quantum cryptography, which is based on the trace distance determining the distinguishability of quantum states, and the criterion in classical cryptography, which uses guesswork on the determination of a key in the presence of side information.
Abstract Quantum mechanics admits collective measurements that are related to the projection onto entangled states and allow one to retrieve more classical information from an ensemble of quantum states compared with individual measurements. In this relation, a fundamental question arises for key secrecy in quantum cryptography. Should the secrecy criterion be formulated with regard to all keys distributed both on previous and future quantum key distribution (QKD) sessions, or it suffices to guarantee key secrecy only in an individual QKD session? The study of this question is the subject of the present paper.
The counter-intuitive features of Quantum Mechanics make it possible to solve problems and perform tasks that are beyond the abilities of classical computers and classical communication devices. The area of quantum information processing studies how representing information by quantum states can help achieving such improvements.In this research, we use basic notions of quantum information (mainly entanglement, Bloch sphere, and geometrical distances between quantum states) for analyzing relations of quantum states to each other and quantum cryptographic protocols.Entanglement is an important feature of quantum states. Intuitively (and, partly, inaccurately), entanglement represents quantum (non-classical) correlations between several different quantum systems. Entanglement is one of the most important quantum phenomena, and it has many uses in quantum information, quantum communication, and quantum computing.Some quantum states can be geometrically represented by the Bloch sphere: the unit sphere in the three-dimensional Euclidean space. The "standard" quantum states, to which the laws of Quantum Mechanics directly apply, are called pure states. Other states are the mixed states: probability distributions ("mixtures") of several pure states. The points on the Bloch sphere are the pure states, and those inside the Bloch sphere are the mixed states. This geometrical representation is useful and intuitive for many purposes.We provide a geometrical analysis of entanglement for all the quantum mixed states of rank 2 (all the mixtures of exactly two pure states): for any such state (in any dimension), we define a generalized Bloch sphere by using the two pure states, and we analyze this state and its neighbor states inside this Bloch sphere. We look at the set of non-entangled states ("separable states") in the Bloch sphere and characterize it into exactly five possible classes. We give examples for each class and prove that there are no other classes. In addition, we suggest possible definitions of "entanglement measures" by using the "trace distance" from the nearest separable state.Many types of distances between quantum states can be defined. One of the most useful distances is the trace distance, which bounds the "distinguishability" between the states. The trace distance is very useful in quantum information and quantum cryptography, and it also has a simple geometrical interpretation: it is half of the Euclidean distance between the states in the Bloch sphere.Quantum key distribution (QKD) protocols make it possible for two participators to achieve the classically-impossible task of generating a secret random shared key even if their adversary is computationally unlimited. Several important QKD protocols, including the first protocol of Bennett and Brassard (BB84), have their unconditional security proved against adversaries performing the most general attacks in a theoretical (idealized) setting. We discuss a slightly different protocol, named "BB84-INFO-z", and prove it secure against a broad class of attacks (the collective attacks). Moreover, we make use of the "trace distance" for making our security proof more "composable" than similar security proofs for BB84: namely, for making a step towards proving that the secret key remains secret even when the two participators actually use it for cryptographic purposes.
The security of quantum cryptography protocols after a quantum key distribution (QKD) session is formulated in terms of proximity between two situations: quantum states corresponding to real and ideal situations after QKD. The measure of proximity is the trace distance. It is more reasonable to formulate security directly in terms of the smallness of probability of successive guessing of keys by an eavesdropper after an arbitrary number of QKD sessions. There is a fundamental question the answer to which is a priori very unobvious: Is the security criterion in terms of the proximity of the real and ideal situations for a single QKD session sufficient to guarantee the security of keys in terms of the smallness of probability of guessing of keys by the eavesdropper after an arbitrary number of QKD sessions? It has been shown that the answer to this question is positive.
Quantum Cryptography is an approach to securing communications by applying the phenomena of quantum physics. Unlike traditional classical cryptography, which uses mathematical techniques to restrict eavesdroppers, quantum cryptography is focused on the physics of information. The security of these transmissions is based on the inviolability of the laws of quantum mechanics. The quantum cryptography relies on two important elements of quantum mechanics-the Heisenberg Uncertainty principle and the principle of photon polarization. This paper summarizes the current state of quantum cryptography and the real–world application implementation of this technology.