Journal article · 2024 · Open access
Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
Nature Physics, 20(2), 247–253 · Published 16 January 2024 · DOI 10.1038/s41567-023-02325-8
In brief
“Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation” is a 2024 journal article by Hayata Yamasaki and Masato Koashi, published in Nature Physics. OpenAlex counts 129 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at Nature Physics.
- Citations
- 129
- Most cited in
- 2025 (59)
- Field-weighted impact
- 10.51
- References
- 107
- Authors
- 2
Abstract
Scaling up quantum computers to attain substantial speedups over classical computing requires fault tolerance. Conventionally, protocols for fault-tolerant quantum computation demand excessive space overheads by using many physical qubits for each logical qubit. A more recent protocol using quantum analogues of low-density parity-check codes needs only a constant space overhead that does not grow with the number of logical qubits. However, the overhead in the processing time required to implement this protocol grows polynomially with the number of computational steps. To address these problems, here we introduce an alternative approach to constant-space-overhead fault-tolerant quantum computing using a concatenation of multiple small-size quantum codes rather than a single large-size quantum low-density parity-check code. We develop techniques for concatenating different quantum Hamming codes with growing size. As a result, we construct a low-overhead protocol to achieve constant space overhead and only quasi-polylogarithmic time overhead simultaneously. Our protocol is fault tolerant even if a decoder has a non-constant runtime, unlike the existing constant-space-overhead protocol. This code concatenation approach will make possible a large class of quantum speedups with feasibly bounded space overhead yet negligibly short time overhead.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Yamasaki, H., & Koashi, M. (2024). Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation. Nature Physics, 20(2), 247–253. https://doi.org/10.1038/s41567-023-02325-8
MLA 9
Yamasaki, Hayata, and Masato Koashi. “Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation.” Nature Physics, vol. 20, no. 2, 2024, pp. 247–253. https://doi.org/10.1038/s41567-023-02325-8.
Chicago
Yamasaki, Hayata and Masato Koashi. 2024. “Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation.” Nature Physics 20 (2): 247–253. https://doi.org/10.1038/s41567-023-02325-8.
Harvard
Yamasaki, H. and Koashi, M. (2024) ‘Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation’, Nature Physics, 20(2), pp. 247–253. doi:10.1038/s41567-023-02325-8.
IEEE
H. Yamasaki and M. Koashi, “Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation,” Nature Physics, vol. 20, no. 2, pp. 247–253, 2024, doi: 10.1038/s41567-023-02325-8.
BibTeX
@article{yamasaki2024time,
title = {{Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation}},
author = {Yamasaki, Hayata and Koashi, Masato},
journal = {Nature Physics},
year = {2024},
volume = {20},
number = {2},
pages = {247--253},
doi = {10.1038/s41567-023-02325-8},
url = {https://doi.org/10.1038/s41567-023-02325-8}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2022 | 1 | |
| 2023 | 2 | |
| 2024 | 10 | |
| 2025 | 59 | |
| 2026 | 57 |
Its field-weighted citation impact is 10.51: it has been cited 10.51 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- fault-tolerant quantum computing
- time overhead
- concatenated codes
- LDPC codes
- quantum error correction
- logical qubits
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?
Yamasaki, H., & Koashi, M. (2024). Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation. Nature Physics, 20(2), 247–253. https://doi.org/10.1038/s41567-023-02325-8
How many times has this paper been cited?
129 times, according to OpenAlex on 19 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?
Hayata Yamasaki, Masato Koashi.
What is the DOI of this paper?
10.1038/s41567-023-02325-8, permanently at https://doi.org/10.1038/s41567-023-02325-8. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 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.