Skip to main content

Quantum Class 2, Thu 2020-09-03

1 Handwritten notes, video transcripts, and other files

They are accessible from the Files tab on the top menu bar.

So far, they include scans of my handwritten notes during the lectures, and webex's attempt at a written transcript of the lecture videos. It's actually useful.

3 Asking questions in class

Please ask questions. I try to have the chat window open most of the time. If I ignore you, ok to unmute your mike to ask a question.

Constructive opinions and comments are also welcome.

5 Class 1 extras

5.1 Youtube videos to watch

These are the ones I tried unsuccessfully to show in class 1.

A beginner's guide to quantum computing | Shohini Ghose https://www.youtube.com/watch?v=QuR969uMICM 10:04

Quantum Computing in Under 11 Minutes daytonellwanger

https://www.youtube.com/watch?v=TAzZKAdX2Tw 10:56 more technical

5.3 Review

5.3.1 Classical computation

  1. Bit.

  2. Its 2 possible values are 0 or 1.

  3. Byte.

  4. Has 8 bits.

  5. It has 256 possible values.

  6. Bits are transformed with gates, like nand, nor, and, or, xor, not, ...

  7. They generally destroy info, and are not invertible.

  8. More complex circuits, like adders, are formed from a combo of these gates.

5.3.2 Quantum computation

  1. Qbit, $q$.

  2. Its state is a linear combo of two basis states, $|0>$ and $|1>$:

    $q = a|0> + b|1>$ ,

    where $a$ and $b$ are complex numbers, and $ | a | ^2 + | b | ^2 = 1$.

  3. IOW, its state is a superposition of those two basis states, with those weights.

  4. It is wrong to think that $q$ is really in one of the two states, but you don't know which one. This is the hidden variable theory. It has been proved experimentally to be false.

  5. $q$ is really in both states simultaneously.

    Alice laughed. "There's no use trying," she said: "one can't believe impossible things." "I daresay you haven't had much practice," said the Queen. "When I was your age, I always did it for half-an-hour a day. Why, sometimes I've believed as many as six impossible things before breakfast." - Through the Looking-Glass, and What Alice Found There (1871), by Lewis Carroll (Charles Lutwidge Dodgson).

  6. You cannot observe its state, unless it is $|0>$ and $|1>$, in which case you observe $0$ or $1$. This is the classical case.

  7. Otherwise you observe it with a measurement operator that transforms it to either $|0>$ and $|1>$, with probabilities

    $| a | ^2$ and $| b | ^2 = 1$, respectively.

  8. $a$ and $b$ are complex.

  9. That measurement changes $q$; it no longer has its old value.

  10. $q$, that is, $q$ 's value, can be considered to be a vector of length one: $$\begin{pmatrix} a | 0> \\ b | 1> \end{pmatrix} $$ or simply $$\begin{pmatrix}a\\b\end{pmatrix}$$.

  11. You operate on $q$ with a matrix multiplication: $q_2 = M q$.

  12. This changes $q$; the old value is no longer available.

  13. No cloning: You cannot copy a qbit, but can move it.

  14. The life cycle of a qbit:

    1. Create a qbit with a classical value, 0 or 1.

    2. Operate on it with matrices, which rotate it to have complex weights.

    3. Transform it back to 0 or 1 and read it.

  15. So far, not very powerful.

  16. Now, let $q$ be a system with two qbits, i.e., a 2-vector of qbits.

6 Next class

Class 3 is on Tues Sept 8 because of Labor Day

7 Today

7.1 More 1-qbit gates

square root of not

phase shift

7.2 Entanglement

Crazy counterintuitive idea that's the basis for quantum speedup.

Classical metaphor for entanglement:

  1. Start with a piece of paper.

  2. Tear it into two halves.

  3. Put each half into an envelope, seal them, and mix them up, so that you can't tell which half is in which envelope.

  4. Address and mail one envelope to a friend in Australia, and the other to a friend in Greenland.

  5. When the Australian opens his envelope, he knows what the Greenlander will find in his.

  6. However that doesn't let the Australian send any info to the Greenlander, or vv.

  7. This has been demonstrated with real qbits transported 1000 miles apart.

  8. Entanglement means that if you measure one qbit then what you observe restricts what would be observed when you measure the other qbit.

  9. However that does not let you communicate.

7.3 Two qbit operators

  1. Now, let $q$ be a system with two qbits, i.e., a 2-vector of qbits.

  2. $q$ is now a linear combo of 4 basis values, $ | 00>$, $ | 01>$, $ | 10>$, $ | 11>$.

  3. $q = a_0 | 00> + a_1 | 01> + a_2 | 10> + a_3 | 11> $

  4. where $a_i$ are complex and $ \sum | a_i | ^2 = 1$.

  5. $q$ exists in all 4 states simultaneously.

  6. If $q$ is a vector with n component qbits, then it exists in $2^n$ states simultaneously.

  7. This is part of the reason that quantum computation is powerful.

  8. A measurement operator applied to $q$ will rotate it to a basis {00, 01, 10, 11}, so that it will be observed in one of those four cases, with probabilities $ | a_i | ^2$.

  9. You operate on $q$ by multiplying it by a 4x4 matrix operator.

  10. The matrices are all invertible, and all leave $ | q | = 1$.

  11. You set the initial value of $q$ by setting its two qbits each to 0 or 1.

  12. How this is done depends on the particular hw.

  13. I.e., initially, $q_1 = \begin{pmatrix}a_1 | 0> \\b_1 | 1> \end{pmatrix}$ and $q_2 = \begin{pmatrix}a_2 | 0> \\b_2 | 1> \end{pmatrix}$, and so

    $$q = \begin{pmatrix} q_1 \\ q_2 \end{pmatrix} = \begin{pmatrix} a_1 a_2 | 00 > \\ a_1 b_2 | 01 > \\ a_2 b_1 | 10 > \\ b_1 b_2 | 11 > \end{pmatrix}$$.

  14. Here, the combined state is the tensor product of the individual qbits.

  15. For $n$ qbits, the tensor product is a vector with $2^n$ elements, one element for each possible value of each qbit.

  16. Each element of the tensor product has a complex weight.

  17. You transform a state by multiplying it by a matrix.

  18. The matrix is invertible.

  19. The transformation doesn't destroy information.

  20. When you measure a state, it collapses into one of the component states. (This may be inaccurate.)

  21. You don't need to bring in consciousness etc. The collapse happens because the measurement causes the state to interact with the outside world.

  22. The probability of collapsing into a particular state is the squared magnitude of its complex weight.

  23. For some sets of weights, particularly after a transformation, the combined state cannot be separated into a tensor product of individual qbits. In this case, the individual qbits are entangled.

  24. That is the next part of why quantum computation is powerful.

  25. Entanglement means that if you measure one qbit then what you observe restricts what would be observed when you measure the other qbit.

  26. However that does not let you communicate.

  27. From page 171 of

    Quantum Computing for Computer Scientists 1st Edition

    All quantum algorithms work with the following basic framework:

    1. The system will start with the qubits in a particular classical state.

    2. From there the system is put into a superposition of many states.

    3. This is followed by acting on this superposition with several unitary operations.

    4. And finally, a measurement of the qubits.

    1. Ways to look at measurement:

      1. Converts qbit to classical bit.

      2. Is an interaction with the external world.

      3. Information is not lost, but leaks into the external world.

      4. Is an operator represented by a matrix.

      5. that is Hermitian, i.e., it's equal to its complex transpose.

      6. For physical systems, some operators compute the system's momentum, position, or energy.

      7. The matrix's eigenvalues are real.

      8. The result of the operation is one of the eigenvalues.

  28. More from

    Quantum Computing for Computer Scientists 1st Edition

    1. Compare byte with qbyte.

    2. State of byte is 8 bits.

    3. State of qbyte is 256 complex weights.

    4. They all get modified by each operation (aka matrix multiply).

    5. That is the power of quantum computing.

  29. The current limitations are that IBM does only a few qbits and that the operation is noisy.