Journal article · 2025 · Open access
Fault-tolerant quantum computation with polylogarithmic time and constant space overheads
Nature Physics, 22(1), 27–32 · Published 26 November 2025 · DOI 10.1038/s41567-025-03102-5
In brief
“Fault-tolerant quantum computation with polylogarithmic time and constant space overheads” is a 2025 journal article by Shiro Tamiya and 2 co-authors, published in Nature Physics. OpenAlex counts 50 citations as of 17 November 2026, which puts it in the top 1% of works published in 2025 by citations. It is open access under a CC BY licence: the full text is free to read at Nature Physics.
- Citations
- 50
- Most cited in
- 2026 (29)
- Field-weighted impact
- 8.55
- References
- 92
- Authors
- 3
Abstract
A major challenge in fault-tolerant quantum computation is to reduce both the space overhead, that is, the large number of physical qubits per logical qubit, and the time overhead, that is, the long physical gate sequences needed to implement a logical gate. Here we prove that a protocol using non-vanishing-rate quantum low-density parity-check (QLDPC) codes, combined with concatenated Steane codes, achieves constant space overhead and polylogarithmic time overhead, even when accounting for the required classical processing. This protocol offers an improvement over existing constant-space-overhead protocols. To prove our result, we develop a technique that we call partial circuit reduction, which enables error analysis for the entire fault-tolerant circuit by examining smaller parts composed of a few gadgets. With this approach, we resolve a logical gap in the existing arguments for the threshold theorem for the constant-space-overhead protocol with QLDPC codes and complete its proof. Our work establishes that the QLDPC-code-based approach can realize fault-tolerant quantum computation with a negligibly small slowdown and a bounded overhead of physical qubits.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Tamiya, S., Koashi, M., & Yamasaki, H. (2025). Fault-tolerant quantum computation with polylogarithmic time and constant space overheads. Nature Physics, 22(1), 27–32. https://doi.org/10.1038/s41567-025-03102-5
MLA 9
Tamiya, Shiro, et al. “Fault-tolerant quantum computation with polylogarithmic time and constant space overheads.” Nature Physics, vol. 22, no. 1, 2025, pp. 27–32. https://doi.org/10.1038/s41567-025-03102-5.
Chicago
Tamiya, Shiro, Masato Koashi, and Hayata Yamasaki. 2025. “Fault-tolerant quantum computation with polylogarithmic time and constant space overheads.” Nature Physics 22 (1): 27–32. https://doi.org/10.1038/s41567-025-03102-5.
Harvard
Tamiya, S., Koashi, M. and Yamasaki, H. (2025) ‘Fault-tolerant quantum computation with polylogarithmic time and constant space overheads’, Nature Physics, 22(1), pp. 27–32. doi:10.1038/s41567-025-03102-5.
IEEE
S. Tamiya, M. Koashi, and H. Yamasaki, “Fault-tolerant quantum computation with polylogarithmic time and constant space overheads,” Nature Physics, vol. 22, no. 1, pp. 27–32, 2025, doi: 10.1038/s41567-025-03102-5.
BibTeX
@article{tamiya2025fault,
title = {{Fault-tolerant quantum computation with polylogarithmic time and constant space overheads}},
author = {Tamiya, Shiro and Koashi, Masato and Yamasaki, Hayata},
journal = {Nature Physics},
year = {2025},
volume = {22},
number = {1},
pages = {27--32},
doi = {10.1038/s41567-025-03102-5},
url = {https://doi.org/10.1038/s41567-025-03102-5}
}
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
- fault-tolerant quantum computing
- quantum low-density parity-check codes
- space overhead
- time overhead
- threshold theorem
- logical qubits
- error analysis
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?
Tamiya, S., Koashi, M., & Yamasaki, H. (2025). Fault-tolerant quantum computation with polylogarithmic time and constant space overheads. Nature Physics, 22(1), 27–32. https://doi.org/10.1038/s41567-025-03102-5
How many times has this paper been cited?
50 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 Nature Physics: sign in and open the PDF from this page.
Who wrote this paper?
Shiro Tamiya, Masato Koashi, Hayata Yamasaki.
What is the DOI of this paper?
10.1038/s41567-025-03102-5, permanently at https://doi.org/10.1038/s41567-025-03102-5. 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.