New paper out ✨ Fault-tolerant Transformation of Spacetime Codes, a collaboration w/ @vasmer.bsky.social, Austin Daniel & Ilan Tzitrin, which started during my internship @xanaduai.bsky.social scirate.com/arxiv/2509.0... Let's now see if I can summarize 101 pages (🙈) in a few tweets (and memes!)

New arXiv preprint: we show algorithmic versions of the polynomial Freiman–Ruzsa (PFR) theorem of Gowers, Green, Manners, and Tao. Interestingly, our proof draws on quantum information and stabilizer learning algorithms, which we dequantize into classical algorithms. arxiv.org/pdf/2509.02338

Correction: the talk will start at 12:30 ET

come listen to @csenrui.bsky.social talk about his recent work at tomorrows seminar on the UF discord. It's open to anyone to attend :)

It took me a while, but I (finally) wrote a "short" (erm) note on the "polynomial+moments method" to prove testing or indistinguishability sample complexity lower bounds. Including the infamous Ω(k/log k) tolerant uniformity testing one. Comments and feedback welcome! 📝 github.com/ccanonne/pro...

The QEC25 conference hosted by @yaleqi.bsky.social was really excellent, and videos of all talks are available. So much recent progress on quantum error correction! qec25.yalepages.org

UChicago PME Quantum Engineering PhD student Su-un Lee is spending the summer interning with the #quantum algorithms team at IBM. Read his Q&A in UChicago PME’s Engineering the Summer series: pme.uchicago.edu/news/enginee...

What is the min depth you need for a random unitary? In this work w/ Tommy Schuster, @RobertHuangHY, Fernando Brandão (arxiv.org/abs/2507.06216) we glue random unitary blocks w/ only random phases on log n qubits (fns on log n bits) to get designs in d = log k log log n 🧩 1/8

One of the amazing things about working in quantum information science is being able to meet and talk to the pioneers of the subject. I was very lucky not only to have met Ray, but also to have been a postdoc in his group for a number of years.

Raymond Laflamme 1960-2025. A great scientist, renowned for his pioneering contributions to quantum error correction. A great leader, founding director of the Institute for Quantum Computing. A great colleague and teacher whose legacy continues to inspire us. uwaterloo.ca/institute-fo...

🪇Disambiguating Pauli noise in quantum computers scirate.com/arxiv/2505.2... Quantum noise characterization suffers from "gauge ambiguity" due to noisy initialization and measurements. We show this does not stop us from correctly mitigating errors, both in theory and in up to 92-qubit experiments

I'm hiring a postdoc! If you'd like to work with me on quantum learning, error correction, quantum algorithms, and FTQC at Virginia Tech in the Washington, DC metro area, please apply here: careers.pageuppeople.com/968/cw/en-us...

I defended my PhD dissertation today!! 🍾🎓⚛️ Thank you to everyone who supported me along this wonderful journey!

Excited to share our first major result from our IARPA Entangled Logical Qubits team! arxiv.org/abs/2504.07258 @benbrown.bsky.social @universal-soup.bsky.social @evanhockings.bsky.social @georgianixon.bsky.social

1/n I'm excited to share our latest work, Demonstration of robust and efficient quantum property learning with shallow shadows, published in Nature Communications! 🎉 📝 Authors: Hong-Ye Hu, Andi Gu, Swarnadeep Majumder, Hang Ren, Yipei Zhang, Derek S. Wang, Yi-Zhuang You, Zlatko Minev,

Won APS ducks at #APSSummit25 #apsmarch with Su-un Lee and Kento Tsubouchi

Only one week left to submit a contributed talk to QEC 25! qec25.yalepages.org August 11 - 15, 2025, hosted at Yale University. This promises to be the best QEC yet! Please repost!

Heading to Anaheim for #APSSummit25 #apsmarch. I will be giving two talks, both on Monday: 1⃣ Efficient self-consistent learning of gate set Pauli noise, 10:24 – 11:00, 258A 2⃣ Generalized cycle benchmarking algorithm for characterizing mid-circuit measurements, 3:36 - 3:48, 256B

Why characterise noise in syndrome extraction circuits? One reason: directly improving quantum error correction! In simulations of the surface code, we find that noise-aware decoding—calibrating the decoder with noise estimates—improves the code's error suppression factor.

1/n I am stepping away from IBM Quantum after nearly 7 years. This was an unforgettable chapter of my life where I was blessed with the best of colleagues, on a joint mission to bring useful quantum computing to the world, and to help bring up the next generation of young scientists. Stepping away

If qubits only talk to 1D neighbors, is constant rate fault tolerance possible? Last year I referee'd a paper claiming it wasn't. My review was "this is wrong but the constructive disproof is too large for this review". Clearly a reviewer 2 move. Sorry. But I was right! scirate.com/arxiv/2502.1...

Check out our recent pre-print: arxiv.org/abs/2502.01864 In this work, we construct the first quantum codes which support transversal and addressable non-Clifford gates!

When in Canada, use a hockey stick! @markwilde.bsky.social delivers his talk on quantum hypothesis exclusion at the Perimeter Institute with a true Canadian twist 🏒

Submissions for QEC 2025 are now open through March 28. This will easily be the most exciting conference on quantum error correction yet! Conference homepage: qec25.yalepages.org EasyChair submission page: easychair.org/my/conferenc...

I'm thrilled to announce my latest work with Marcus Appleby and Gene Kopp, scirate.com/arxiv/2501.0.... In this paper, we attacked the notorious Zauner (SICPOVM) conjecture: "There exist d^2 equiangular lines in ℂ^d" It's deceptively simple, but has been open for 25+ years. 🧵 1/9

I created a transcript of my talk at the Q2B Conference: "Beyond NISQ: The Megaquop Machine." You can read it here: quantumfrontiers.com/2024/12/14/b...

List of accepted talks for #QIP2025 rsvp.duke.edu/event/qip202...

Waterloo Park in autumn and winter

The Gaussian is a nice bumpy shape, but sometimes we hope for a smooth (i.e. C∞) function like the Gaussian that is 𝒂𝒍𝒔𝒐 compactly supported. One such class of functions is called "Bump functions" 1/6

Just created a Quantum Computing Starter Pack. Please reach out if I missed to add you. go.bsky.app/KBgRwmZ