Search
Search results
-
LOCC operations
... the following simple example. Consider two observers, Alice and Bob , who share the two Bell state s: ... some classical communication channel (a phone or internet). Alice and Bob can choose one of the two shared states, but the information about which state it is exactly, is lacking. By using LOCC, Alice and Bob can distinguish between these two states. To do so, Alice has ...
Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments
-
Classical Entropy Measures
... be lost. For a discrete, memoryless channel, in which Alice sends a random variable drawn from X to Bob who receives Y, the channel ... Noisy channel coding theorem : Consider Alice communicate with Bob via a discrete memoryless channel which has the ...
Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments
-
Teleportation Protocol
... of this technique is to transmit one qubit between Alice and Bob by sending two classical bits. However, Alice and Bob must initially share one entangled state . Alice and Bob ...
Wiki article - Joelbloggs - 26/10/2015 - 17:56 - 0 comments
-
Enhancement of channel capacities with entanglement
... a given system, with A reserved for the sender, Alice, and B for the receiver, Bob. Given a quantum system C , ... states. The formal definition proceeds as follows. Alice and Bob are assumed to share n S ebits in the form of a ...
Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments
-
BB84 and Ekert91 protocols
... proposed a protocol for a secret key exchange between Alice and Bob in 1984 (BB84). Today's (symmetrical) cryptography algorithms ... key and the whole encoding is for nothing. And what's worse: Alice and Bob never know that they have another listener. One solution to key ...
Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments
-
Coin tossing
... behind this, consider the following scenario. Assume that Alice and Bob, freshly divorced, want to decide on the phone who of them gets ... of a coin tossing protocol is based on bit commitment . Alice first chooses a random bit r 1 and then uses the bit ...
Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments
-
Quantum Cryptography
... same state, and by listening to the communication between Alice and Bob, she know everything she needs to know to measure the qubits in ... but through error correction it can be shown that Alice and Bob can correct down to the point that Eve has zero usable ...
Forum topic - Ferzle - 26/10/2015 - 17:08 - 2 comments
-
Oblivious transfer
... primitive between two parties, in the following called Alice and Bob. OT can be used as a building block for any arbitrary ... of them is explained in the following. Rabin OT : Alice chooses as input one bit b . Then, with probability 1/2, Bob gets ...
Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments
-
Key distribution via entanglement
... how keys are sent via quantum entanglement. So that Alice and Bob each receive one of the entangled bits, and upon measuring it, ... states to make all the bits the same i think, so if Alice reads a 0 everyone else using the same basis as her reads 0, and make the ...
Forum topic - Snow - 26/10/2015 - 17:08 - 1 comment
-
The no-cloning theorem
... experiment , and suppose quantum states could be cloned. Alice could send bits to Bob in the following way: If Alice wishes to transmit a "0", she measures the spin of her electron in the ...
Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments