Book Image

Dancing with Qubits

By : Robert S. Sutor
5 (1)
Book Image

Dancing with Qubits

5 (1)
By: Robert S. Sutor

Overview of this book

Quantum computing is making us change the way we think about computers. Quantum bits, a.k.a. qubits, can make it possible to solve problems that would otherwise be intractable with current computing technology. Dancing with Qubits is a quantum computing textbook that starts with an overview of why quantum computing is so different from classical computing and describes several industry use cases where it can have a major impact. From there it moves on to a fuller description of classical computing and the mathematical underpinnings necessary to understand such concepts as superposition, entanglement, and interference. Next up is circuits and algorithms, both basic and more sophisticated. It then nicely moves on to provide a survey of the physics and engineering ideas behind how quantum computing hardware is built. Finally, the book looks to the future and gives you guidance on understanding how further developments will affect you. Really understanding quantum computing requires a lot of math, and this book doesn't shy away from the necessary math concepts you'll need. Each topic is introduced and explained thoroughly, in clear English with helpful examples.
Table of Contents (16 chapters)
Preface
13
Afterword

7.2 Bras and kets

When we previously looked at vector notation in section 5.4.2

pict

We now add two more which were invented by Paul Dirac, an English theoretical physicist, for use in quantum mechanics. They simplify many of the expressions we use in quantum computing.

Given a vector v = (v1, v2, …, vn), we denote by v|, pronounced ‘‘bra-v’’, the row vector

display math
where we take the complex conjugate of each entry. Similarly, |w, pronounced ‘‘ket-w’’, is the column vector
display math
without the conjugations, where w = (w1, w2, …, wm). |vw| is the outer product
display math

When n = m, the bra-ket v | w = v|  |w = (v|) (|w) is the usual inner product.

v | w = <v, w> = v1 w1 + v2 w2 + ··· vn wn ...