Abhinav Anand

Finally, this was a fantastic collaboration with Yingjia Lin, who led the project, and Ken, whose insights were very helpful throughout.

Excited to share this, and we welcome any comments!

We believe that this idea can be extended beyond the toric code to other code families. Exploring these directions may lead to new pathways for reducing measurement overhead in large-scale fault-tolerant quantum computation.

Through numerical simulation under circuit-level noise models for the toric code, we show that our scheme can improve decoding performance compared to conventional checks when using sliding-window decoding with a reduced window size.

In this work, we introduce local single-shot checks by partitioning the toric code into small patches, avoiding high-weight checks. With a dynamic measurement scheme, we show that the number of required measurement rounds can be reduced.

Quantum error correction usually needs multiple rounds of syndrome extraction to overcome measurement noise. Single-shot error correction uses just one round, but most codes require high-weight checks, which significantly degrade, and often eliminate, single-shot performance at the circuit level.

Dynamic local single-shot checks for toric codes Quantum error correction typically requires repeated syndrome extraction due to measurement noise, which results in substantial time overhead in fault-tolerant computation. Single-shot error correctio...

🚀 We just posted a new paper on arXiv!
“Dynamic local single-shot checks for the toric code”
arxiv.org/abs/2511.20576

Excited to share this with the community, and we welcome any feedback!

We believe this opens up new possibilities for hardware–software co-design on the path toward a fully scalable quantum computer.

This was a fantastic collaboration with Sahil, who drove the project, and Ken and Jonathan, whose insights were invaluable throughout.

Our proposal moves away from the existing 2D-grid design toward a circular topology. We show that using such an architecture enables significant spacetime savings when using high-rate codes such as HGP and BB, as well as a substantial reduction in logical error rates compared to the 2D grid.

Cyclone: Designing Efficient and Highly Parallel QCCD Architectural Codesigns for Fault Tolerant Quantum Memory Modular trapped-ion quantum computing hardware, known as QCCDs require shuttling operations in order to maintain effective all-to-all connectivity. Each module or trap can perform only one operation a...

🚀 New Paper Announcement! (Accpted for publication at HPCA2026)

We’re excited to introduce Cyclone (arxiv.org/abs/2511.15910) an efficient, highly parallel architectural design for QCCD-based quantum devices aimed at enabling dense, fault-tolerant quantum memory.

Excited to share that this paper has now been published in Physical Review A doi.org/10.1103/jkcp...

Congratulations to our lab director, Alán Aspuru-Guzik (@aspuru.bsky.social), on being named a Fellow of the Royal Society of Canada (RSC)! 🎊

Read all about it here: web.cs.toronto.edu/news-events/...
[1/7]

#IPAM (the institute for pure and applied mathematics) is facing a critical shortfall for operating expenses due to an unexpected suspension of NSF funding www.ipam.ucla.edu/news/nsf-fun... . Donations for emergency continuity of operations funding can be made at

giving.ucla.edu/Campaign/Donat

1/
🚀 Super excited to launch PlanqTN — an open-source Python lib + interactive web app for exploring quantum LEGO-based QEC codes!
🎥 Intro video: youtu.be/TNnE3hReYVk
🔗 GitHub: github.com/planqtn/plan...
🌐 Studio: planqtn.com

Go check out this amazing toolbox from @balintpato.bsky.social - planqtn.com

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...

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

Home Awesome Quantum Computing Experiments: A curated collection of notable quantum computing experiments

Awesome Quantum Computing Experiments is on ArXiv!

57+ QEC implementations tracked
Interactive visualizations
Useful for researchers & students

Github: github.com/francois-marie/awesome-quantum-computing-experiments
Site: francoismarieleregent.xyz/awesome-quantum-computing-experiments/

1/3 🧵

⚛️ Curious about getting into quantum computing for quantum chemistry? Check out our new primer published in ACS InFocus. 📙 [1/4]

I'm often asked if I'll redo the 2019 quantum factoring estimate. Denser storage by yokes, smaller magic factories by cultivation, slimmer approx arithmetic by Chevignard et al… surely the cost is lower now?

Yes, it's lower now.

security.googleblog.com/2025/05/trac...

arxiv.org/abs/2505.15917

Finally, this project was a very fun collaboration with Dmitrii, who is an amazing undergraduate student at Duke, and Ken, without whom this would not have been possible.

Our method represents a resource-efficient way to estimate observables and has applications in both fault-tolerant and near-term quantum computing. Please check it out (arxiv.org/abs/2505.11486) — we welcome any comments!

and use this to build unbiased estimators from weighted expectation values. We then analyze when this method works and validate it via simulations, including time evolution under the Ising Hamiltonian.

Unitary errors, e.g., from fault-tolerant compilation, systematically bias observable estimates. The usual way to correct this bias is to use more non-Clifford gates. Here, we present an alternative strategy: decompose the ideal channel into a probabilistic mixture of noisy channels

Unbiased observable estimation via noisy channel mixtures for fault-tolerant quantum computation Unitary errors, such as those arising from fault-tolerant compilation of quantum algorithms, systematically bias observable estimates. Correcting this bias typically requires additional resources, suc...

We posted a new paper (arxiv.org/abs/2505.11486) on arXiv, where we present a method to unbias observable estimates in quantum circuits with unitary noise — common in fault-tolerant quantum computing.
Joint work with Dmitrii Khitrin and Ken Brown @kenbrownquantum.bsky.social

Details | Postdoctoral Associate - Computer Science | Careers | Division of Human Resources | Virginia Tech

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...

OK #quantum bluesky, I'm making a reading list. Goal: get to the state of the art in Fault-Tolerant Quantum Computing as quickly as possible. I'm using Dan Gottesman's "Surviving..." for the basics. What *one* other paper would you recommend? #quantumcomputing #qec

Congrats Dr. @gkwt.bsky.social!! 🥂

*Please repost* @sjgreenwood.bsky.social and I just launched a new personalized feed (*please pin*) that we hope will become a "must use" for #academicsky. The feed shows posts about papers filtered by *your* follower network. It's become my default Bluesky experience bsky.app/profile/pape...

🚀 More Tequila Tutorials!
1️⃣ Braket Tutorial: Discover how to use Tequila's Braket functions to compute tasks like transition elements of an operator.
2️⃣ QTensor Tutorial: Dive into the QTensor class and learn how to form vectors, matrices or tensors.
Check it out: tequilahub.github.io/tequila-tuto...

🎉 Our Tequila Tutorial Documentation is live! 🚀 Dive into our collection of tutorials and discover the basics of Tequila. Start with:
1️⃣ Getting Started
2️⃣ Circuits
3️⃣ Circuit Compiler
These tutorials help you build your knowledge step by step. Check it out: tequilahub.github.io/tequila-tuto...

(team)