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

AIP Advances

Quantum recovery protocols for stabilizer codes: Deterministic Monte-Carlo simulation

Konstantinos P. Prousalis, Agis A. Iliadis, Nikos Konofaos

Published Jun 1, 2018• 0 citations
Publisher

Abstract

The quantum noise encumbrance caused by quantum error-correcting protocols is studied via numerical treatments. Noise evolution implies that the noise magnitude order may change dynamically during quantum computations. The rate of noise level deterioration is a function of the computer’s architecture and physical implementation. Various stabilizer codes with small blocks are studied under dynamic noise regimes, which change the noise magnitude order within a specified time period. The Monte-Carlo sampling simulation method is used to determine the survival probabilities for these codes under evolving error rates. A hypothetical q-step quantum algorithm is stabilized by the repeated application of the recovery protocol, and the proposed estimation method is applied. The estimation method is applied concurrently with the execution of the algorithm. The recovery process is simulated with the aid of a software tool that can be parameterized based on the noise model and the encoding error-correction scheme. Examples show the utility of this tool for quantum coding studies.

DOI
10.1063/1.5024661

Related papers

Dynamical subset sampling of quantum error-correcting protocols

Sascha Heußen, Don Winter, Manuel Rispler +1 more

Quantum error-correcting (QEC) stabilizer codes enable protection of quantum information against errors during storage and processing. Simulation of noisy QEC codes is used to identify the noise parameters necessary for advantageous operation of logical qubits in realistic quantum computing architectures. Typical quantum error-correction techniques contain intermediate measurements and classical feedback that determine the actual noisy circuit sequence in an instance of performing the protocol. Dynamical subset sampling enables efficient simulation of such nondeterministic quantum error-correcting protocols for any type of quantum circuit and incoherent noise of low strength. As an importance sampling technique, dynamical subset sampling allows one to effectively make use of computational resources to only sample the most relevant sequences of quantum circuits in order to estimate a protocol's logical failure rate with well-defined error bars. We demonstrate the capabilities of dynamical subset sampling with examples from fault-tolerant (FT) QEC. We show that, in a typical stabilizer simulation with incoherent Pauli noise of strength p=10−3 , our method can reach a required sampling accuracy on the logical failure rate with two orders of magnitude fewer samples than direct Monte Carlo simulation. Furthermore, dynamical subset sampling naturally allows for efficient simulation of realistic multi-parameter noise models describing faulty quantum processors. It can be applied not only for QEC in the circuit model but any noisy quantum computing framework with incoherent fault operators including measurement-based quantum computation and quantum networks. Published by the American Physical Society 2024

arXiv:2309.12774•Physical Review Research•Feb 20, 2024•11 citations

Deterministic error model for quantum computer simulation

Eric C. Chi, S. A. Lyon, Margaret Martonosi

Quantum computers (QCs) must implement quantum error correcting codes (QECCs) to protect their logical qubits from errors, and modeling the effectiveness of QECCs on QCs is an important problem for evaluating the QC architecture. The previously developed Monte Carlo (MC) error models may take days or weeks of execution to produce an accurate result due to their random sampling approach. We present an alternative deterministic error model that generates, over the course of executing the quantum program, a probability tree of the QC's error states. By calculating the fidelity of the quantum program directly, this error model has the potential for enormous speedups over the MC model when applied to small yet useful problem sizes (containing on the order of a dozen logical qubits encoded in the [[7,1,3]] QECC plus associated ancilla). We observe a speedup on the order of $1000X$ when accuracy is required, and we evaluate the scaling properties of this new deterministic error model.

arXiv:0801.0094•Physical Review A•May 14, 2008•7 citations

Stabilizer codes : encoding schemes and applications

Shiyu Shi

Quantum information science is a rapidly growing research area. It concerns information theory that makes use of quantum nature of the microscopic world. In reality, quantum systems are vulnerable to disturbance from an external environment, which can lead to decoherence in the system. Thus, the system must be protected from the environmental noise to keep information stored in the quantum registers. In order to realize a working quantum computer and dependable quantum information processing, researchers and engineers have to overcome this difficulty. One of the most promising candidates for overcoming decoherence is Quantum Error Correction. The idea of quantum error correction is to protect quantum information from errors due to decoherence and other quantum noise during the transmission of information in quantum channels. One fundamental question of quantum error correction is the existence of quantum error correcting code for a noisy quantum system. Moreover, constructing practical and operational quantum error correcting schemes in actual quantum computing is of great interest to quantum information scientists. In this thesis, stabilizer codes and a scheme for constructing recovery channels without error syndrome detection are studied. The motivation for construction of recovery channel without error syndrome detection is also given. We first review some basic concepts on stabilizer groups and stabilizer codes. In particular, we consider theories and principles involved in the construction of encoding circuits from the generators of stabilizer group, and propose a new procedure to derive recovery channel for a well known quantum code, the [n, k, d] code. First, an algorithm to obtain the generators for a stabilizer code and the corresponding computational basis codewords defined in terms of Pauli operators are reviewed and illustrated in detail. Examples are given to demonstrate the relation between the X- and Z- matrices of generators of stabilizer group and the corresponding encoding circuit. Then based on the general framework of operator quantum error correction, we provide a general scheme on the construction of encoding and decoding circuits for the [n, k, d] codes. Finally, a detailed procedure to construct the recovery channel using encoding circuits and encoded computational basis codewords are demonstrated for [5, 1, 3] code and [8, 3, 3] code step by step as examples, with heuristic explanations based on necessary and sufficient conditions for quantum error correction. Possible future study and open problems will also be mentioned.

•Jan 1, 2016•0 citations

Recovery Algorithm for Correlated Errors in Permutation-Invariant Quantum Codes

Omprakash Chandra, Yingkai Ouyang, Gopikrishnan Muraleedharan +1 more

Quantum Error Recovery (QER) uses knowledge of the error channel acting on a quantum system to find optimal recovery maps. The scheme restores the uncorrupted state with a fidelity exceeding that achieved by noise parameter independent quantum error correction. We use a generic coherent QER map implemented with a quantum circuit acting on the system together with ancillary qubits to recover quantum information stored in permutation invariant (PI) codes. PI codes admit tunable parameters to suit the noise model and benefit from simple recovery operation circuits with reduced addressability requirements, unlike stabilizer codes. We showcase the method by modeling QER in PI codes after collective and local symmetric correlated amplitude-damping (AD) noise, a non-Pauli noise process for which stabilizer codes often require additional overhead. We also propose a new PI code family called CAD codes with explicit examples on 4 and 9 qubits for global symmetric AD errors. We show that CAD9 (supported on 9 qubits) code beats many existing codes by more than one order of magnitude. For the CAD4 code, which perfectly corrects 1 global symmetric AD error, the compiled recovery circuit consists of 10 system and system-ancilla gates which can be realized from linear geometric phase gates. Our work provides a direct path from optimized recovery maps to experimentally implementable, low-overhead protocols.

quant-pharXiv:2607.02346•Jul 3, 2026•1 citation

Quantum noise simulation: A software module for QuCirDET

Konstantinos P. Prousalis, Nikos Konofaos

An autonomous software module for the estimation of quantum circuit noise is preseneted. Quantum noise is stochastically generated in quantum systems as decoherence, or during gate operations. The simulation is allowed for a single data block made of qubits. A simple quantum error correction protocol runs with a selected quantum error correction code and the module estimates the probability that the code will fail to work under particular noise regimes. The error correction protocol is described and the estimation method is analysed. The adopted module is integrated into QuCirDET maintaining its independence from the interface. The design tool can be used to create and test decoding schemes under different quantum codes.

International Conference on Modern Circuits and Systems Technologies•May 1, 2017•0 citations

Quantum Error Correction Decoheres Noise

Stefanie J. Beale, Joel J. Wallman, Mauricio Gutiérrez +2 more

Typical studies of quantum error correction assume probabilistic Pauli noise, largely because it is relatively easy to analyze and simulate. Consequently, the effective logical noise due to physically realistic coherent errors is relatively unknown. Here, we prove that encoding a system in a stabilizer code and measuring error syndromes decoheres errors, that is, causes coherent errors to converge toward probabilistic Pauli errors, even when no recovery operations are applied. Two practical consequences are that the error rate in a logical circuit is well quantified by the average gate fidelity at the logical level and that essentially optimal recovery operators can be determined by independently optimizing the logical fidelity of the effective noise per syndrome.

arXiv:1805.08802•Physical Review Letters•Nov 5, 2018•85 citations
The quantum noise encumbrance caused by quantum error-correcting protocols is studied via numerical treatments. Noise evolution implies that the noise magnitude order may change dynamically during quantum computations. The rate of noise level deterioration is a function of the computer’s architecture and physical implementation. Various stabilizer codes with small blocks are studied under dynamic noise regimes, which change the noise magnitude order within a specified time period. The Monte-Carlo sampling simulation method is used to determine the survival probabilities for these codes under evolving error rates. A hypothetical q-step quantum algorithm is stabilized by the repeated application of the recovery protocol, and the proposed estimation method is applied. The estimation method is applied concurrently with the execution of the algorithm. The recovery process is simulated with the aid of a software tool that can be parameterized based on the noise model and the encoding error-correction scheme. Examples show the utility of this tool for quantum coding studies.
Quantum error-correcting (QEC) stabilizer codes enable protection of quantum information against errors during storage and processing. Simulation of noisy QEC codes is used to identify the noise parameters necessary for advantageous operation of logical qubits in realistic quantum computing architectures. Typical quantum error-correction techniques contain intermediate measurements and classical feedback that determine the actual noisy circuit sequence in an instance of performing the protocol. Dynamical subset sampling enables efficient simulation of such nondeterministic quantum error-correcting protocols for any type of quantum circuit and incoherent noise of low strength. As an importance sampling technique, dynamical subset sampling allows one to effectively make use of computational resources to only sample the most relevant sequences of quantum circuits in order to estimate a protocol's logical failure rate with well-defined error bars. We demonstrate the capabilities of dynamical subset sampling with examples from fault-tolerant (FT) QEC. We show that, in a typical stabilizer simulation with incoherent Pauli noise of strength p=10−3 , our method can reach a required sampling accuracy on the logical failure rate with two orders of magnitude fewer samples than direct Monte Carlo simulation. Furthermore, dynamical subset sampling naturally allows for efficient simulation of realistic multi-parameter noise models describing faulty quantum processors. It can be applied not only for QEC in the circuit model but any noisy quantum computing framework with incoherent fault operators including measurement-based quantum computation and quantum networks. Published by the American Physical Society 2024
Quantum computers (QCs) must implement quantum error correcting codes (QECCs) to protect their logical qubits from errors, and modeling the effectiveness of QECCs on QCs is an important problem for evaluating the QC architecture. The previously developed Monte Carlo (MC) error models may take days or weeks of execution to produce an accurate result due to their random sampling approach. We present an alternative deterministic error model that generates, over the course of executing the quantum program, a probability tree of the QC's error states. By calculating the fidelity of the quantum program directly, this error model has the potential for enormous speedups over the MC model when applied to small yet useful problem sizes (containing on the order of a dozen logical qubits encoded in the [[7,1,3]] QECC plus associated ancilla). We observe a speedup on the order of 1000X1000X1000X when accuracy is required, and we evaluate the scaling properties of this new deterministic error model.
Quantum information science is a rapidly growing research area. It concerns information theory that makes use of quantum nature of the microscopic world. In reality, quantum systems are vulnerable to disturbance from an external environment, which can lead to decoherence in the system. Thus, the system must be protected from the environmental noise to keep information stored in the quantum registers. In order to realize a working quantum computer and dependable quantum information processing, researchers and engineers have to overcome this difficulty. One of the most promising candidates for overcoming decoherence is Quantum Error Correction. The idea of quantum error correction is to protect quantum information from errors due to decoherence and other quantum noise during the transmission of information in quantum channels. One fundamental question of quantum error correction is the existence of quantum error correcting code for a noisy quantum system. Moreover, constructing practical and operational quantum error correcting schemes in actual quantum computing is of great interest to quantum information scientists. In this thesis, stabilizer codes and a scheme for constructing recovery channels without error syndrome detection are studied. The motivation for construction of recovery channel without error syndrome detection is also given. We first review some basic concepts on stabilizer groups and stabilizer codes. In particular, we consider theories and principles involved in the construction of encoding circuits from the generators of stabilizer group, and propose a new procedure to derive recovery channel for a well known quantum code, the [n, k, d] code. First, an algorithm to obtain the generators for a stabilizer code and the corresponding computational basis codewords defined in terms of Pauli operators are reviewed and illustrated in detail. Examples are given to demonstrate the relation between the X- and Z- matrices of generators of stabilizer group and the corresponding encoding circuit. Then based on the general framework of operator quantum error correction, we provide a general scheme on the construction of encoding and decoding circuits for the [n, k, d] codes. Finally, a detailed procedure to construct the recovery channel using encoding circuits and encoded computational basis codewords are demonstrated for [5, 1, 3] code and [8, 3, 3] code step by step as examples, with heuristic explanations based on necessary and sufficient conditions for quantum error correction. Possible future study and open problems will also be mentioned.
Quantum Error Recovery (QER) uses knowledge of the error channel acting on a quantum system to find optimal recovery maps. The scheme restores the uncorrupted state with a fidelity exceeding that achieved by noise parameter independent quantum error correction. We use a generic coherent QER map implemented with a quantum circuit acting on the system together with ancillary qubits to recover quantum information stored in permutation invariant (PI) codes. PI codes admit tunable parameters to suit the noise model and benefit from simple recovery operation circuits with reduced addressability requirements, unlike stabilizer codes. We showcase the method by modeling QER in PI codes after collective and local symmetric correlated amplitude-damping (AD) noise, a non-Pauli noise process for which stabilizer codes often require additional overhead. We also propose a new PI code family called CAD codes with explicit examples on 4 and 9 qubits for global symmetric AD errors. We show that CAD9 (supported on 9 qubits) code beats many existing codes by more than one order of magnitude. For the CAD4 code, which perfectly corrects 1 global symmetric AD error, the compiled recovery circuit consists of 10 system and system-ancilla gates which can be realized from linear geometric phase gates. Our work provides a direct path from optimized recovery maps to experimentally implementable, low-overhead protocols.
An autonomous software module for the estimation of quantum circuit noise is preseneted. Quantum noise is stochastically generated in quantum systems as decoherence, or during gate operations. The simulation is allowed for a single data block made of qubits. A simple quantum error correction protocol runs with a selected quantum error correction code and the module estimates the probability that the code will fail to work under particular noise regimes. The error correction protocol is described and the estimation method is analysed. The adopted module is integrated into QuCirDET maintaining its independence from the interface. The design tool can be used to create and test decoding schemes under different quantum codes.
Typical studies of quantum error correction assume probabilistic Pauli noise, largely because it is relatively easy to analyze and simulate. Consequently, the effective logical noise due to physically realistic coherent errors is relatively unknown. Here, we prove that encoding a system in a stabilizer code and measuring error syndromes decoheres errors, that is, causes coherent errors to converge toward probabilistic Pauli errors, even when no recovery operations are applied. Two practical consequences are that the error rate in a logical circuit is well quantified by the average gate fidelity at the logical level and that essentially optimal recovery operators can be determined by independently optimizing the logical fidelity of the effective noise per syndrome.