Compare Papers

Paper 1

An Undergraduate Course in Quantum Computing

Peter Young

Year
2026
Journal
arXiv preprint
DOI
arXiv:2604.10396
arXiv
2604.10396

This is the text for a one quarter or one semester undergraduate course on quantum computing that has been given at the University of California Santa Cruz. It is intended for students in the physical sciences who have already studied linear algebra (though a review of this topic is given in the course). No prior knowledge of quantum mechanics is required. The most important topics covered are Shor's algorithm and an introduction to quantum error correction. Most of the text is a build-up to these topics.

Open paper

Paper 2

Tradeoffs on the volume of fault-tolerant circuits

Anirudh Krishna, Gilles Zémor

Year
2025
Journal
arXiv preprint
DOI
arXiv:2510.03057
arXiv
2510.03057

Dating back to the seminal work of von Neumann [von Neumann, Automata Studies, 1956], it is known that error correcting codes can overcome faulty circuit components to enable robust computation. Choosing an appropriate code is non-trivial as it must balance several requirements. Increasing the rate of the code reduces the relative number of redundant bits used in the fault-tolerant circuit, while increasing the distance of the code ensures robustness against faults. If the rate and distance were the only concerns, we could use asymptotically optimal codes as is done in communication settings. However, choosing a code for computation is challenging due to an additional requirement: The code needs to facilitate accessibility of encoded information to enable computation on encoded data. This seems to conflict with having large rate and distance. We prove that this is indeed the case, namely that a code family cannot simultaneously have constant rate, growing distance and short-depth gadgets to perform encoded CNOT gates. As a consequence, achieving good rate and distance may necessarily entail accepting very deep circuits, an undesirable trade-off in certain architectures and applications.

Open paper