Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2410.12551 · PRX Quantum

Quantum Subspace Verification for Error Correction Codes

Junjie Chen, Pei Zeng, Qi Zhao, Xiongfeng Ma, You Zhou

Published Nov 10, 2025• 4 citations
arXivHTMLPDF

Abstract

Quantum error correction is pivotal in advancing toward large-scale quantum computation, and efficient verification is crucial for ensuring the high fidelity of code states. Traditional methodologies, such as state tomography, direct fidelity estimation, and state verification, either fall short in measurement efficiency, especially for large-scale systems, or are restricted to some specific states. In this work, we introduce a general framework for quantum subspace verification, enabling efficient and measurement-noise-robust fidelity estimation between a given state and the target subspace with a specified confidence level. By integrating the proposed subspace verification with direct fidelity estimation, we develop a composite protocol that significantly improves the efficiency of verifying the fidelity of general magic logical states, as demonstrated by intuitive numerical results. This improvement stems from the use of subspace verification, which leverages the knowledge of code subspaces to significantly reduce measurement costs. Additionally, we detail the construction of verification operators for typical error correction codes, including general stabilizer codes and quantum low-density parity-check codes, enabling their efficient implementation using practical local measurements. Notably, for certain codes, such as the Calderbank-Shor-Steane codes and quantum low-density parity-check stabilizer codes, we reduce the number of required measurement settings and sample complexity to a constant level using graphical methods. Our approach facilitates efficient and feasible verification of error correction codes and generic magic logical states, advancing their practical implementations on quantum platforms.

DOI
10.1103/fyw6-lq1l

Related papers

Efficient verification of stabilizer code subspaces with local measurements

Congcong Zheng, Xutao Yu, Zaichen Zhang +2 more

Abstract We address the task of verifying whether a quantum computer, designed to be protected by a specific stabilizer code, correctly encodes the corresponding logical qubits. To achieve this, we develop a general framework for subspace verification and explore several practically significant stabilizer code subspaces. First, we present two efficient verification strategies for general stabilizer code subspaces, using measurements of their stabilizer generators and stabilizer groups, respectively. Then, building on the observation that certain tests can be conducted in parallel due to specific structural properties of the subspace, we propose a coloring strategy tailored to graph code subspaces and an XZ strategy for Calderbank–Shor–Steane code subspaces. Compared to stabilizer-based strategies, these new strategies require significantly fewer measurement settings and consume fewer state copies, achieving near-global optimality. Notably, all the strategies employ a limited number of Pauli measurements, are non-adaptive, and work for mixed states, enabling efficient experimental certification of whether quantum states remain within the target code subspace in noisy quantum computers. This work presents the first systematic study of efficient verification of stabilizer code subspaces with local measurements.

arXiv:2409.19699•Quantum Science and Technology•May 22, 2026•6 citations

An efficient quantum state verification framework and its application to bosonic systems

Varun Upreti, Ulysse Chabaud

Modern quantum devices are highly susceptible to errors, making the verification of their correct operation a critical problem. Usual tomographic methods rapidly become intractable as these devices are scaled up. In this paper, we introduce a general framework for the efficient verification of large quantum systems. Our framework combines robust fidelity witnesses with efficient classical post-processing to implement measurement back-propagation. We demonstrate its usefulness by focusing on the verification of bosonic quantum systems, and developing efficient verification protocols for large classes of target states using the two most common types of Gaussian measurements: homodyne and heterodyne detection. Our protocols are semi-device independent, designed to function with minimal assumptions about the quantum device being tested, and offer practical improvements over previous existing approaches. Overall, our work introduces efficient methods for verifying the correct preparation of complex quantum states, and may be used for calibrating large quantum devices, witnessing quantum properties, supporting demonstrations of quantum computational speedups and enhancing trust in quantum computations.

arXiv:2411.04688•Nov 7, 2024•11 citations

Nearly-optimal CSS code subspace verification with local measurement

Yingying Hu, Congcong Zheng, Xutao Yu +1 more

Abstract Quantum error correction (QEC) is the core mechanism enabling scalable and fault-tolerant quantum computation. Among various QEC schemes, Calderbank–Shor–Steane (CSS) codes play a central role. Efficiently verifying whether a quantum state remains within the target CSS code subspace is therefore essential both for understanding the theoretical performance of these codes and for assessing the error-correcting capability of practical quantum platforms. In this work, we develop an efficient framework for verifying whether a quantum system remains within the encoded subspace of a CSS code. We first show that the stabilizer structure of any CSS code can be mapped to a two-colorable graph, enabling the design of a hybrid verification strategy based solely on local Pauli measurements. We further analytically optimize the measurement probabilities and derive the resulting sample complexities for representative CSS codes. Specifically, for the Toric code, the efficiency of our hybrid strategy increases with lattice size and asymptotically approaches near-optimal performance. These results establish a unified and scalable approach to CSS code subspace verification, providing a foundation for certifiable and fault-tolerant quantum information processing.

Quantum Science and Technology•Feb 10, 2026•0 citations

Efficiently computing logical noise in quantum error-correcting codes

Stefanie J. Beale, Joel J. Wallman

Quantum error correction protocols have been developed to offset the high sensitivity to noise inherent in quantum systems. However, much is still unknown about the behavior of a quantum error-correcting code under general noise, including noisy measurements. This lack of knowledge is largely due to the computational cost of simulating quantum systems large enough to perform nontrivial encodings. In this paper, we develop general methods for incorporating noisy measurement operations into simulations of quantum error-correcting codes and show that measurement errors on readout qubits manifest as a renormalization on the effective logical noise. We also derive general methods for reducing the computational complexity of calculating the exact effective logical noise by many orders of magnitude. This reduction is achieved by determining when different recovery operations produce equivalent logical noise. These methods could also be used to better approximate soft decoding schemes for concatenated codes or to reduce the size of a lookup table to speed up the error correction step in implementations of quantum error-correcting codes. We give examples of such reductions for the three-qubit, five-qubit, Steane, concatenated, and toric codes.

arXiv:2003.10511•Physical Review A•Jun 2, 2021•5 citations

Efficient Formal Verification of Quantum Error Correcting Programs

Qifan Huang, Li Zhou, Wang Sheng Fang +2 more

Quantum error correction (QEC) is fundamental for suppressing noise in quantum hardware and enabling fault-tolerant quantum computation. In this paper, we propose an efficient verification framework for QEC programs. We define an assertion logic and a program logic specifically crafted for QEC programs and establish a sound proof system. We then develop an efficient method for handling verification conditions (VCs) of QEC programs: for Pauli errors, the VCs are reduced to classical assertions that can be solved by SMT solvers, and for non-Pauli errors, we provide a heuristic algorithm. We formalize the proposed program logic in Coq proof assistant, making it a verified QEC verifier. Additionally, we implement an automated QEC verifier, Veri-QEC, for verifying various fault-tolerant scenarios. We demonstrate the efficiency and broad functionality of the framework by performing different verification tasks across various scenarios. Finally, we present a benchmark of 14 verified stabilizer codes.

arXiv:2504.07732•Proceedings of the ACM on Programming Languages•Jun 10, 2025•25 citations

Quantum Error Correcting Subsystem Codes From Two Classical Linear Codes

Dave Bacon, Andrea Casaccino

The essential insight of quantum error correction was that quantum information can be protected by suitably encoding this quantum information across multiple independently erred quantum systems. Recently it was realized that, since the most general method for encoding quantum information is to encode it into a subsystem, there exists a novel form of quantum error correction beyond the traditional quantum error correcting subspace codes. These new quantum error correcting subsystem codes differ from subspace codes in that their quantum correcting routines can be considerably simpler than related subspace codes. Here we present a class of quantum error correcting subsystem codes constructed from two classical linear codes. These codes are the subsystem versions of the quantum error correcting subspace codes which are generalizations of Shor's original quantum error correcting subspace codes. For every Shor-type code, the codes we present give a considerable savings in the number of stabilizer measurements needed in their error recovery routines.

arXiv:quant-ph/0610088•Oct 11, 2006•55 citations
Quantum error correction is pivotal in advancing toward large-scale quantum computation, and efficient verification is crucial for ensuring the high fidelity of code states. Traditional methodologies, such as state tomography, direct fidelity estimation, and state verification, either fall short in measurement efficiency, especially for large-scale systems, or are restricted to some specific states. In this work, we introduce a general framework for quantum subspace verification, enabling efficient and measurement-noise-robust fidelity estimation between a given state and the target subspace with a specified confidence level. By integrating the proposed subspace verification with direct fidelity estimation, we develop a composite protocol that significantly improves the efficiency of verifying the fidelity of general magic logical states, as demonstrated by intuitive numerical results. This improvement stems from the use of subspace verification, which leverages the knowledge of code subspaces to significantly reduce measurement costs. Additionally, we detail the construction of verification operators for typical error correction codes, including general stabilizer codes and quantum low-density parity-check codes, enabling their efficient implementation using practical local measurements. Notably, for certain codes, such as the Calderbank-Shor-Steane codes and quantum low-density parity-check stabilizer codes, we reduce the number of required measurement settings and sample complexity to a constant level using graphical methods. Our approach facilitates efficient and feasible verification of error correction codes and generic magic logical states, advancing their practical implementations on quantum platforms.
Abstract We address the task of verifying whether a quantum computer, designed to be protected by a specific stabilizer code, correctly encodes the corresponding logical qubits. To achieve this, we develop a general framework for subspace verification and explore several practically significant stabilizer code subspaces. First, we present two efficient verification strategies for general stabilizer code subspaces, using measurements of their stabilizer generators and stabilizer groups, respectively. Then, building on the observation that certain tests can be conducted in parallel due to specific structural properties of the subspace, we propose a coloring strategy tailored to graph code subspaces and an XZ strategy for Calderbank–Shor–Steane code subspaces. Compared to stabilizer-based strategies, these new strategies require significantly fewer measurement settings and consume fewer state copies, achieving near-global optimality. Notably, all the strategies employ a limited number of Pauli measurements, are non-adaptive, and work for mixed states, enabling efficient experimental certification of whether quantum states remain within the target code subspace in noisy quantum computers. This work presents the first systematic study of efficient verification of stabilizer code subspaces with local measurements.
Modern quantum devices are highly susceptible to errors, making the verification of their correct operation a critical problem. Usual tomographic methods rapidly become intractable as these devices are scaled up. In this paper, we introduce a general framework for the efficient verification of large quantum systems. Our framework combines robust fidelity witnesses with efficient classical post-processing to implement measurement back-propagation. We demonstrate its usefulness by focusing on the verification of bosonic quantum systems, and developing efficient verification protocols for large classes of target states using the two most common types of Gaussian measurements: homodyne and heterodyne detection. Our protocols are semi-device independent, designed to function with minimal assumptions about the quantum device being tested, and offer practical improvements over previous existing approaches. Overall, our work introduces efficient methods for verifying the correct preparation of complex quantum states, and may be used for calibrating large quantum devices, witnessing quantum properties, supporting demonstrations of quantum computational speedups and enhancing trust in quantum computations.
Abstract Quantum error correction (QEC) is the core mechanism enabling scalable and fault-tolerant quantum computation. Among various QEC schemes, Calderbank–Shor–Steane (CSS) codes play a central role. Efficiently verifying whether a quantum state remains within the target CSS code subspace is therefore essential both for understanding the theoretical performance of these codes and for assessing the error-correcting capability of practical quantum platforms. In this work, we develop an efficient framework for verifying whether a quantum system remains within the encoded subspace of a CSS code. We first show that the stabilizer structure of any CSS code can be mapped to a two-colorable graph, enabling the design of a hybrid verification strategy based solely on local Pauli measurements. We further analytically optimize the measurement probabilities and derive the resulting sample complexities for representative CSS codes. Specifically, for the Toric code, the efficiency of our hybrid strategy increases with lattice size and asymptotically approaches near-optimal performance. These results establish a unified and scalable approach to CSS code subspace verification, providing a foundation for certifiable and fault-tolerant quantum information processing.
Quantum error correction protocols have been developed to offset the high sensitivity to noise inherent in quantum systems. However, much is still unknown about the behavior of a quantum error-correcting code under general noise, including noisy measurements. This lack of knowledge is largely due to the computational cost of simulating quantum systems large enough to perform nontrivial encodings. In this paper, we develop general methods for incorporating noisy measurement operations into simulations of quantum error-correcting codes and show that measurement errors on readout qubits manifest as a renormalization on the effective logical noise. We also derive general methods for reducing the computational complexity of calculating the exact effective logical noise by many orders of magnitude. This reduction is achieved by determining when different recovery operations produce equivalent logical noise. These methods could also be used to better approximate soft decoding schemes for concatenated codes or to reduce the size of a lookup table to speed up the error correction step in implementations of quantum error-correcting codes. We give examples of such reductions for the three-qubit, five-qubit, Steane, concatenated, and toric codes.
Quantum error correction (QEC) is fundamental for suppressing noise in quantum hardware and enabling fault-tolerant quantum computation. In this paper, we propose an efficient verification framework for QEC programs. We define an assertion logic and a program logic specifically crafted for QEC programs and establish a sound proof system. We then develop an efficient method for handling verification conditions (VCs) of QEC programs: for Pauli errors, the VCs are reduced to classical assertions that can be solved by SMT solvers, and for non-Pauli errors, we provide a heuristic algorithm. We formalize the proposed program logic in Coq proof assistant, making it a verified QEC verifier. Additionally, we implement an automated QEC verifier, Veri-QEC, for verifying various fault-tolerant scenarios. We demonstrate the efficiency and broad functionality of the framework by performing different verification tasks across various scenarios. Finally, we present a benchmark of 14 verified stabilizer codes.
The essential insight of quantum error correction was that quantum information can be protected by suitably encoding this quantum information across multiple independently erred quantum systems. Recently it was realized that, since the most general method for encoding quantum information is to encode it into a subsystem, there exists a novel form of quantum error correction beyond the traditional quantum error correcting subspace codes. These new quantum error correcting subsystem codes differ from subspace codes in that their quantum correcting routines can be considerably simpler than related subspace codes. Here we present a class of quantum error correcting subsystem codes constructed from two classical linear codes. These codes are the subsystem versions of the quantum error correcting subspace codes which are generalizations of Shor's original quantum error correcting subspace codes. For every Shor-type code, the codes we present give a considerable savings in the number of stabilizer measurements needed in their error recovery routines.