Search
Search results
-
Oblivious transfer
... multiparty computation protocol (including, e.g., bit commitment ). It exists various versions of OT primitives, whose ... following. Rabin OT : Alice chooses as input one bit b . Then, with probability 1/2, Bob gets the bit b , and ...
Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments
-
BB84 and Ekert91 protocols
... ] 1.bases: 1.1 horizontally (0°) Bit:0 1.2 vertically (90°) Bit:1 '''2.bases: ''' 2.1 + 45° Bit:0 2.2 -45° Bit:1 She chooses an arbitrary basis for her bits and ...
Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments
-
Super-dense coding
... two parties gives a maximum rate of communication of one bit per qubit (by the HSW Theorem). If the sender's qubit is maximally ... unitary operations corresponding to the different two bit strings. The operations consist of the identity (doing nothing), a bit flip ...
Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments
-
Communication protocols between mistrustful parties
... parties. Typical examples for such protocols are bit commitment , coin tossing , oblivious transfer , or, more generally, ...
Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments
-
The Holevo bound
... it says that one qubit can contain at most one bit of information. For example, consider a classical message, labelled ...
Wiki article - Anonymous (not verified) - 18/08/2020 - 15:00 - 0 comments
-
Basic concepts in quantum computation
... x n − 1 , …, x 0 ) is taken bit by bit: y ⋅ x = ( y n − 1 x n ...
Wiki article - Anonymous (not verified) - 04/01/2016 - 11:49 - 0 comments
-
Quantum Fourier transform
... x_i\in\{0,1\} where x_i is the i^{th} least significant bit. The decimal and binary descriptions can be related by ... if we have a register of n qubits where the most significant bit of the input is at the top, and the least significant bit at the bottom, then we shall read our output as having the least ...
Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments
-
Quantun Arithmetic and Logic
... Addition, subtraction, multiplication and division are multi-bit operations that are implemented as a series of lower level logical ... not all. Most notably, while you can always copy a classical bit, it is not always possible with a quantum bit. On a classical computer ...
Forum topic - Djcn - 26/10/2015 - 17:08 - 1 comment
-
Strong coin tossing
... have been introduced to achieve this. One is based on bit commitment, the other on sharing entanglement. For weak coin tossing, ... parties, Alice and Bob, wish to generate a shared random bit. We consider a model in which they do not initially share any resources, ...
Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments
-
Error Correction
... take a majority vote; i.e. if, say, one copy says, the bit is a 0, and two others claim it to be a 1, then probably all three were a 1 and the first bit got corrupted. However, this is not possible with quantum information, ...
Wiki article - Jono - 26/10/2015 - 17:56 - 0 comments