Journal article · 2026 · Open access
Magic Tricycles: Efficient Magic-State Generation with Finite Block-Length Quantum LDPC Codes
Physical Review X, 16(2) · Published 3 March 2026 · DOI 10.1103/ghhp-cytl
In brief
“Magic Tricycles: Efficient Magic-State Generation with Finite Block-Length Quantum LDPC Codes” is a 2026 journal article by Varun Menon and 5 co-authors, published in Physical Review X. OpenAlex counts 43 citations as of 17 November 2026, which puts it in the top 3% of works published in 2026 by citations. It is open access under a CC BY licence: the full text is free to read at Physical Review X.
- Citations
- 43
- Most cited in
- 2026 (38)
- Field-weighted impact
- 36.27
- References
- 109
- Authors
- 6
Abstract
The preparation of high-fidelity non-Clifford (magic) states is an essential subroutine for universal quantum computation but imposes substantial space-time overhead. Magic-state factories based on high-rate and -distance quantum low-density parity-check (LDPC) codes equipped with transversal non-Clifford gates can potentially reduce these overheads significantly, by circumventing the need for multiple rounds of distillation and by producing a large number of magic states in a single code block. As a step toward realizing efficient, fault-tolerant magic-state production, we introduce a class of finite block-length quantum LDPC codes which we name tricycle codes, generalizing the well-known bicycle codes to three homological dimensions. These codes can support constant-depth physical circuits that implement logical C C Z gates between three code blocks. To construct these constant-depth C C Z circuits, we develop analytical and numerical techniques that apply to a broad class of three-dimensional homological and balanced-product codes. We further show that tricycle codes enable single-shot state preparation and error correction, leading to a highly efficient magic-state generation protocol. Numerical simulations of specific codes confirm robust performance under circuit-level noise, demonstrating a high circuit-noise threshold of > 0.5 % . With modest postselection, certain tricycle codes of block lengths of only approximately 50–100 qubits are shown to produce | C C Z ¯ ⟩ magic states with logical error rates ranging from 2 × 10 − 8 to below 3 × 10 − 11 . Finally, we construct optimal depth syndrome extraction circuits for tricycle codes and present a protocol for implementing them efficiently on a reconfigurable neutral-atom platform.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Menon, V., Ataides, J. P. B., Mehta, R., Gu, A., Tan, D. B., & Lukin, M. D. (2026). Magic Tricycles: Efficient Magic-State Generation with Finite Block-Length Quantum LDPC Codes. Physical Review X, 16(2). https://doi.org/10.1103/ghhp-cytl
MLA 9
Menon, Varun, et al. “Magic Tricycles: Efficient Magic-State Generation with Finite Block-Length Quantum LDPC Codes.” Physical Review X, vol. 16, no. 2, 2026. https://doi.org/10.1103/ghhp-cytl.
Chicago
Menon, Varun, J. Pablo Bonilla Ataides, Rohan Mehta, Andi Gu, Daniel Bochen Tan, and Mikhail D. Lukin. 2026. “Magic Tricycles: Efficient Magic-State Generation with Finite Block-Length Quantum LDPC Codes.” Physical Review X 16 (2). https://doi.org/10.1103/ghhp-cytl.
Harvard
Menon, V. et al. (2026) ‘Magic Tricycles: Efficient Magic-State Generation with Finite Block-Length Quantum LDPC Codes’, Physical Review X, 16(2). doi:10.1103/ghhp-cytl.
IEEE
V. Menon, J. P. B. Ataides, R. Mehta, A. Gu, D. B. Tan, and M. D. Lukin, “Magic Tricycles: Efficient Magic-State Generation with Finite Block-Length Quantum LDPC Codes,” Physical Review X, vol. 16, no. 2, 2026, doi: 10.1103/ghhp-cytl.
BibTeX
@article{menon2026magic,
title = {{Magic Tricycles: Efficient Magic-State Generation with Finite Block-Length Quantum LDPC Codes}},
author = {Menon, Varun and Ataides, J. Pablo Bonilla and Mehta, Rohan and Gu, Andi and Tan, Daniel Bochen and Lukin, Mikhail D.},
journal = {Physical Review X},
year = {2026},
volume = {16},
number = {2},
doi = {10.1103/ghhp-cytl},
url = {https://doi.org/10.1103/ghhp-cytl}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- quantum LDPC codes
- constant-depth circuits
- fault-tolerant quantum computing
- neutral atom quantum computing
- post-selection
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Menon, V., Ataides, J. P. B., Mehta, R., Gu, A., Tan, D. B., & Lukin, M. D. (2026). Magic Tricycles: Efficient Magic-State Generation with Finite Block-Length Quantum LDPC Codes. Physical Review X, 16(2). https://doi.org/10.1103/ghhp-cytl
How many times has this paper been cited?
43 times, according to OpenAlex on 17 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Physical Review X: sign in and open the full text from this page.
Who wrote this paper?
Varun Menon, J. Pablo Bonilla Ataides, Rohan Mehta, Andi Gu, Daniel Bochen Tan, Mikhail D. Lukin.
What is the DOI of this paper?
10.1103/ghhp-cytl, permanently at https://doi.org/10.1103/ghhp-cytl. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 17 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.