Ryan LaRose

Cheers to the first graduating class of the LANL Quantum Computing Summer School. Very fun and productive summer with many algorithms and friendships developed. Can easily see this as one of the best places to be for quantum algorithms.

Perhaps the most important thing to know about quantum channels, which describe noise in quantum computers, is they can be viewed as unitary evolution of a system + environment. We derive the Kraus representation is just a few lines from this intuition in the QC Playlist ⬇️

We reached the canonical algorithms! Shor's algorithm and Grover's algorithm explained simply, each in seven parts, on the quantum computing playlist.

Plot: Interference pattern generated by Shor's algorithm on an integer, enabling its factors to be determined.

QC Playlist ⬇️

I’m hiring PhD students and postdocs!

With recent funding from NSF, DOE, ARPA-E, and NIH, my research group is expanding. (1/10)

Although {H, T} is discrete, it's universal! The core reason is that HTHT is a rotation about an angle that's an 𝘪𝘳𝘳𝘢𝘵𝘪𝘰𝘯𝘢𝘭 multiple of 2π. This means that as you wrap around the unit circle, you'll always hit new points: Irrationality ⇒ Universality.

QC Playlist ⬇️