相关论文: Semi-Loss-Tolerant Strong Coin Flipping Protocol U…

It is not so well-known that measurement-free quantum error correction protocols can be designed to achieve fault-tolerant quantum computing. Despite the potential advantages of using such protocols in terms of the relaxation of accuracy,…

We extend the research program initiated in [Phys. Rev. A 92, 012338 (2015)], where we restricted our attention to noisy deterministic teleportation protocols, to noisy probabilistic (conditional) protocols. Our main goal now is to study…

Mutually unbiased bases have been extensively studied in the literature and are simple and effective in quantum key distribution protocols, but they are not optimal. Here equiangular spherical codes are introduced as a more efficient and…

This paper investigates a reconciliation method in order to establish an errorless secret key in a QKD protocol. Classical key distribution protocols are no longer unconditionally secure because computational complexity of mathematical…

We introduce a quantum key distribution protocol designed to expose fake users that connect to Alice or Bob for the purpose of monopolising the link and denying service. It inherently resists attempts to exhaust Alice and Bob's initial…

As a measure of the 'closeness' of two quantum states, fidelity plays a fundamental role in quantum information theory. Fidelity estimation protocols try to strike a balance between information gleaned from an experiment, and the efficiency…

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…

In this work, we present a novel authenticated Quantum Key Distribution (QKD) protocol employing maximally entangled qubit pairs. In the absence of noise, we securely authenticate the well-known BB84 QKD scheme under two assumptions: first,…

We investigate quantum error correction protocols for neutral atoms quantum processors in the presence of atom loss. We complement the surface code with loss detection units (LDU) and analyze its performances by means of circuit-level…

Bit commitment is a fundamental cryptographic primitive in which Bob wishes to commit a secret bit to Alice. Perfectly secure bit commitment has been proven impossible through asynchronous exchange of classical and quantum information.…

The goal of two-party cryptography is to enable two parties, Alice and Bob, to solve common tasks without the need for mutual trust. Examples of such tasks are private access to a database, and secure identification. Quantum communication…

In this paper, we derive key-rate expressions for different quantum key distribution protocols. Our key-rate equations utilize multiple channel statistics, including those gathered from mismatched measurement bases - i.e., when Alice and…

The safety of a quantum key distribution system relies on the fact that any eavesdropping attempt on the quantum channel creates errors in the transmission. For a given error rate, the amount of information that may have leaked to the…

The implementation of error correction protocols is a central challenge in the development of practical quantum information technologies. Recently, multi-level quantum resources such as harmonic oscillators and qudits have attracted…

We consider the problem of secure identification: user U proves to server S that he knows an agreed (possibly low-entropy) password w, while giving away as little information on w as possible, namely the adversary can exclude at most one…

We consider the implementation of two-party cryptographic primitives based on the sole assumption that no large-scale reliable quantum storage is available to the cheating party. We construct novel protocols for oblivious transfer and bit…

As an essential application of quantum mechanics in classical cryptography, quantum secret sharing has become an indispensable component of quantum internet. Recently, a differential phase shift quantum secret sharing protocol using a twin…

We introduce a new quantum key distribution protocol that uses d-level quantum systems to encode an alphabet with c letters. It has the property that the error rate introduced by an intercept-and-resend attack tends to one as the numbers c…

We show that superselection rules do not enhance the information-theoretic security of quantum cryptographic protocols. Our analysis employs two quite different methods. The first method uses the concept of a reference system -- in a world…

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…