Klik op een omslag om naar Google Boeken te gaan.
|
Bezig met laden... Quantum Computer Science: An Introductiondoor N. David Mermin
   Bezig met laden...
 Meld je aan bij LibraryThing om erachter te komen of je dit boek goed zult vinden. Op dit moment geen Discussie gesprekken over dit boek.  antao | Sep 24, 2020 |  geen besprekingen | voeg een bespreking toe
In the 1990's it was realized that quantum physics has some spectacular applications in computer science. This book is a concise introduction to quantum computation, developing the basic elements of this new branch of computational theory without assuming any background in physics. It begins with an introduction to the quantum theory from a computer-science perspective. It illustrates the quantum-computational approach with several elementary examples of quantum speed-up, before moving to the major applications: Shor's factoring algorithm, Grover's search algorithm, and quantum error correction. The book is intended primarily for computer scientists who know nothing about quantum theory, but will also be of interest to physicists who want to learn the theory of quantum computation, and philosophers of science interested in quantum foundational issues. It evolved during six years of teaching the subject to undergraduates and graduate students in computer science, mathematics, engineering, and physics, at Cornell University. Geen bibliotheekbeschrijvingen gevonden. |
Actuele discussiesGeenPopulaire omslagen 
 Google Books — Bezig met laden...GenresDewey Decimale Classificatie (DDC)004.1Information Computer Science; Knowledge and Systems Computer science By Computer TypeLC-classificatieWaarderingGemiddelde: (3.5)
Ben jij dit?Word een LibraryThing Auteur. |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
1
1. We have a randomized ASCII extended string X1 transforming the plaintext.
2. We have a randomized ASCII extended string X2 creating the key characters.
X1 & X2 = n (0 to 255)
X1 (n 0 - 255) + X2 (n 0 - 255) = X3 | Mod256
That is all we need to understand when using modular arithmetic. For example let the character E on our first string X1 be at position 228 and the first character K on our second string X2 which holds the value of 075.
228 + 075 = 303 | Mod256
256 -
47 =
In the extended ASCII table 47 represents '/ ' and that is the only information an attacker would gain intercepting a cipher. Every new plaintext character is encrypted in a new unique permutation, changing the statistical properties this character holds.
Now let's look at Shannon's entropy H ( ) which has become H (M |C) = H (M).
H (M) = - ∑ (P (M) log (P (M)
H (K) = - ∑ (P (K) log (P (K)
RMLM ≤ RKLK
I must send this to Mermin. (