CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 6: Simon's algorithm
February 2, 2006 The reason why we looked at the particular "black-box" problems from the previous couple of lectures is because they give examples in which
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 20: Bell inequalities and nonlocality
April 4, 2006 So far in the course we have considered uses for quantum information in the settings of computation and cryptography. In this
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 21: Quantum communication complexity
April 6, 2006 In this lecture we will discuss how quantum information can allow for a significant reduction in the communication costs assoc
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 17: General quantum errors; CSS codes
March 23, 2006
General quantum errors
In the previous lecture we discussed Shor's 9 qubit code, which can be viewed as an encoding of one q
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 22: Quantum computational complexity
April 11, 2006 This will be the last lecture of the course-I hope you have enjoyed the lectures. There is still much that we have not had ti
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 16: Quantum error correction
March 21, 2006 Any physical realization of a quantum computer is likely to be susceptible to errors (such as noise and inaccuracies)-we cannot build
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 18: Quantum Key Distribution
March 28, 2006 In this lecture we will begin discussing quantum cryptography. There are indeed many aspects to cryptography, and many different cryp
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 12: Grover's Algorithm
March 7, 2006 We have completed our study of Shor's factoring algorithm. The basic technique behind Shor's algorithm, which we described in terms of phase
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 14: Quantum information revisited
March 14, 2006 So far, this course has focused almost entirely on quantum algorithms. The next topics to be discussed will be of a somewhat dif
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 13: Grovers Algorithm (continued)
March 9, 2006 In the previous lecture we stated Grovers Algorithm and began analyzing it. Today we will complete this analysis and discuss how
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 15: Quantum information revisited (continued)
March 16, 2006 More on the partial trace In the previous lecture we were discussing an important admissible operation called the pa
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 11: Order nding (continued); reducing factoring to order nding
March 2, 2006
Solving order nding using phase estimation (continued)
We will begin this lecture by nishing the dis
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 7: Arithmetic/number-theoretic problems; reversible computation
February 9, 2006
Arithmetic/number-theoretic problems
Before we move on to Shor's Algorithm, we need to understan
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 8: Phase estimation
February 14, 2006 Last time we discussed reversible computation. We established that any classical Boolean circuit can be converted to a reversible (and ther
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 9: Phase estimation (continued); the quantum Fourier transform
February 16, 2006
Phase estimation (continued)
In the previous lecture we discussed phase estimation. Recall that
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 10: Order finding
February 28, 2006
The Order Finding problem
Now that we have discussed the phase estimation technique, it is time to apply it to an interesting computational p
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 5: A simple searching algorithm; the Deutsch-Jozsa algorithm
January 31, 2006 In the previous lecture we discussed Deutschs Algorithm, which gives a simple example of how quantu
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 1: Overview of quantum information
January 10, 2006
References
Most of the material in these lecture notes is discussed in greater detail in the following two books,
which I rec
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 4: Quantum Teleportation; Deutschs Algorithm
January 26, 2006
Quantum teleportation
Suppose Alice has a qubit that she wants to send to Bob. Let us say that the state of the qub
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 2: Overview of quantum information (continued)
January 12, 2006 In the previous lecture we started discussing the basics of quantum information, beginning with the example of si
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 3: Superdense coding, quantum circuits, and partial measurements
January 24, 2006
Superdense Coding
Imagine a situation where two people (named Alice and Bob) are in different p
CPSC 519/619: Quantum Computation
John Watrous, University of Calgary
Lecture 19: Impossibility of Quantum Bit Commitment
March 30, 2006 In the previous lecture we discussed the BB84 quantum key-distribution protocol, which allows two physically separated