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:1810.03267 · Physical Review A

Operational interpretation of coherence in quantum key distribution

Jiajun Ma, You Zhou, Xiao Yuan, Xiongfeng Ma

Published Jun 20, 2019• 46 citations
arXivHTMLPDF

Abstract

Quantum coherence was recently formalized as a physical resource to measure the strength of superposition. Based on the resource theory, we present a systematic framework that connects a coherence measure to the security of quantum key distribution. By considering a generic entanglement-based key distribution protocol under the collective attack scenario, we show that the key rate can be quantified by the coherence of the shared bipartite states. This framework allows us to derive the key rate of the BB84 and six-state protocols. By utilizing fine-grained parameters, we also derive the improved key rates of both protocols within the coherence-based framework. Furthermore, we apply it to a practical issue, detection efficiency mismatch, and obtain an improved result. In conclusion, this framework demonstrates the interplay among coherence, entanglement, and quantum key distribution at a fundamental level.

DOI
10.1103/physreva.99.062325

Related papers

Upper Bound of Collective Attacks on Quantum Key Distribution

Wei Li, Shengmei Zhao

Evaluating the theoretical limit of the amount of information Eve can steal from a quantum key distribution protocol under given conditions is one of the most important things that need to be done in security proof. In addition to source loopholes and detection loopholes, channel attacks are considered to be the main ways of information leakage, while collective attacks are considered to be the most powerful active channel attacks. Here we deduce in detail the capability limit of Eve's collective attack in non-entangled quantum key distribution, like BB84 and measurement-device-independent protocols, and entangled quantum key distribution, like device-independent protocol, in which collective attack is composed of quantum weak measurement and quantum unambiguous state discrimination detection. The theoretical results show that collective attacks are equivalent in entangled and non-entangled quantum key distribution protocols. We also find that compared with the security proof based on entanglement purification, the security proof based on collective attack not only improves the system's tolerable bit error rate, but also improves the key rate.

arXiv:1909.12584•Sep 27, 2019•0 citations

Efficiency in Quantum Key Distribution Protocols with Entangled Gaussian States

Carles Rodó, Oriol Romero‐Isart, K. Eckert +1 more

Quantum key distribution (QKD) refers to specific quantum strategies which permit the secure distribution of a secret key between two parties that wish to communicate secretly. Quantum cryptography has proven unconditionally secure in ideal scenarios and has been successfully implemented using quantum states with finite (discrete) as well as infinite (continuous) degrees of freedom. Here, we analyze the efficiency of QKD protocols that use as a resource entangled gaussian states and gaussian operations only. In this framework, it has already been shown that QKD is possible [1] but the issue of its efficiency has not been considered. We propose a figure of merit (the efficiency E) to quantify the number of classical correlated bits that can be used to distill a key from a sample of N entangled states. We relate the efficiency of the protocol to the entanglement and purity of the states shared between the parties.

arXiv:quant-ph/0611277•Open Systems & Information Dynamics•Mar 1, 2007•13 citations

Security of quantum key distribution with detection-efficiency mismatch in the single-photon case: Tight bounds

M. K. Bochkov, Anton Sergeevich Trushechkin

One of the challenges in practical quantum key distribution is dealing with efficiency mismatch between different threshold single-photon detectors. There are known bounds for the secret key rate for the BB84 protocol with detection-efficiency mismatch provided that the eavesdropper sends no more than one photon to the legitimate receiver. Here we improve these bounds and give tight bounds for the secret key rate with a constant detection-efficiency mismatch under the same single-photon assumption. We propose a method based on the analytical minimization of the relative entropy of coherence, which can be used in other problems in quantum key distribution. Also we propose an adaptation of the decoy state method to prove the security in the case of weak coherent pulses on the source side.

arXiv:1810.04663•Physical Review A•Mar 5, 2019•26 citations

A largely self-contained and complete security proof for quantum key distribution

Marco Tomamichel, Anthony Leverrier

In this work we present a security analysis for quantum key distribution, establishing a rigorous tradeoff between various protocol and security parameters for a class of entanglement-based and prepare-and-measure protocols. The goal of this paper is twofold: 1) to review and clarify the stateof-the-art security analysis based on entropic uncertainty relations, and 2) to provide an accessible resource for researchers interested in a security analysis of quantum cryptographic protocols that takes into account finite resource effects. For this purpose we collect and clarify several arguments spread in the literature on the subject with the goal of making this treatment largely self-contained. More precisely, we focus on a class of prepare-and-measure protocols based on the Bennett-Brassard (BB84) protocol as well as a class of entanglement-based protocols similar to the Bennett-Brassard-Mermin (BBM92) protocol. We carefully formalize the different steps in these protocols, including randomization, measurement, parameter estimation, error correction and privacy amplification, allowing us to be mathematically precise throughout the security analysis. We start from an operational definition of what it means for a quantum key distribution protocol to be secure and derive simple conditions that serve as sufficient condition for secrecy and correctness. We then derive and eventually discuss tradeoff relations between the block length of the classical computation, the noise tolerance, the secret key length and the security parameters for our protocols. Our results significantly improve upon previously reported tradeoffs.

arXiv:1506.08458•Quantum•Jul 14, 2017•146 citations

The Derivation of Operator Inequalities for the BB84 Coherent Protocol in the Three-photon and Two-photon Cases

V. V. Yatsulevich

Abstract The BB84 quantum key distribution protocol using coherent states with detection efficiency mismatch in active and passive bases is important, as it is used in real-world experiments. It is therefore essential to demonstrate the resilience of various protocol variations against different attacks. However, this is not always straightforward. To demonstrate stability under certain conditions, we need operator inequalities. Therefore, this study aims to derive some operator inequalities for quantum observables in three- and two-photon scenarios.

Lobachevskii Journal of Mathematics•Jun 1, 2025•0 citations

Security of quantum key distribution from generalised entropy accumulation

Tony Metger, Renato Renner

The goal of quantum key distribution (QKD) is to establish a secure key between two parties connected by an insecure quantum channel. To use a QKD protocol in practice, one has to prove that a finite size key is secure against general attacks: no matter the adversary's attack, they cannot gain useful information about the key. A much simpler task is to prove security against collective attacks, where the adversary is assumed to behave identically and independently in each round. In this work, we provide a formal framework for general QKD protocols and show that for any protocol that can be expressed in this framework, security against general attacks reduces to security against collective attacks, which in turn reduces to a numerical computation. Our proof relies on a recently developed information-theoretic tool called generalised entropy accumulation and can handle generic prepare-and-measure protocols directly without switching to an entanglement-based version.

arXiv:2203.04993•Mar 9, 2022•3 citations
Quantum coherence was recently formalized as a physical resource to measure the strength of superposition. Based on the resource theory, we present a systematic framework that connects a coherence measure to the security of quantum key distribution. By considering a generic entanglement-based key distribution protocol under the collective attack scenario, we show that the key rate can be quantified by the coherence of the shared bipartite states. This framework allows us to derive the key rate of the BB84 and six-state protocols. By utilizing fine-grained parameters, we also derive the improved key rates of both protocols within the coherence-based framework. Furthermore, we apply it to a practical issue, detection efficiency mismatch, and obtain an improved result. In conclusion, this framework demonstrates the interplay among coherence, entanglement, and quantum key distribution at a fundamental level.
Evaluating the theoretical limit of the amount of information Eve can steal from a quantum key distribution protocol under given conditions is one of the most important things that need to be done in security proof. In addition to source loopholes and detection loopholes, channel attacks are considered to be the main ways of information leakage, while collective attacks are considered to be the most powerful active channel attacks. Here we deduce in detail the capability limit of Eve's collective attack in non-entangled quantum key distribution, like BB84 and measurement-device-independent protocols, and entangled quantum key distribution, like device-independent protocol, in which collective attack is composed of quantum weak measurement and quantum unambiguous state discrimination detection. The theoretical results show that collective attacks are equivalent in entangled and non-entangled quantum key distribution protocols. We also find that compared with the security proof based on entanglement purification, the security proof based on collective attack not only improves the system's tolerable bit error rate, but also improves the key rate.
Quantum key distribution (QKD) refers to specific quantum strategies which permit the secure distribution of a secret key between two parties that wish to communicate secretly. Quantum cryptography has proven unconditionally secure in ideal scenarios and has been successfully implemented using quantum states with finite (discrete) as well as infinite (continuous) degrees of freedom. Here, we analyze the efficiency of QKD protocols that use as a resource entangled gaussian states and gaussian operations only. In this framework, it has already been shown that QKD is possible [1] but the issue of its efficiency has not been considered. We propose a figure of merit (the efficiency E) to quantify the number of classical correlated bits that can be used to distill a key from a sample of N entangled states. We relate the efficiency of the protocol to the entanglement and purity of the states shared between the parties.
One of the challenges in practical quantum key distribution is dealing with efficiency mismatch between different threshold single-photon detectors. There are known bounds for the secret key rate for the BB84 protocol with detection-efficiency mismatch provided that the eavesdropper sends no more than one photon to the legitimate receiver. Here we improve these bounds and give tight bounds for the secret key rate with a constant detection-efficiency mismatch under the same single-photon assumption. We propose a method based on the analytical minimization of the relative entropy of coherence, which can be used in other problems in quantum key distribution. Also we propose an adaptation of the decoy state method to prove the security in the case of weak coherent pulses on the source side.
In this work we present a security analysis for quantum key distribution, establishing a rigorous tradeoff between various protocol and security parameters for a class of entanglement-based and prepare-and-measure protocols. The goal of this paper is twofold: 1) to review and clarify the stateof-the-art security analysis based on entropic uncertainty relations, and 2) to provide an accessible resource for researchers interested in a security analysis of quantum cryptographic protocols that takes into account finite resource effects. For this purpose we collect and clarify several arguments spread in the literature on the subject with the goal of making this treatment largely self-contained. More precisely, we focus on a class of prepare-and-measure protocols based on the Bennett-Brassard (BB84) protocol as well as a class of entanglement-based protocols similar to the Bennett-Brassard-Mermin (BBM92) protocol. We carefully formalize the different steps in these protocols, including randomization, measurement, parameter estimation, error correction and privacy amplification, allowing us to be mathematically precise throughout the security analysis. We start from an operational definition of what it means for a quantum key distribution protocol to be secure and derive simple conditions that serve as sufficient condition for secrecy and correctness. We then derive and eventually discuss tradeoff relations between the block length of the classical computation, the noise tolerance, the secret key length and the security parameters for our protocols. Our results significantly improve upon previously reported tradeoffs.
Abstract The BB84 quantum key distribution protocol using coherent states with detection efficiency mismatch in active and passive bases is important, as it is used in real-world experiments. It is therefore essential to demonstrate the resilience of various protocol variations against different attacks. However, this is not always straightforward. To demonstrate stability under certain conditions, we need operator inequalities. Therefore, this study aims to derive some operator inequalities for quantum observables in three- and two-photon scenarios.
The goal of quantum key distribution (QKD) is to establish a secure key between two parties connected by an insecure quantum channel. To use a QKD protocol in practice, one has to prove that a finite size key is secure against general attacks: no matter the adversary's attack, they cannot gain useful information about the key. A much simpler task is to prove security against collective attacks, where the adversary is assumed to behave identically and independently in each round. In this work, we provide a formal framework for general QKD protocols and show that for any protocol that can be expressed in this framework, security against general attacks reduces to security against collective attacks, which in turn reduces to a numerical computation. Our proof relies on a recently developed information-theoretic tool called generalised entropy accumulation and can handle generic prepare-and-measure protocols directly without switching to an entanglement-based version.