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:2504.20399 · Physical Review A

Petz recovery maps of single-qubit decoherence channels in an ion trap quantum processor

Wen-Han Png, Valerio Scarani

Published Jul 24, 2025• 2 citations
arXivHTMLPDF

Abstract

The Petz recovery map provides a near-optimal reversal of quantum noise, yet proposals for its implementation are only recent. We propose a physical realization of the exact state-specific Petz map in an ion trap for qubit decoherence channels. Our circuit constructions require at most $1 (2)$ ancilla qubits and $3 (20)$ CNOT gates for channels with Kraus rank $2 (>2)$. We analyze typical ion trap errors and construct corresponding Petz maps, simulating their performance under realistic noise modeled by residual spin-motion coupling. Quantum circuits are provided for depolarizing, dephasing, and amplitude damping channels. Focusing on single-shot recovery, suited for present-day devices, we also quantify the precision of prior knowledge required to achieve a recovery error below 0.01 across varying decoherence levels and state purities.

DOI
10.1103/7f8x-n2np

Related papers

Realizing the Petz recovery map on an NMR quantum processor

Gayatri Singh, Ram Sagar Sahani, Vinayak Jagadish +3 more

The Petz recovery map is a central construct in quantum information theory, providing an explicit, channel-aware prescription for reversing the effects of noise. Unlike standard quantum operations, the Petz map is intrinsically dependent on a chosen reference state, which makes its physical implementation and experimental validation particularly challenging. Here, we report an experimental realization of Petz recovery maps on a nuclear magnetic resonance (NMR) quantum processor using the duality quantum computing (DQC) algorithm. We investigate two paradigmatic single-qubit noise models: amplitude damping and phase damping, and construct corresponding families of Petz recovery maps for varying reference states. By systematically tuning the reference state, we experimentally demonstrate the state-adapted nature of Petz recovery, observing both enhanced recovery when the reference state is well matched and fidelity degradation for mismatched choices. Our experimental results show close quantitative agreement with theoretical predictions, providing direct evidence that the Petz recovery map constitutes a physically realizable, reference-state-dependent recovery channel rather than a purely formal inverse of noise. This work bridges the gap between the abstract information-theoretic formulation of Petz recovery and its implementation on a realistic quantum platform, and establishes an experimental benchmark for testing noise-adapted recovery strategies on near-term quantum devices.

arXiv:2508.08998•Physical Review A•Apr 20, 2026•0 citations

Experimental Tabletop Petz recovery of a photonic qubit

Hui Li, Jinyan Chen, Yue Pan +4 more

The quantum information lost in open evolutions cannot be fully recovered, but partial recovery is possible. The Petz recovery map guarantees almost optimal recovery, notably if the chosen reference state is close to the real one. This map has been widely used in theoretical studies, but has been the object of only a handful of experimental realisations, typically under a single fixed noise model. In this work, we describe and implement the Petz recovery map for a versatile class of qubit channels with tunable decoherence and dissipation. The setup we realize is also the first experimental example of ``tabletop reversibility'': for a good range of choices of the reference state, the Petz recovery map can be implemented with the same devices as the forward dissipative evolution, whose effect it is partially undoing. Our results demonstrate that the Petz recovery map can be resource-efficiently realized without requiring complex ancillary resources, providing a feasible pathway for mitigating information loss in quantum systems.

quant-pharXiv:2606.12020•Jun 11, 2026•0 citations

Noise-adapted recovery circuits for quantum error correction

Debjyoti Biswas, Gaurav M. Vaidya, Prabha Mandayam

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

arXiv:2305.11093•Physical Review Research•Oct 15, 2024•10 citations

Petz Recovery through a Single Polar Transformation for Approximate Quantum Error Correction

Hanzhang Zhao, Shenglong Xu

The Petz recovery map provides a near optimal decoder for approximate quantum error correction, but its inverse square-root normalization complicates circuit implementation. We use the polar structure of the Petz recovery isometry to implement recovery through a single quantum singular value transformation (QSVT). We give explicit block-encoding circuits and an extended recovery isometry that yields approximate Petz recovery without postselection. We bound the diamond distance between the approximate and ideal Petz encoding-recovery channels in terms of a spectrum-weighted loss, which provides a channel specific objective for optimizing the QSVT angles. Uniform polynomial approximation yields an asymptotic error bound that decays exponentially with the number of QSVT iterations, at a rate controlled by the smallest nonzero scaled singular value. Applications to Haar-random encoding and the Hayden-Preskill protocol illustrate the tradeoff between circuit depth and recovery accuracy and place existing scrambling decoders within a common Petz recovery framework.

quant-pharXiv:2610.20515•Oct 15, 2026•0 citations

Petz recovery maps for qudit quantum channels

Lea Lautenbacher, Vinayak Jagadish, Francesco Petruccione +1 more

This study delves into the efficacy of the Petz recovery map within the context of two paradigmatic quantum channels: dephasing and amplitude-damping. While prior investigations have predominantly focused on qubits, our research extends this inquiry to higher-dimensional systems. We introduce a novel, state-independent framework based on the Choi-Jamiołkowski isomorphism to evaluate the performance of the Petz map. By analyzing different channels and the (non-)unital nature of these processes, we emphasize the pivotal role of the reference state selection in determining the map's effectiveness. Furthermore, our analysis underscores the considerable impact of suboptimal choices on performance, prompting a broader consideration of factors such as system dimensionality.

arXiv:2305.11658•Physics Letters A•May 14, 2024•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
The Petz recovery map provides a near-optimal reversal of quantum noise, yet proposals for its implementation are only recent. We propose a physical realization of the exact state-specific Petz map in an ion trap for qubit decoherence channels. Our circuit constructions require at most 1(2)1 (2)1(2) ancilla qubits and 3(20)3 (20)3(20) CNOT gates for channels with Kraus rank 2(>2)2 (>2)2(>2). We analyze typical ion trap errors and construct corresponding Petz maps, simulating their performance under realistic noise modeled by residual spin-motion coupling. Quantum circuits are provided for depolarizing, dephasing, and amplitude damping channels. Focusing on single-shot recovery, suited for present-day devices, we also quantify the precision of prior knowledge required to achieve a recovery error below 0.01 across varying decoherence levels and state purities.
The Petz recovery map is a central construct in quantum information theory, providing an explicit, channel-aware prescription for reversing the effects of noise. Unlike standard quantum operations, the Petz map is intrinsically dependent on a chosen reference state, which makes its physical implementation and experimental validation particularly challenging. Here, we report an experimental realization of Petz recovery maps on a nuclear magnetic resonance (NMR) quantum processor using the duality quantum computing (DQC) algorithm. We investigate two paradigmatic single-qubit noise models: amplitude damping and phase damping, and construct corresponding families of Petz recovery maps for varying reference states. By systematically tuning the reference state, we experimentally demonstrate the state-adapted nature of Petz recovery, observing both enhanced recovery when the reference state is well matched and fidelity degradation for mismatched choices. Our experimental results show close quantitative agreement with theoretical predictions, providing direct evidence that the Petz recovery map constitutes a physically realizable, reference-state-dependent recovery channel rather than a purely formal inverse of noise. This work bridges the gap between the abstract information-theoretic formulation of Petz recovery and its implementation on a realistic quantum platform, and establishes an experimental benchmark for testing noise-adapted recovery strategies on near-term quantum devices.
The quantum information lost in open evolutions cannot be fully recovered, but partial recovery is possible. The Petz recovery map guarantees almost optimal recovery, notably if the chosen reference state is close to the real one. This map has been widely used in theoretical studies, but has been the object of only a handful of experimental realisations, typically under a single fixed noise model. In this work, we describe and implement the Petz recovery map for a versatile class of qubit channels with tunable decoherence and dissipation. The setup we realize is also the first experimental example of ``tabletop reversibility'': for a good range of choices of the reference state, the Petz recovery map can be implemented with the same devices as the forward dissipative evolution, whose effect it is partially undoing. Our results demonstrate that the Petz recovery map can be resource-efficiently realized without requiring complex ancillary resources, providing a feasible pathway for mitigating information loss in quantum systems.
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
The Petz recovery map provides a near optimal decoder for approximate quantum error correction, but its inverse square-root normalization complicates circuit implementation. We use the polar structure of the Petz recovery isometry to implement recovery through a single quantum singular value transformation (QSVT). We give explicit block-encoding circuits and an extended recovery isometry that yields approximate Petz recovery without postselection. We bound the diamond distance between the approximate and ideal Petz encoding-recovery channels in terms of a spectrum-weighted loss, which provides a channel specific objective for optimizing the QSVT angles. Uniform polynomial approximation yields an asymptotic error bound that decays exponentially with the number of QSVT iterations, at a rate controlled by the smallest nonzero scaled singular value. Applications to Haar-random encoding and the Hayden-Preskill protocol illustrate the tradeoff between circuit depth and recovery accuracy and place existing scrambling decoders within a common Petz recovery framework.
This study delves into the efficacy of the Petz recovery map within the context of two paradigmatic quantum channels: dephasing and amplitude-damping. While prior investigations have predominantly focused on qubits, our research extends this inquiry to higher-dimensional systems. We introduce a novel, state-independent framework based on the Choi-Jamiołkowski isomorphism to evaluate the performance of the Petz map. By analyzing different channels and the (non-)unital nature of these processes, we emphasize the pivotal role of the reference state selection in determining the map's effectiveness. Furthermore, our analysis underscores the considerable impact of suboptimal choices on performance, prompting a broader consideration of factors such as system dimensionality.
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.