Search
Search results
-
Quantum cryptography
... effort to realize other cryptographic tasks such as bit commitment . Unfortunately, it turned out that quantum mechanics is not as ...
Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments
-
Quantum Cryptography
... Actually, the real security of BB84 lies in a bit of random guesswork combined with error correction. It is assumed that Eve ... normalization due to formatting). If Bob measures this bit in the +/- basis he should get the outcome |+> with probability 1 if there ...
Forum topic - Ferzle - 26/10/2015 - 17:08 - 2 comments
-
Quantum error correction and fault-tolerance
... n can be represented by a pair of n -bit binary vectors ( p X ∣ p Z ) where p X ... t + 1 , the quantum code can correct t bit flip ( X ) errors, just as could the classical code. If we want ...
Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments
-
What is Quantum Computation?
... What are qubits? From a physical point of view a bit is a physical system which can be prepared in one of the two different ...
Wiki article - Anonymous (not verified) - 02/11/2015 - 02:31 - 0 comments
-
Increase the number of qubits for QC simulator necessary ?
... follows the same steps regardless if we're adding a 8 bit or n bit number. ...
Forum topic - Ljpu - 26/10/2015 - 17:08 - 1 comment
-
Math of Quantum Information?
... are found on exampleproblems.com and I've also taken a bit of effort to construct a largely incomplete list of links and references ... at least) is mathematical analysis, and this subject feels a bit more like high level algebra (though you still compute derivatives and ...
Forum topic - Wesley - 26/10/2015 - 17:08 - 8 comments
-
Secure two party classical computation: overview
... version of oblivious transfer (OT), in which Alice inputs a bit, Bob inputs nothing, Bob receives Alice's bit with probability half, and otherwise receives the outcome fail. Rudolph ...
Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments
-
Brief overview of classical cryptography
... is another sequence of 0's and 1's of the same length. Each bit of the message, or the plaintext, is then combined with the respective bit of the key, according to the rules of addition in base 2: ...
Wiki article - Anonymous (not verified) - 03/11/2015 - 01:45 - 0 comments
-
BQP
... For example, algorithms are known for factoring an n -bit integer using just over 2 n qubits. Quantum computers have gained ...
Wiki article - JMiszczak - 26/10/2015 - 17:56 - 0 comments
-
Simulation of gates
... to that paper, According to Corollary 7.4 - On an n-bit network(where n>=7), a lambda(n-2)[sigma x] gate can be simulated by 8(n-5) lambda(2)[sigma x] gates(3 bit Toffoli gates), as well as by 48n - 204 basic operations. I am able to ...
Forum topic - Quanta - 26/10/2015 - 17:08 - 0 comments