Abhinav Anand's Avatar

Abhinav Anand

@abhinav-anand

Postdoc @DQC working on quantum algorithms and fault tolerance previously @UofT @UBC @IITG

360
Followers
343
Following
26
Posts
07.02.2024
Joined
Posts Following

Latest posts by Abhinav Anand @abhinav-anand

Have you ever wondered about the dimensionality of the massive Schwinger model with a two-dimensional, non-periodic electric field? Well, we counted it and proved that it follows the bisection of the Lucas numbers (oeis.org/A005248). This leads to incompatibility with Gauss's law stabilizer QEC.

02.03.2026 18:46 πŸ‘ 6 πŸ” 3 πŸ’¬ 1 πŸ“Œ 0

Excited to share that this is now published in Quantum Science and Technology πŸŽ‰ iopscience.iop.org/article/10.1...

06.01.2026 13:35 πŸ‘ 1 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0
Post image

New in Digital Discovery: An example of shedding light on chemistry via dynamics.

πŸ”— pubs.rsc.org/en/Content/A...

We propose a method that uses dynamics to circumvent a notoriously hard problem when simulating molecules on a quantum computer: the preparation of initial states.
[1/6]

08.12.2025 15:37 πŸ‘ 8 πŸ” 2 πŸ’¬ 1 πŸ“Œ 1

The obsession with the ground state over dynamical properties is misguided in the field of quantum computing for chemistry. Molecules are dynamic objects not in their ground state. Let’s estimate their properties dynamically! Learn more about it below.

#chemsky #compchemsky #quantumcomputing

06.12.2025 00:52 πŸ‘ 25 πŸ” 3 πŸ’¬ 0 πŸ“Œ 0
Preview
QUITS: A modular Qldpc code circUIT Simulator Mingyu Kang, Yingjia Lin, Hanwen Yao, Mert GΓΆkduman, Arianna Meinking, and Kenneth R. Brown, Quantum 9, 1931 (2025). To achieve quantum fault tolerance with lower overhead, quantum low-density parity-...

QUITS now out in Quantum
quantum-journal.org/papers/q-202...

06.12.2025 16:07 πŸ‘ 14 πŸ” 3 πŸ’¬ 1 πŸ“Œ 1

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!

26.11.2025 06:16 πŸ‘ 1 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

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.

26.11.2025 06:16 πŸ‘ 2 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

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.

26.11.2025 06:16 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

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.

26.11.2025 06:16 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

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.

26.11.2025 06:16 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0
Preview
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

26.11.2025 06:16 πŸ‘ 12 πŸ” 1 πŸ’¬ 1 πŸ“Œ 0

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

21.11.2025 08:51 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

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.

21.11.2025 08:51 πŸ‘ 1 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

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.

21.11.2025 08:49 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0
Preview
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.

21.11.2025 08:49 πŸ‘ 2 πŸ” 1 πŸ’¬ 1 πŸ“Œ 0

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

10.09.2025 16:03 πŸ‘ 4 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0
Post image

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]

04.09.2025 16:48 πŸ‘ 23 πŸ” 2 πŸ’¬ 1 πŸ“Œ 1

#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

08.08.2025 00:48 πŸ‘ 128 πŸ” 39 πŸ’¬ 5 πŸ“Œ 7
LinkedIn This link will take you to a page that’s not on LinkedIn

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

07.08.2025 19:35 πŸ‘ 10 πŸ” 5 πŸ’¬ 1 πŸ“Œ 0

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

07.08.2025 19:26 πŸ‘ 1 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0
Preview
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

16.07.2025 11:06 πŸ‘ 154 πŸ” 34 πŸ’¬ 5 πŸ“Œ 2
Preview
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 🧡

10.07.2025 14:26 πŸ‘ 17 πŸ” 6 πŸ’¬ 1 πŸ“Œ 3
Video thumbnail

βš›οΈ Curious about getting into quantum computing for quantum chemistry? Check out our new primer published in ACS InFocus. πŸ“™ [1/4]

30.06.2025 15:29 πŸ‘ 7 πŸ” 4 πŸ’¬ 1 πŸ“Œ 0
Post image Post image Post image Post image

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

23.05.2025 13:25 πŸ‘ 73 πŸ” 14 πŸ’¬ 2 πŸ“Œ 4

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.

19.05.2025 03:57 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

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!

19.05.2025 03:57 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

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.

19.05.2025 03:57 πŸ‘ 1 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

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

19.05.2025 03:57 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0
Preview
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

19.05.2025 03:57 πŸ‘ 5 πŸ” 0 πŸ’¬ 1 πŸ“Œ 1
Preview
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...

28.04.2025 19:43 πŸ‘ 34 πŸ” 13 πŸ’¬ 0 πŸ“Œ 0