Bluehost seems to be holding my domain name hostage, I gather in an effort to sell me more products and services. Avoid them at all costs. But see if I care. Hereafter you can find my web page at jhwatrous.github.io in case you're looking for it.

John Watrous@johnwatrous.bsky.social · last yr.

I ditched my old website and created a new one on GitHub Pages: johnwatrous.com It's a great option for a static web page, particularly if you like to do your own CSS styling rather than flipping through pre-built templates that are never quite right.

I ditched my old website and created a new one on GitHub Pages: johnwatrous.com It's a great option for a static web page, particularly if you like to do your own CSS styling rather than flipping through pre-built templates that are never quite right.

After 3 1/2 years of work my course on quantum computing is finally finished — the "Director's Cut" of Understanding Quantum Information and Computation is now available. arxiv.org/abs/2507.11536

Understanding Quantum Information and Computation

This is a course on the theory of quantum computing. It consists of 16 lessons, each with a video and written component, covering the basics of quantum information, quantum algorithms (including query...

arxiv.org

I've been revamping and updating my collection of selected references to topics in quantum information on my homepage. Comments, feedback and suggestions welcome! felixleditzky.info/selected_ref...

Excellent lecture notes by Richard Kueng on theory of computing and quantum computing.

Richard Kueng@richardkueng.bsky.social · last yr.

Last fall I taught two big classes on **computational complexity** (left selfie) and **quantum computing** (right selfie). We had a blast! Lecture notes are here: www.jku.at/fileadmin/gr..., www.jku.at/fileadmin/gr.... It was a lot of work, but now I am happy+proud to share them. Feedback welcome!

Totally awesome. And be sure to check out Nathaniel's 140 other videos on calculus, linear algebra, and Conway's game of life. Thank you Nathaniel for making these videos available to the community. And for QETLAB! www.youtube.com/@NathanielMath njohnston.ca/my-websites/

Nathaniel Johnston

I am an Associate Professor of Mathematics at Mount Allison University in New Brunswick, Canada. Most of my videos are lectures that are meant to accompany undergraduate courses that I teach.

youtube.com

Nathaniel Johnston@njohnston.ca · 2y ago

I'm teaching Vector Calculus this semester (for the first time, somehow!) and making lecture videos to accompany the course. The first video is now up, with about 3 per week planned (35 to 40 total): www.youtube.com/watch?v=VbDE... The videos make huge use of @desmos.com #ITeachMath #EduSky

For getting unexciting stuff done, nothing works better for me than setting a timer: 10 minutes, 90 minutes, whatever makes sense. When time's up, I move on to something else and repeat later. It's remarkable what you can accomplish when you just put in the minutes.

Now in one place, my sixty favorite theorems covering the six decades of computational complexity. blog.computationalco...

Overleaf's down, so I'm cancelling research for the day. Everyone go home and play Slay the Spire.

John Watrous@johnwatrous.bsky.social · 2y ago

It is my honest opinion that Slay the Spire is one of the greatest games of all time. Greater than infinite replay value — it gets better the more you play. And please don't say Balatro, that game is pretty good but not as good. Just my opinion.

It is my honest opinion that Slay the Spire is one of the greatest games of all time. Greater than infinite replay value — it gets better the more you play. And please don't say Balatro, that game is pretty good but not as good. Just my opinion.

I just set the maximum possible bounty on a Quantum Computing Stack Exchange problem. I could answer myself, but I know many others could too, and this seemed like fun. quantumcomputing.stackexchange.com/questions/40...

What is the complexity of modulo order-finding problem on classical computer?

It doesn't seem to be NP-complete. But has it been proved to be NP-hard?

quantumcomputing.stackexchange.com