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

IEEE Journal of Selected Topics in Signal Processing

Imprecise Probabilities Bounds for Quantum Key Distribution

Jorge Garcia-Diaz, Pino Caballero‐Gil, Daniel Escánez-Expósito

Published Jan 1, 2026• 0 citations
Publisher

Abstract

Quantum Key Distribution generates a secret key between two parties with security rooted in quantum mechanics rather than computational assumptions. In practice, however, the channel noise and the eavesdropper's capabilities are never known with precision, an epistemic uncertainty that point-probability models do not capture. This work applies the theory of Imprecise Probabilities, through the notion of credal sets, to the security analysis of Quantum Key Distribution. It decomposes the observed Quantum Bit Error Rate into a benign and an adversarial contribution and, within a bounded-adversary model, bounds the eavesdropper's total induced disturbance across the two conjugate bases by a budget fixed by the protocol's abort threshold. The admissible bit and phase error contributions then form a coupled, non-rectangular credal set, a budget simplex, over which the lower prevision of the Devetak-Winter rate is evaluated in closed form. It is shown that the resulting worst case is attained at an interior allocation of the budget, strictly above the bound obtained by treating the two bases as independent intervals: the imprecise-probability treatment recovers secret key that no worst-case interval substitution can reproduce. This strict gap persists when no benign-noise floor is trusted and the entire observed error is attributed to the adversary, so the recovery does not rest on a trusted-noise premise; calibrating an in-laboratory floor is an optional refinement that further raises the rate and is itself treated as an imprecise quantity. The guarantee is robust to the absence of a precise calibration of the adversary and complements existing finite-key analyses by addressing structural rather than statistical uncertainty.

DOI
10.1109/jstsp.2026.3753071

Related papers

Quantum Key Distribution with State Replacement

Michael Graifer, Yuval Kochman, Ofer Shayevitz

Quantum key distribution protocols have been studied for almost four decades, and have already seen real world applications. Such implementations often operate in naturally noisy environments (e.g., sensor thermal noise, sun radiation, etc.) with known or measurable noise levels. However, existing security proofs implicitly attribute any channel noise to a possible eavesdropper, an overly pessimistic assumption that can adversely effect the guaranteed protocol key-rate. In this paper, we analyze general prepare-and-measure QKD schemes, and show how to improve the bounds on the key-rate under the assumption of an independent state replacement noise at the receiver. Taking BB84 as a concrete example, our results theoretically guarantee a higher key-rate, as a function of the minimal possible replacement probability. In practice, for some parameter-regimes, this guarantees a higher tolerable QBER.

Allerton Conference on Communication, Control, and Computing•Sep 26, 2023•3 citations

Robustness bounds and practical limitations of quantum key distribution

Aeysha Khalique

Quantum information theory is a modern branch of theoretical physics. One of its main goals is to interpret concepts of quantum physics. This leads to a deeper understanding of quantum theory. The most common examples of practical applications of basic quantum theory are quantum computation and quantum cryptography. Quantum cryptography provides secure communication between legitimate users even in the presence of an adversary by making possible the distribution of a secret key. It then allows error correction and privacy amplification, which is elimination of adversary information, through classical communication. In this thesis two important aspects of quantum key distribution are covered, namely robustness bounds with respect to provable entanglement for ideal protocols and practical quantum key distribution using two-way classical communication. In part one of the thesis, ideal quantum key distribution protocols and their robustness in terms of provable entanglement are discussed. The robustness bounds are proved for most general coherent attacks. These bounds for provable entanglement are already known to be 25% for the four-state protocol and 33% for the six-state protocol. We anticipate to provide a region in which the legitimate users share entanglement. This region is large for the four-state protocol and is reduced to a smaller region for the six-state protocol because of additional constraint on it. We also investigate the information cost which the adversary has to pay in order to reach these bounds. In part two we adopt a more practical approach. We investigate the limitation on distance of secure communication because of practical restrictions. In particular we investigate the restrictions due to the lack of single photon sources, the lossy channel and faulty detectors. These practical limitations have already been observed using one-way classical communication between legitimate users. It has been observed that it is actually the dark count rate that limit the distance up to which legitimate users can share a secret key. We have used two-way classical communication to postpone the effect of dark counts and increase the distance to considerable amount. For the purpose we have considered an optimal attack with respect to the disturbance that an eavesdropper creates while attacking. Any other format of attacking will increase the disturbance. We show that using two-way classical communication for post processing we can increase the distance of secure communication considerably.

•Jan 1, 2008•0 citations

Quantum key distribution using generalized contextuality against post-quantum eavesdroppers

Daniel Centeno, Roberto D. Baldijão, Maria Ciudad Alañón +3 more

Bell nonlocality allows secret key to be certified without trusting the internal operation of the devices, and even against eavesdroppers constrained only by the no-signaling principle. We ask whether generalized contextuality, a notion of nonclassicality available in prepare-and-measure experiments on a single system, can play an analogous role. In our approach, Alice and Bob first establish operational equivalences among their local preparation and measurement procedures, which are then treated as theory-independent constraints that any physical intervention on the communication channel, including that of an adversary, must respect. Eve is otherwise unrestricted, that is, her intervention on the transmitted system is not assumed to be described by quantum theory. Within this adversarial model, we show that Eve's optimal guessing probability against individual attacks is the solution of a finite linear program, and hence that a worst-case asymptotic key rate follows from the observed statistics and the operational equivalences alone. We prove that contextuality is necessary for a positive key rate. However, we also show that it is not sufficient. Concretely, the (3,2)-parity-oblivious random access code, known to yield secret key against a quantum eavesdropper, yields none certifiable key rate against a post-quantum one. Conversely, operational equivalences with no analogue among no-signaling constraints can strictly increase the asymptotic key rate. We illustrate this with the prepare-and-measure version of the standard CHSH protocol with an aligned key-generating setting.

quant-pharXiv:2610.00595•Oct 2, 2026•0 citations

Secret Key Rate of Quantum Key Distribution Assuming Worst-Case Attacks

Amelie Sophia Ettinger, Marcel Kokorsch, Guido K.E. Dietl

Quantum Key Distribution (QKD) represents a revolutionary approach in the field of cryptography, offering the potential for unconditional security by leveraging the principles of quantum mechanics. This paper addresses the crucial issue of calculating secure key rates in entanglement based QKD systems. We present a method of key rate calculations that is independent of an eavesdropper's quantum system, relying solely on the quantum states shared between two communicating parties under the assumption of a worst-case attack. We undertake a comparison of asymptotic key rates with those observed in the finite regime, in which only a limited number of quantum states are exchanged. Furthermore, we investigate the influence of entanglement distillation on the achievable key rates. By identifying the numerically optimal number of entanglement distillation iterations based on the initial fidelity and the number of exchanged quantum states, we demonstrate how to achieve a balance between the quantity and quality of entangled states, thereby maximizing the secure key rate. Our results show that there is a unique optimum within a defined search range. Moreover, we determine the minimum number of exchanged quantum states necessary to attain a positive key rate and to obtain a desired number of secure key bits, which are both contingent upon the quality of the communication channel. It is anticipated that the insights gained from this work will prove instrumental in the development of optimal routing strategies in quantum communication networks.

International ITG Conference on Systems, Communications and Coding (SCC)•Mar 10, 2025•3 citations

Efficient quantum key distribution secure against no-signalling eavesdroppers

Antonio Acín, Serge Massar, Stefano Pironio

By carrying out measurements on entangled states, two parties can generate a secret key which is secure not only against an eavesdropper bound by the laws of quantum mechanics, but also against a hypothetical 'post-quantum' eavesdroppers limited by the no-signalling principle only. We introduce a family of quantum key distribution protocols of this type, which are more efficient than previous ones, both in terms of key rate and noise resistance. Interestingly, the best protocols involve large number of measurements. We show that in the absence of noise, these protocols can yield one secret bit per entanglement bit, implying that the key rates in the no-signalling post-quantum scenario are comparable to the key rates in usual quantum key distribution.

arXiv:quant-ph/0605246•New Journal of Physics•Aug 2, 2006•164 citations

Tight security bounds for quantum key distribution

Ci Wen Lim

Despite the significant progress made in both theoretical and experimental quantum key distribution (QKD), the security of current QKD implementations is still not yet established rigorously. One of the major causes of this impasse is that existing security analyses are strongly dependently on the classical-post-processing block size, and as a consequence, the resulting security bounds are unduly pessimistic. In other words, applying these security bounds to current QKD implementations would severely impair the efficiency of these implementations. In this thesis, we overcome this impasse by providing a novel security framework that allows one to derive tight non-asymtptotic security bounds on a wide range of QKD implementations. This essentially closes the gap between theory and practice of QKD.

•Jan 1, 2014•0 citations
Quantum Key Distribution generates a secret key between two parties with security rooted in quantum mechanics rather than computational assumptions. In practice, however, the channel noise and the eavesdropper's capabilities are never known with precision, an epistemic uncertainty that point-probability models do not capture. This work applies the theory of Imprecise Probabilities, through the notion of credal sets, to the security analysis of Quantum Key Distribution. It decomposes the observed Quantum Bit Error Rate into a benign and an adversarial contribution and, within a bounded-adversary model, bounds the eavesdropper's total induced disturbance across the two conjugate bases by a budget fixed by the protocol's abort threshold. The admissible bit and phase error contributions then form a coupled, non-rectangular credal set, a budget simplex, over which the lower prevision of the Devetak-Winter rate is evaluated in closed form. It is shown that the resulting worst case is attained at an interior allocation of the budget, strictly above the bound obtained by treating the two bases as independent intervals: the imprecise-probability treatment recovers secret key that no worst-case interval substitution can reproduce. This strict gap persists when no benign-noise floor is trusted and the entire observed error is attributed to the adversary, so the recovery does not rest on a trusted-noise premise; calibrating an in-laboratory floor is an optional refinement that further raises the rate and is itself treated as an imprecise quantity. The guarantee is robust to the absence of a precise calibration of the adversary and complements existing finite-key analyses by addressing structural rather than statistical uncertainty.
Quantum key distribution protocols have been studied for almost four decades, and have already seen real world applications. Such implementations often operate in naturally noisy environments (e.g., sensor thermal noise, sun radiation, etc.) with known or measurable noise levels. However, existing security proofs implicitly attribute any channel noise to a possible eavesdropper, an overly pessimistic assumption that can adversely effect the guaranteed protocol key-rate. In this paper, we analyze general prepare-and-measure QKD schemes, and show how to improve the bounds on the key-rate under the assumption of an independent state replacement noise at the receiver. Taking BB84 as a concrete example, our results theoretically guarantee a higher key-rate, as a function of the minimal possible replacement probability. In practice, for some parameter-regimes, this guarantees a higher tolerable QBER.
Quantum information theory is a modern branch of theoretical physics. One of its main goals is to interpret concepts of quantum physics. This leads to a deeper understanding of quantum theory. The most common examples of practical applications of basic quantum theory are quantum computation and quantum cryptography. Quantum cryptography provides secure communication between legitimate users even in the presence of an adversary by making possible the distribution of a secret key. It then allows error correction and privacy amplification, which is elimination of adversary information, through classical communication. In this thesis two important aspects of quantum key distribution are covered, namely robustness bounds with respect to provable entanglement for ideal protocols and practical quantum key distribution using two-way classical communication. In part one of the thesis, ideal quantum key distribution protocols and their robustness in terms of provable entanglement are discussed. The robustness bounds are proved for most general coherent attacks. These bounds for provable entanglement are already known to be 25% for the four-state protocol and 33% for the six-state protocol. We anticipate to provide a region in which the legitimate users share entanglement. This region is large for the four-state protocol and is reduced to a smaller region for the six-state protocol because of additional constraint on it. We also investigate the information cost which the adversary has to pay in order to reach these bounds. In part two we adopt a more practical approach. We investigate the limitation on distance of secure communication because of practical restrictions. In particular we investigate the restrictions due to the lack of single photon sources, the lossy channel and faulty detectors. These practical limitations have already been observed using one-way classical communication between legitimate users. It has been observed that it is actually the dark count rate that limit the distance up to which legitimate users can share a secret key. We have used two-way classical communication to postpone the effect of dark counts and increase the distance to considerable amount. For the purpose we have considered an optimal attack with respect to the disturbance that an eavesdropper creates while attacking. Any other format of attacking will increase the disturbance. We show that using two-way classical communication for post processing we can increase the distance of secure communication considerably.
Bell nonlocality allows secret key to be certified without trusting the internal operation of the devices, and even against eavesdroppers constrained only by the no-signaling principle. We ask whether generalized contextuality, a notion of nonclassicality available in prepare-and-measure experiments on a single system, can play an analogous role. In our approach, Alice and Bob first establish operational equivalences among their local preparation and measurement procedures, which are then treated as theory-independent constraints that any physical intervention on the communication channel, including that of an adversary, must respect. Eve is otherwise unrestricted, that is, her intervention on the transmitted system is not assumed to be described by quantum theory. Within this adversarial model, we show that Eve's optimal guessing probability against individual attacks is the solution of a finite linear program, and hence that a worst-case asymptotic key rate follows from the observed statistics and the operational equivalences alone. We prove that contextuality is necessary for a positive key rate. However, we also show that it is not sufficient. Concretely, the (3,2)-parity-oblivious random access code, known to yield secret key against a quantum eavesdropper, yields none certifiable key rate against a post-quantum one. Conversely, operational equivalences with no analogue among no-signaling constraints can strictly increase the asymptotic key rate. We illustrate this with the prepare-and-measure version of the standard CHSH protocol with an aligned key-generating setting.
Quantum Key Distribution (QKD) represents a revolutionary approach in the field of cryptography, offering the potential for unconditional security by leveraging the principles of quantum mechanics. This paper addresses the crucial issue of calculating secure key rates in entanglement based QKD systems. We present a method of key rate calculations that is independent of an eavesdropper's quantum system, relying solely on the quantum states shared between two communicating parties under the assumption of a worst-case attack. We undertake a comparison of asymptotic key rates with those observed in the finite regime, in which only a limited number of quantum states are exchanged. Furthermore, we investigate the influence of entanglement distillation on the achievable key rates. By identifying the numerically optimal number of entanglement distillation iterations based on the initial fidelity and the number of exchanged quantum states, we demonstrate how to achieve a balance between the quantity and quality of entangled states, thereby maximizing the secure key rate. Our results show that there is a unique optimum within a defined search range. Moreover, we determine the minimum number of exchanged quantum states necessary to attain a positive key rate and to obtain a desired number of secure key bits, which are both contingent upon the quality of the communication channel. It is anticipated that the insights gained from this work will prove instrumental in the development of optimal routing strategies in quantum communication networks.
By carrying out measurements on entangled states, two parties can generate a secret key which is secure not only against an eavesdropper bound by the laws of quantum mechanics, but also against a hypothetical 'post-quantum' eavesdroppers limited by the no-signalling principle only. We introduce a family of quantum key distribution protocols of this type, which are more efficient than previous ones, both in terms of key rate and noise resistance. Interestingly, the best protocols involve large number of measurements. We show that in the absence of noise, these protocols can yield one secret bit per entanglement bit, implying that the key rates in the no-signalling post-quantum scenario are comparable to the key rates in usual quantum key distribution.
Despite the significant progress made in both theoretical and experimental quantum key distribution (QKD), the security of current QKD implementations is still not yet established rigorously. One of the major causes of this impasse is that existing security analyses are strongly dependently on the classical-post-processing block size, and as a consequence, the resulting security bounds are unduly pessimistic. In other words, applying these security bounds to current QKD implementations would severely impair the efficiency of these implementations. In this thesis, we overcome this impasse by providing a novel security framework that allows one to derive tight non-asymtptotic security bounds on a wide range of QKD implementations. This essentially closes the gap between theory and practice of QKD.