I've put my lecture notes from my Fall 2022 Quantum Computation course online.
math.mit.edu/~shor/435-LN/
I don't guarantee that there aren't any mistakes left in them, although I've tried to eradicate them all. If you find any, feel free to email me.
Peter Shor
1,091 posts
♫♫ There's a rich man who's sure that all speech should be free
And he's buying the network of Twitter.
(And because of this sale, you'll find me on bluesky.)
Joined June 2019
- True story: When I was checking into a hotel in Atlanta, GA, I was asked "Can I have your name, please." I replied "Shor." Then there was a long pause.@PeterShor1 so which one do you like better?
- 35 years ago today, Richard Feynman's paper "Quantum Mechanical Computers" was published in 𝘖𝘱𝘵𝘪𝘤𝘴 𝘕𝘦𝘸𝘴. I think he'd be surprised and gratified to see everything that his original idea has led to.
- 40 years ago IBM and MIT held a 𝘗𝘩𝘺𝘴𝘪𝘤𝘴 𝘢𝘯𝘥 𝘊𝘰𝘮𝘱𝘶𝘵𝘢𝘵𝘪𝘰𝘯 conference, where Feynman gave his seminal keynote address, later published in the 𝘐𝘯𝘵. 𝘑. 𝘛𝘩𝘦𝘰𝘳. 𝘗𝘩𝘺𝘴. Next Thursday, they are holding a 40th anniversary conference: qiskit.org/events/physics…
- When I was working on my quantum algorithm for factorization, I didn't tell anybody, because it seemed like such a long shot. Similarly, Wiles didn't tell anybody that he was working on Fermat's Last Theorem before he solved it, presumably for the same reason.
- Wonderful article about recent progress in theoretical cryptography and complexity theory (although we're still really a long way from proving P ≠ NP).For more than 50 years, complexity theorists have tried and failed to solve the foundational question of their field. Why is it so hard to prove hardness? @benbenbrubaker reports: quantamagazine.org/complexity-the…
00:00 - Quanta Magazine's story on the discovery of the Ising model, and how it revolutionized the field of statistical mechanics. quantamagazine.org/the-cartoon-pi… via @QuantaMagazine
- Replying to @PeterShor1To celebrate this anniversary, I have summarized Feynman's paper in 4 lines of #quantumpoetry: With our computers, we can’t model Nature; To simulate her faithfully, we must Go where she lives, and grasp her hand, and make her, With clever tricks, perform the task for us.
- Replying to @PeterShor1I am sure lots of mathematicians are currently working on famous problems without telling anybody. Is this a good aspect of the culture of mathematics? Maybe if all the mathematicians working secretly on the Riemann hypothesis got together and compared notes, they could solve it.
- With the Google quantum supremacy paper, the claims that quantum computers can’t possibly work keep on coming. It is becoming clear that reasoned arguments will not stop them. I don’t think illogical poetry is going to work, either. But it’s fun to write.
- I find superdetermism just as "spooky" as Einstein's action at a distance ... it implies that decisions you think are being made at a given moment (say you set detector angles by rolling dice) actually were predetermined. If this isn't "spooky", I don't know what is.Replying to @skdhOkay, to finish, another word on superdeterminism. If you want a local explanation of the observations of Aspect, Clauser, and Zeilinger -- ie, one without "spooky action" -- then the only currently known way to do this is superdeterminism. 13/
- With respect to the recent Supreme Court decision, if it's legal to give preferential admissions to people whose grandfather went to Harvard, shouldn't it also be legal to give preference to people whose great-great-great-great-great-grandparents were enslaved?
- Great advice! If you think about a mathematical problem on your own first, you may come up with new ideas. Next, look at the literature to find the old ideas people have already tried. If you're lucky, you will see how to combine your new ideas with their old ideas to solve it.How to use the research literature. When approaching a difficult mathematical problem, first think deeply upon it on your own, using all the ideas you can muster, before consulting the work of others. Push your own ideas as hard as you can first, and read only afterward.
- A 256-qubit "analog" quantum computer. nature.com/articles/s4158…







