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:2305.11093 · Physical Review Research

Noise-adapted recovery circuits for quantum error correction

Debjyoti Biswas, Gaurav M. Vaidya, Prabha Mandayam

Published Oct 15, 2024• 10 citations
arXivHTMLPDF

Abstract

Implementing quantum error correction (QEC) protocols is a challenging task in today's era of noisy intermediate-scale quantum devices. We present quantum circuits for a universal, noise-adapted recovery map, often referred to as the Petz map, which is known to achieve close-to-optimal fidelity for arbitrary codes and noise channels. While two of our circuit constructions draw upon algebraic techniques such as isometric extension and block encoding, the third approach breaks down the recovery map into a sequence of two-outcome POVMs. In each of the three cases we improve upon the resource requirements that currently exist in the literature. Apart from Petz recovery circuits, we also present circuits that can directly estimate the fidelity between the encoded state and the recovered state. As a concrete example of our circuit constructions, we implement Petz recovery circuits corresponding to a four-qubit code that is tailor-made to correct for amplitude-damping noise. The efficacy of our noise-adapted recovery circuits is then demonstrated through ideal and noisy simulations on the IBM QasmSimulator. Published by the American Physical Society 2024

DOI
10.1103/physrevresearch.6.043034

Related papers

Universal syndrome-based recovery for noise-adapted quantum error correction

Debjyoti Biswas, Prabha Mandayam

Quantum error correction (QEC) is an essential tool for quantum computing that enables reliable information processing in the presence of noise. Syndrome measurements play a central role in QEC, making it possible to unambiguously identify the location and type of errors. While syndrome extraction is natural for conventional QEC protocols, where the errors satisfy certain algebraic constraints \emph{perfectly}, this feature is largely missing in the framework of approximate or noise-adapted QEC. Rather, noise-adapted recovery maps like the Petz map are used in the latter scenario, but implementing such tailored recovery processes on the hardware can be quite challenging. Here, we address this issue by proposing an algorithmic approach to identifying error syndromes for arbitrary codes and noise processes. We then use our algorithm to develop a variant of the Petz recovery map -- a syndrome-based Petz recovery map -- which can then be implemented via syndrome measurements. We demonstrate the efficacy of our approach in the context of amplitude-damping noise, by constructing the syndrome-based Petz map for the $4$-qubit code. We execute our recovery circuits on IBM quantum hardware to successfully demonstrate break-even performance of a noise-adapted QEC protocol with upto a threefold improvement of the qubit $T_{1}$ times.

arXiv:2510.08719•Oct 9, 2025•0 citations

Demonstrating Noise-adapted Quantum Error Correction With Break-Even Performance

Vismay Joshi, Anubhab Rudra, Sourav Dutta +2 more

The promise of quantum computing is closer to reality today than ever before, thanks to rapid progress in the development of quantum hardware. Even as qubit lifetimes and gate fidelities continue to improve, realizing robust, fault-tolerant quantum computers is contingent upon the successful implementation of quantum error correction (QEC). Conventional QEC schemes have rather high resource overheads and low threshold requirements, making them challenging to implement on present day hardware. Here, we use a recently developed noise-adapted 3-qubit QEC scheme to demonstrate break-even performance against native amplitude-damping (AD) noise on IBM quantum hardware. We use variational quantum circuits to construct hardware-efficient encoding and decoding circuits. This scheme is probabilistic due to the non-unitary nature of the recovery operators, which are implemented via the block-encoding technique. We demonstrate logical qubit lifetimes exceeding those of the physical qubits by performing multiple rounds of QEC. To further protect the qubits from dephasing due to crosstalk, we incorporate dynamical decoupling into our noise-adapted QEC scheme in a seamless fashion. To account for the post-selection overhead, we define a measure of gain, that allows for faithful performance benchmarking of the protocol. Our analysis suggests that the performance of our protocol is limited primarily by the measurement readout fidelity, and is bound to improve with successive generations of quantum processors.

quant-pharXiv:2603.04564•Mar 6, 2026•0 citations

Noise-adapted qudit codes for amplitude-damping noise

Sourav Dutta, Debjyoti Biswas, Prabha Mandayam

Quantum error correction (QEC) plays a critical role in preventing information loss in quantum systems and provides a framework for reliable quantum computation. Identifying quantum codes with nice code parameters for physically motivated noise models remains an interesting challenge. While past work has primarily focused on qubit codes, here we identify a [4,1] qudit error correcting code tailored to protect against amplitude-damping noise. We show that this four-qudit code satisfies the error correction conditions for all single-qudit and a few two-qudit damping errors up to the leading order in the damping parameter $\ensuremath{\gamma}$. We devise a protocol to extract syndromes that unambiguously identify this set of errors, leading to a noise-adapted recovery scheme that achieves a fidelity loss of $O({\ensuremath{\gamma}}^{2})$. For the $d=2$ case, our QEC scheme is identical to the known example of the four-qubit code and the associated syndrome-based recovery. We also assess the performance of this code using the Petz recovery map and note some interesting deviations from the qubit case. Finally, we generalize this construction to a family of $[2M+2,M]$ qudit codes that can approximately correct all the single-qudit and a few two-qudit amplitude-damping errors.

arXiv:2406.02444•Physical Review A•Mar 31, 2025•8 citations

Quantum Codes for Generalized Amplitude-damping Noise

Sourav Dutta, Anubhab Rudra, Manav Seksaria +2 more

Quantum error correcting (QEC) plays a crucial role in protecting quantum information against decoherence and enabling scalable, reliable quantum computing. One of the most realistic and ubiquitous sources of noise affecting quantum hardware today is generalized amplitude-damping (GAD) noise. Conventional, deterministic QEC codes struggle to correct for GAD noise because of their inherent structure, leading to fidelity losses that scale linearly with the damping strength. In this work, we introduce the framework of probabilistic approximate quantum error correction (PAQEC), that combines the flexibility of approximate QEC with the potential of post-selected recovery, enabling high-fidelity, resource-efficient error correction. We construct a five-qubit permutation-invariant code that, under probabilistic recovery, achieves a fidelity loss quadratic in the damping strength, thus outperforming existing QEC codes. Formulating PAQEC as an optimization problem, we present a numerical technique based on Charnes-Cooper and semidefinite programming to identify the optimal recovery map for any PAQEC code. Our results establish PAQEC as a powerful tool for developing resource-efficient, high-fidelity quantum codes tailored to realistic noise, with promising implications for near-term quantum devices and future fault-tolerant architectures.

quant-pharXiv:2609.15924•Sep 15, 2026•0 citations

Noise-adapted quantum error correction for non-Markovian noise

Debjyoti Biswas, Shrikant Utagi, Prabha Mandayam

We consider the problem of quantum error correction (QEC) for non-Markovian noise. Using the well-known Petz recovery map, we first show that conditions for approximate QEC can be easily generalized for the case of non-Markovian noise in the strong-coupling regime where the noise map becomes non-completely-positive at intermediate times. While certain approximate QEC schemes are ineffective against quantum non-Markovian noise, in the sense that the fidelity vanishes in finite time, the Petz map adapted to non-Markovian noise uniquely safeguards the code space even at the maximum noise limit. Focusing on the case of non-Markovian amplitude damping noise, we further show that the non-Markovian Petz map also outperforms the standard, stabilizer-based QEC code. Since implementing such a non-Markovian map poses practical challenges, we also construct a Markovian Petz map that achieves a similar performance, with only a slight compromise on the fidelity. Finally, we also study an example of non-Markovian Pauli noise, namely the non-Markovian dephasing channel. In this case, we show that the non-Markovian Petz recovery preserves the code space even at the high-noise limit for certain noise-adapted codes, whereas the Markovian Petz and stabilizer recoveries are ineffective.

arXiv:2411.09637•Physical Review A•May 8, 2025•4 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•0 citations
Implementing quantum error correction (QEC) protocols is a challenging task in today's era of noisy intermediate-scale quantum devices. We present quantum circuits for a universal, noise-adapted recovery map, often referred to as the Petz map, which is known to achieve close-to-optimal fidelity for arbitrary codes and noise channels. While two of our circuit constructions draw upon algebraic techniques such as isometric extension and block encoding, the third approach breaks down the recovery map into a sequence of two-outcome POVMs. In each of the three cases we improve upon the resource requirements that currently exist in the literature. Apart from Petz recovery circuits, we also present circuits that can directly estimate the fidelity between the encoded state and the recovered state. As a concrete example of our circuit constructions, we implement Petz recovery circuits corresponding to a four-qubit code that is tailor-made to correct for amplitude-damping noise. The efficacy of our noise-adapted recovery circuits is then demonstrated through ideal and noisy simulations on the IBM QasmSimulator. Published by the American Physical Society 2024
Quantum error correction (QEC) is an essential tool for quantum computing that enables reliable information processing in the presence of noise. Syndrome measurements play a central role in QEC, making it possible to unambiguously identify the location and type of errors. While syndrome extraction is natural for conventional QEC protocols, where the errors satisfy certain algebraic constraints \emph{perfectly}, this feature is largely missing in the framework of approximate or noise-adapted QEC. Rather, noise-adapted recovery maps like the Petz map are used in the latter scenario, but implementing such tailored recovery processes on the hardware can be quite challenging. Here, we address this issue by proposing an algorithmic approach to identifying error syndromes for arbitrary codes and noise processes. We then use our algorithm to develop a variant of the Petz recovery map -- a syndrome-based Petz recovery map -- which can then be implemented via syndrome measurements. We demonstrate the efficacy of our approach in the context of amplitude-damping noise, by constructing the syndrome-based Petz map for the 444-qubit code. We execute our recovery circuits on IBM quantum hardware to successfully demonstrate break-even performance of a noise-adapted QEC protocol with upto a threefold improvement of the qubit T1T_{1}T1​ times.
The promise of quantum computing is closer to reality today than ever before, thanks to rapid progress in the development of quantum hardware. Even as qubit lifetimes and gate fidelities continue to improve, realizing robust, fault-tolerant quantum computers is contingent upon the successful implementation of quantum error correction (QEC). Conventional QEC schemes have rather high resource overheads and low threshold requirements, making them challenging to implement on present day hardware. Here, we use a recently developed noise-adapted 3-qubit QEC scheme to demonstrate break-even performance against native amplitude-damping (AD) noise on IBM quantum hardware. We use variational quantum circuits to construct hardware-efficient encoding and decoding circuits. This scheme is probabilistic due to the non-unitary nature of the recovery operators, which are implemented via the block-encoding technique. We demonstrate logical qubit lifetimes exceeding those of the physical qubits by performing multiple rounds of QEC. To further protect the qubits from dephasing due to crosstalk, we incorporate dynamical decoupling into our noise-adapted QEC scheme in a seamless fashion. To account for the post-selection overhead, we define a measure of gain, that allows for faithful performance benchmarking of the protocol. Our analysis suggests that the performance of our protocol is limited primarily by the measurement readout fidelity, and is bound to improve with successive generations of quantum processors.
Quantum error correction (QEC) plays a critical role in preventing information loss in quantum systems and provides a framework for reliable quantum computation. Identifying quantum codes with nice code parameters for physically motivated noise models remains an interesting challenge. While past work has primarily focused on qubit codes, here we identify a [4,1] qudit error correcting code tailored to protect against amplitude-damping noise. We show that this four-qudit code satisfies the error correction conditions for all single-qudit and a few two-qudit damping errors up to the leading order in the damping parameter $\ensuremath{\gamma}$. We devise a protocol to extract syndromes that unambiguously identify this set of errors, leading to a noise-adapted recovery scheme that achieves a fidelity loss of $O({\ensuremath{\gamma}}^{2})$. For the d=2d=2d=2 case, our QEC scheme is identical to the known example of the four-qubit code and the associated syndrome-based recovery. We also assess the performance of this code using the Petz recovery map and note some interesting deviations from the qubit case. Finally, we generalize this construction to a family of [2M+2,M][2M+2,M][2M+2,M] qudit codes that can approximately correct all the single-qudit and a few two-qudit amplitude-damping errors.
Quantum error correcting (QEC) plays a crucial role in protecting quantum information against decoherence and enabling scalable, reliable quantum computing. One of the most realistic and ubiquitous sources of noise affecting quantum hardware today is generalized amplitude-damping (GAD) noise. Conventional, deterministic QEC codes struggle to correct for GAD noise because of their inherent structure, leading to fidelity losses that scale linearly with the damping strength. In this work, we introduce the framework of probabilistic approximate quantum error correction (PAQEC), that combines the flexibility of approximate QEC with the potential of post-selected recovery, enabling high-fidelity, resource-efficient error correction. We construct a five-qubit permutation-invariant code that, under probabilistic recovery, achieves a fidelity loss quadratic in the damping strength, thus outperforming existing QEC codes. Formulating PAQEC as an optimization problem, we present a numerical technique based on Charnes-Cooper and semidefinite programming to identify the optimal recovery map for any PAQEC code. Our results establish PAQEC as a powerful tool for developing resource-efficient, high-fidelity quantum codes tailored to realistic noise, with promising implications for near-term quantum devices and future fault-tolerant architectures.
We consider the problem of quantum error correction (QEC) for non-Markovian noise. Using the well-known Petz recovery map, we first show that conditions for approximate QEC can be easily generalized for the case of non-Markovian noise in the strong-coupling regime where the noise map becomes non-completely-positive at intermediate times. While certain approximate QEC schemes are ineffective against quantum non-Markovian noise, in the sense that the fidelity vanishes in finite time, the Petz map adapted to non-Markovian noise uniquely safeguards the code space even at the maximum noise limit. Focusing on the case of non-Markovian amplitude damping noise, we further show that the non-Markovian Petz map also outperforms the standard, stabilizer-based QEC code. Since implementing such a non-Markovian map poses practical challenges, we also construct a Markovian Petz map that achieves a similar performance, with only a slight compromise on the fidelity. Finally, we also study an example of non-Markovian Pauli noise, namely the non-Markovian dephasing channel. In this case, we show that the non-Markovian Petz recovery preserves the code space even at the high-noise limit for certain noise-adapted codes, whereas the Markovian Petz and stabilizer recoveries are ineffective.
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.