Related papers: Improved Loss-Tolerant Quantum Coin Flipping
Let $q \in (0,1)$ and $\delta \in (0,1)$ be real numbers, and let $C$ be a coin that comes up heads with an unknown probability $p$, such that $p \neq q$. We present an algorithm that, on input $C$, $q$, and $\delta$, decides, with…
It has been recently shown by Mayers that no bit commitment scheme is secure if the participants have unlimited computational power and technology. However it was noticed that a secure protocol could be obtained by forcing the cheater to…
Die-rolling is the cryptographic task where two mistrustful, remote parties wish to generate a random $D$-sided die-roll over a communication channel. Optimal quantum protocols for this task have been given by Aharon and Silman (New Journal…
A critical component of any quantum error-correcting scheme is detection of errors by using an ancilla system. However, errors occurring in the ancilla can propagate onto the logical qubit, irreversibly corrupting the encoded information.…
Security proofs of quantum key distribution (QKD) often require post-processing schemes to simplify the data structure, and hence the security proof. We show a generic method to improve resulting secure key rates by partially reversing the…
Bit commitment is a fundamental cryptographic primitive and a cornerstone for numerous two-party cryptographic protocols, including zero-knowledge proofs. However, it has been proven that unconditionally secure bit commitment, both…
In this paper, a quantum version of classical alternating bit protocol is proposed. This protocol provides a reliable method to transmit the secret quantum data via a noisy quantum channel while the entanglement between particles is not…
A new protocol for quantum key distribution based on entanglement swapping is presented. In this protocol, both certain key and random key can be generated without any loss of security. It is this property differs our protocol from the…
We propose a new coherent state quantum key distribution protocol that eliminates the need to randomly switch between measurement bases. This protocol provides significantly higher secret key rates with increased bandwidths than previous…
Error filtration is a method for encoding the quantum state of a single particle into a higher dimensional Hilbert space in such a way that it becomes less sensitive to phase noise. We experimentally demonstrate this method by distributing…
We devise a simple modification that essentially doubles the efficiency of a well-known quantum key distribution scheme proposed by Bennett and Brassard (BB84). Our scheme assigns significantly different probabilities for the different…
We prove that BB84 protocol with random privacy amplification is secure with a higher key rate than Mayers' estimate with the same error rate. Consequently, the tolerable error rate of this protocol is increased from 7.5 % to 11 %. We also…
Signal loss poses a significant threat to the security of quantum cryptography when the chosen protocol lacks loss-tolerance. In quantum position verification (QPV) protocols, even relatively small loss rates can compromise security. The…
Quantum computers are becoming increasingly accessible, and may soon outperform classical computers for useful tasks. However, qubit readout errors remain a significant hurdle to running quantum algorithms on current devices. We present a…
In this letter we present the first implementation of a quantum coin tossing protocol. This protocol belongs to a class of ``two-party'' cryptographic problems, where the communication partners distrust each other. As with a number of such…
In this paper we consider a three-state variant of the BB84 quantum key distribution (QKD) protocol. We derive a new lower-bound on the key rate of this protocol in the asymptotic scenario and use mismatched measurement outcomes to improve…
We calculate the error threshold for the linear optics quantum computing proposal by Knill, Laflamme and Milburn [Nature 409, pp. 46--52 (2001)] under an error model where photon detectors have efficiency <100% but all other components --…
We consider two-party quantum protocols starting with a transmission of some random BB84 qubits followed by classical messages. We show a general "compiler" improving the security of such protocols: if the original protocol is secure…
In this paper, we derive optimized measurement-free protocols for quantum error correction and the implementation of a universal gate set optimized for an error model that is noise biased . The noise bias is adapted for neutral atom…
Many proposals for fault tolerant quantum computation (FTQC) suffer detectable loss processes. Here we show that topological FTQC schemes, which are known to have high error thresholds, are also extremely robust against losses. We…