Category: QuantumProtocolZoo
-
Quantum Collision Detection
implements Anonymous Transmission Introduction This protocol [1] is a quantum primitive for anonymous networks that allows a group of $n$ players to determine whether more than one player wishes to send at the same time. In other words, it detects whether a collision has occurred among potential senders, while preserving sender anonymity. The protocol is…
-
Quantum Error Correction
Introduction Quantum error correction is a local subroutine used to protect quantum states against noise, decoherence, and imperfect operations. Unlike classical error correction, it cannot work by directly copying or measuring the protected information. Instead, the quantum state is encoded into a larger Hilbert space so that errors can be detected and corrected without revealing…
-
Quantum One-Time Pad
implements Quantum Encryption Introduction This protocol [1]Â implements the task of private quantum communication, also known as a private quantum channel. It allows a sender and a receiver who share a uniformly random classical secret key to transmit an arbitrary quantum state over an insecure quantum channel in such a way that an eavesdropper learns…
-
Quantum Encryption
Functionality Description Quantum Encryption is a two-party functionality that allows the establishment of a secure quantum channel, capable of transmitting quantum (or quantumly-encoded) messages, where no information from the message is leaked to the adversary who is present on the channel. These schemes are often considered against unbounded quantum adversaries that are present on the…
-
Quantum Random Number Generation
Introduction This subroutine uses quantum resources to randomly generate numbers using a Quantum Random Number Generator (QRNG) routine. We write randomness generation instead of pseudo-random number generation as it is possible to gain `true’ randomness from a QRNG. Generating random number of the one of the most important goals of computer scientist because of its…
-
State Cloning Subroutine
Introduction The no-cloning theorem in Quantum Mechanics states that it is impossible to create a perfect copy of arbitrary unknown quantum states. However, imperfect cloning is possible in many different ways. The cloning protocols are either approximate cloning, meaning that at all the rounds they produce approximately similar copies, or they are probabilistic protocols which…
-
Classical Pseudo-Random Number Generation
Introduction Classical pseudo-random number generation runs a pseudo-random number generator (PRNG) on a classical machine that pseudo-randomly samples numbers from a space given an input seed. Outline N/A Assumptions The distribution of the numbers output from is sufficiently statistically close to random. Notation No content has been added to this section, yet! Properties No content…
-
Quantum SWAP Test
Introduction The quantum SWAP test is a basic quantum subroutine used to compare two quantum states. Given two input states, it checks if they are equal, and it estimates how close they are by measuring an auxiliary control qubit after a controlled-SWAP operation. In quantum protocols, the SWAP test can be used as a local…
-
Privacy Amplification Subroutines
Introduction Privacy amplification is a nodal subroutine in which a party, or a set of honest parties, locally compress a partially secret classical string into a shorter string that is secure against an adversary. In quantum protocols, this subroutine usually appears after measurement and classical error correction. At that point, the honest parties may share…
-
Error Correction (Classical)
Introduction Classical error correction is a nodal subroutine in which a party processes classical data in order to detect and correct errors. In quantum protocols, this subroutine often appears after a quantum communication or measurement stage, when the relevant quantum information has already been converted into classical strings. The goal is to transform noisy or…
