Category: QuantumProtocolZoo

implements Byzantine Agreement Introduction This protocol is an efficient solution to the classical task of Byzantine Agreement. It allows multiple players in a network to reach an agreement in the presence of some faulty players. The protocol solves the task in the strongest possible failure model (called Byzantine failures). The quantum protocol is provably faster…

implements Weak String Erasure Introduction This protocol implements Weak String Erasure (WSE) in a prepare-and-measure setup. This is often used as a subroutine in other protocols. Related Paper(s) Unconditional Security From Noisy Quantum Storage Outline Alice and Bob first agree on a duration $\Delta_t$ that should correspond to an estimation of the time needed to…

implements Authentication of Quantum Messages Introduction The Trap Code is a non-interactive scheme for quantum authentication. It appends two additional trap registers in a fixed state, on which a Pauli twirl or a permutation is acted on. It furthermore makes use of error correction codes for encoding the quantum message.   Related Paper(s) acheck Outline…

implements Entanglement Routing Introduction This protocol [1] implements the functionality of Entanglement Routing. They develop routing protocols considering different types of path discovery algorithms, considering a continuous model in which entanglement between a subset of the nodes is produced continuously in the background and an on-demand model where entanglement production starts when a request is…

implements Authentication of Quantum Messages Introduction This protocol provides a non-interactive scheme with classical keys for the sender to encrypt as well as authenticate quantum messages. This was to achieve the task of authentication for quantum states, i.e. it gives the guarantee that the message sent by a party (suppliant) over a communication line is…

implements Entanglement Routing Introduction This protocol [1] implements the task of distributing arbitrary graph states over quantum networks of arbitrary topology. The goal is to distribute these states in a way that is most efficient in terms of the number of Bell pairs consumed and the number of operations realised by the protocol.   Related…

implements Anonymous Transmission Introduction This example protocol implements the task of Anonymous Transmission in a multi-node quantum network. The protocol uses an untrusted $n$-partite GHZ state to enable two nodes, Sender and Receiver, to establish a link which they use to transmit a quantum message. In addition to adversarial nodes, the source of the GHZ…

implements Anonymous Transmission Introduction This protocol is a subroutine that allows the anonymous distribution of a GHZ state between $m+1$ parties, starting from an $n$-party GHZ state. It is used in the protocol: Anonymous Conference Key Agreement using GHZ states Related Paper(s) Anonymous quantum conference key agreement Outline The entanglement source generates and distributes sufficient…

implements Quantum Conference Key Agreement Introduction This protocol achieves the functionality of quantum conference key agreement. This protocol allows multiple parties in a quantum network to establish a shared secret key anonymously. Related Paper(s) Anonymous Conference Key Agreement in Quantum Networks Outline First, the sender notifies each receiver in the network anonymously The entanglement source…