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

Lecture notes in computer science

Randomness in distribution protocols: Extended Abstract

Carlo Blundo, Alfredo De Santis, Ugo Vaccaro

Published Jan 1, 1994• 22 citations
Publisher
DOI
10.1007/3-540-58201-0_99

Related papers

High Entropy Random Selection Protocols (Extended Abstract)

Harry Buhrman, Matthias Christandl, Michal Kouck +3 more

Abstract. We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high entropy, even when one of the two parties is dishonest and deviates from the protocol. We develop protocols that achieve high, close to n, entropy. In the literature the randomness guarantee is usually expressed as being close to the uniform distribution or in terms of resiliency. The notion of entropy is not directly comparable to that of resiliency, but we establish a connection between the two that allows us to compare our protocols with the existing ones. We construct an explicit protocol that yields entropy n − O(1) and has 4log ∗ n rounds, improving over the protocol of Goldreich et al. [3] that also achieves this entropy but needs O(n) rounds. Both these protocols need O(n 2) bits of communication. Next we reduce the communication in our protocols. We show the existence, nonexplicitly, of a protocol that has 6 rounds, 2n + 8log n bits of communication

•Jan 1, 2008•0 citations

Randomness in Distribution Protocols

Carlo Blundo, Alfredo De Santis, Ugo Vaccaro

Information and Computation•Dec 1, 1996•37 citations

Randomness in Private Sequential Stateless Protocols

Hari Krishnan P. Anilkumar, Varun Narayanan, Manoj Prabhakaran +1 more

Lecture notes in computer science•Dec 8, 2024•0 citations

Optimized protocol for twin-field quantum key distribution

Rong Wang, Zhen-Qiang Yin, Feng-Yu Lu +7 more

Abstract Twin-field quantum key distribution (TF-QKD) and its variant protocols are highly attractive due to the advantage of overcoming the rate-loss limit for secret key rates of point-to-point QKD protocols. For variations of TF-QKD, the key point to ensure security is switching randomly between a code mode and a test mode. Among all TF-QKD protocols, their code modes are very different, e.g. modulating continuous phases, modulating only two opposite phases, and sending or not sending signal pulses. Here we show that, by discretizing the number of global phases in the code mode, we can give a unified view on the first two types of TF-QKD protocols, and demonstrate that increasing the number of discrete phases extends the achievable distance, and as a trade-off, lowers the secret key rate at short distances due to the phase post-selection.

arXiv:1904.07074•Communications Physics•Aug 28, 2020•42 citations

Extending qubit coherence by adaptive quantum environment learning

Eleanor Scerri, Erik M. Gauger, Cristian Bonato

Abstract Decoherence, resulting from unwanted interaction between a qubit and its environment, poses a serious challenge towards the development of quantum technologies. Recently, researchers have started analysing how real-time Hamiltonian learning approaches, based on estimating the qubit state faster than the environmental fluctuations, can be used to counteract decoherence. In this work, we investigate how the back-action of the quantum measurements used in the learning process can be harnessed to extend qubit coherence. We propose an adaptive protocol that, by learning the qubit environment, narrows down the distribution of possible environment states. While the outcomes of quantum measurements are random, we show that real-time adaptation of measurement settings (based on previous outcomes) allows a deterministic decrease of the width of the bath distribution, and hence an increase of the qubit coherence. We numerically simulate the performance of the protocol for the electronic spin of a nitrogen-vacancy centre in diamond subject to a dilute bath of 13C nuclear spin, finding a considerable improvement over the performance of non-adaptive strategies.

arXiv:1911.12192•New Journal of Physics•Mar 1, 2020•17 citations

Analysis of randomized security protocols

Matthew S. Bauer

•Nov 30, 2018•1 citation
Abstract. We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high entropy, even when one of the two parties is dishonest and deviates from the protocol. We develop protocols that achieve high, close to n, entropy. In the literature the randomness guarantee is usually expressed as being close to the uniform distribution or in terms of resiliency. The notion of entropy is not directly comparable to that of resiliency, but we establish a connection between the two that allows us to compare our protocols with the existing ones. We construct an explicit protocol that yields entropy n − O(1) and has 4log ∗ n rounds, improving over the protocol of Goldreich et al. [3] that also achieves this entropy but needs O(n) rounds. Both these protocols need O(n 2) bits of communication. Next we reduce the communication in our protocols. We show the existence, nonexplicitly, of a protocol that has 6 rounds, 2n + 8log n bits of communication
Abstract Twin-field quantum key distribution (TF-QKD) and its variant protocols are highly attractive due to the advantage of overcoming the rate-loss limit for secret key rates of point-to-point QKD protocols. For variations of TF-QKD, the key point to ensure security is switching randomly between a code mode and a test mode. Among all TF-QKD protocols, their code modes are very different, e.g. modulating continuous phases, modulating only two opposite phases, and sending or not sending signal pulses. Here we show that, by discretizing the number of global phases in the code mode, we can give a unified view on the first two types of TF-QKD protocols, and demonstrate that increasing the number of discrete phases extends the achievable distance, and as a trade-off, lowers the secret key rate at short distances due to the phase post-selection.
Abstract Decoherence, resulting from unwanted interaction between a qubit and its environment, poses a serious challenge towards the development of quantum technologies. Recently, researchers have started analysing how real-time Hamiltonian learning approaches, based on estimating the qubit state faster than the environmental fluctuations, can be used to counteract decoherence. In this work, we investigate how the back-action of the quantum measurements used in the learning process can be harnessed to extend qubit coherence. We propose an adaptive protocol that, by learning the qubit environment, narrows down the distribution of possible environment states. While the outcomes of quantum measurements are random, we show that real-time adaptation of measurement settings (based on previous outcomes) allows a deterministic decrease of the width of the bath distribution, and hence an increase of the qubit coherence. We numerically simulate the performance of the protocol for the electronic spin of a nitrogen-vacancy centre in diamond subject to a dilute bath of 13C nuclear spin, finding a considerable improvement over the performance of non-adaptive strategies.