1![Lecture 27, Thurs April 27: Quantum Error Correction At the end of the last lecture, we discussed some of the difficulties with achieving a quantum speedup using currently available quantum computing devices, like D-Wave Lecture 27, Thurs April 27: Quantum Error Correction At the end of the last lecture, we discussed some of the difficulties with achieving a quantum speedup using currently available quantum computing devices, like D-Wave](https://www.pdfsearch.io/img/615a9c38cd964372b31977d28ba006ea.jpg) | Add to Reading ListSource URL: www.scottaaronson.comLanguage: English - Date: 2018-08-26 18:23:59
|
---|
2![Lecture 21, Thurs April 6: Continued Fractions, Shor Wrap-Up Today we’ll finish Shor’s algorithm and then discuss some of its implications. Last we saw our protagonists, they were in a superposition of the form |r Lecture 21, Thurs April 6: Continued Fractions, Shor Wrap-Up Today we’ll finish Shor’s algorithm and then discuss some of its implications. Last we saw our protagonists, they were in a superposition of the form |r](https://www.pdfsearch.io/img/c58e1353feb80978cf6ac5cafc163772.jpg) | Add to Reading ListSource URL: www.scottaaronson.comLanguage: English - Date: 2018-08-26 18:23:33
|
---|
3![Lecture 14, Thurs March 2: Nonlocal Games Last time we talked about the CHSH Game, and how no classical strategy lets Alice and Bob win it more than 75% of the time. Today we’ll see how, by using entanglement, they can Lecture 14, Thurs March 2: Nonlocal Games Last time we talked about the CHSH Game, and how no classical strategy lets Alice and Bob win it more than 75% of the time. Today we’ll see how, by using entanglement, they can](https://www.pdfsearch.io/img/2cf2a7bb995b48bf1e1ae67824f310b5.jpg) | Add to Reading ListSource URL: www.scottaaronson.comLanguage: English - Date: 2018-10-17 18:15:30
|
---|
4![Lecture 18, Tues March 28: Bernstein-Vazirani, Simon We ended last time with the Deutsch-Jozsa problem. Today we’ll start with another black-box problem for which quantum algorithms provide an advantage: The Bernstein- Lecture 18, Tues March 28: Bernstein-Vazirani, Simon We ended last time with the Deutsch-Jozsa problem. Today we’ll start with another black-box problem for which quantum algorithms provide an advantage: The Bernstein-](https://www.pdfsearch.io/img/3d78e4d05b57c70f255a2c2bb5b15ef4.jpg) | Add to Reading ListSource URL: www.scottaaronson.comLanguage: English - Date: 2018-08-26 18:23:23
|
---|
5![Lecture 20, Tues April 4: Shor, Quantum Fourier Transform Last time we started in on Shor’s algorithm, a quantum algorithm that can factor N into p×q in polynomial time by reducing the problem to per Lecture 20, Tues April 4: Shor, Quantum Fourier Transform Last time we started in on Shor’s algorithm, a quantum algorithm that can factor N into p×q in polynomial time by reducing the problem to per](https://www.pdfsearch.io/img/37200a33ea2140f7049cdd65cfc406cb.jpg) | Add to Reading ListSource URL: www.scottaaronson.comLanguage: English - Date: 2018-08-26 18:23:30
|
---|
6![Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve NP-co Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve NP-co](https://www.pdfsearch.io/img/f097bee43f8e783a2ae904b2e6938779.jpg) | Add to Reading ListSource URL: www.scottaaronson.comLanguage: English - Date: 2018-09-06 04:47:45
|
---|
7![Lecture 13, Tues Feb 28: Hidden Variables, Bell’s Inequality In the last lecture, we discussed four different attitudes people take toward quantum mechanics: Copenhagen, “shut up and calculate,” dynamical collapse, Lecture 13, Tues Feb 28: Hidden Variables, Bell’s Inequality In the last lecture, we discussed four different attitudes people take toward quantum mechanics: Copenhagen, “shut up and calculate,” dynamical collapse,](https://www.pdfsearch.io/img/79a209ae6d1d7793be41dc57f1a89b41.jpg) | Add to Reading ListSource URL: www.scottaaronson.comLanguage: English - Date: 2018-10-17 18:15:24
|
---|
8![The Nature of Experience—Lecture 8 © 1999 Eido Michael Luetchford The last time we had a talk I talked about the nature of science and how science depends on language to create an objective model of the world, follow The Nature of Experience—Lecture 8 © 1999 Eido Michael Luetchford The last time we had a talk I talked about the nature of science and how science depends on language to create an objective model of the world, follow](https://www.pdfsearch.io/img/3a0e87484ac2cbefedab31c4e6425f5f.jpg) | Add to Reading ListSource URL: www.dogensangha.org.ukLanguage: English - Date: 2014-01-22 07:21:24
|
---|
9![ECE 174 Homework # 5 – Due Thursday, December 7, 2017 Comments and Reading This is the last homework assignment. Although it is due on Thursday of the 10th week of the quarter (i.e., on the very last lecture of the qua ECE 174 Homework # 5 – Due Thursday, December 7, 2017 Comments and Reading This is the last homework assignment. Although it is due on Thursday of the 10th week of the quarter (i.e., on the very last lecture of the qua](https://www.pdfsearch.io/img/7354899b3873258f474d025d88fe68a4.jpg) | Add to Reading ListSource URL: dsp.ucsd.eduLanguage: English - Date: 2017-11-22 12:53:32
|
---|
10![CS364A: Algorithmic Game Theory Lecture #17: No-Regret Dynamics∗ Tim Roughgarden† November 18, 2013 This lecture continues to study the questions introduced last time. Do strategic players reach an equilibrium of a g CS364A: Algorithmic Game Theory Lecture #17: No-Regret Dynamics∗ Tim Roughgarden† November 18, 2013 This lecture continues to study the questions introduced last time. Do strategic players reach an equilibrium of a g](https://www.pdfsearch.io/img/3b709b760092f7770bf5b8c2d806502d.jpg) | Add to Reading ListSource URL: theory.stanford.edu- Date: 2016-08-30 19:06:23
|
---|