Export citation

Export citation

Choose format for download:

Download Citation

    Quantum memory based on concatenating surface codes and quantum Hamming codes

    Menglong Fang and Daiqin Su*

    • MOE Key Laboratory of Fundamental Physical Quantities Measurement, Hubei Key Laboratory of Gravitation and Quantum Physics, PGMF, Institute for Quantum Science and Engineering, School of Physics, Huazhong University of Science and Technology, Wuhan 430074, China

    • *Contact author: sudaiqin@hust.edu.cn

    Phys. Rev. A 112, 052441 – Published 20 November, 2025

    DOI: https://doi.org/10.1103/8ds6-l416

    Abstract

    Designing quantum error correcting codes that promise a high error threshold, low resource overhead, and efficient decoding algorithms is crucial to achieve large-scale fault-tolerant quantum computation. The concatenated quantum Hamming code is one of the potential candidates that allows for constant space overhead and efficient decoding. We study the concatenation of surface codes with quantum Hamming codes as a quantum memory, and estimate its error threshold, resource overhead, and decoding time. A high error threshold is achieved, which can in principle be pushed up to the threshold of the surface code. Furthermore, the concatenated codes can suppress logical errors to a much lower level than the surface codes, under the assumption of comparable amount of resource overhead. The advantage in suppressing errors starts to show for a quantum memory of intermediate scale. Concatenating surface codes with quantum Hamming codes therefore provides a promising avenue to demonstrate small-scale fault-tolerant quantum circuits in the near future, and also paves a way for large-scale fault-tolerant quantum computation.

    Physics Subject Headings (PhySH)

    Authorization Required

    We need you to provide your credentials before accessing this content.

    References (Subscription Required)

    Outline

    Information

    Sign In to Your Journals Account

    Filter

    Filter

    Article Lookup

    Enter a citation