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:2511.05941

Recovery of optical losses with the Petz recovery map

Jinyan Chen, Minjeong Song, Valerio Scarani

quant-phSubmitted Nov 8, 2025• Announced Nov 11, 2025• 0 citations
v1 · Nov 8, 2025v2 · May 26, 2026
arXivHTMLPDF

Abstract

Optical systems are a main platform for quantum information processing, while a hidden challenge in these systems is information loss due to scattering into unmonitored modes, typically modeled as state-independent beam-splitter interactions. While such losses simply erase information encoded across modes, they directly degrade information encoded in the quantum state of a mode. Perfect correction of these Gaussian lossy channels with Gaussian operations alone is known to be impossible. In this work, we investigate the Petz recovery map as an approximate recovery. We construct the Petz recovery of single mode losses and its implementations. In particular, we show that the recovery performance of Petz recovery map is better than the recovery protocol that replaces the noisy state with the belief state. Also, when the reference state is far from the true state, it is better not to use the Petz recovery map but to leave the noisy state instead. We discuss the physical intuition of Petz recovery map and finally shows that it is near-optimal among the considered recovery protocols.

Related papers

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

Recovery map for fermionic Gaussian channels

Brian G. Swingle, Yixu Wang

A recovery map effectively cancels the action of a quantum operation to a partial or full extent. We study the Petz recovery map in the case where the quantum channel and input states are fermionic and Gaussian. Gaussian states are convenient because they are totally determined by their covariance matrix and because they form a closed set under so-called Gaussian channels. Using a Grassmann representation of fermionic Gaussian maps, we show that the Petz recovery map is also Gaussian and determine it explicitly in terms of the covariance matrix of the reference state and the data of the channel. As a by-product, we obtain a formula for the fidelity between two fermionic Gaussian states. We also discuss subtleties arising from the singularities of the involved matrices.

arXiv:1811.04956•Journal of Mathematical Physics•Jul 1, 2019•11 citations

Approximate Reversal of Quantum Gaussian Dynamics

Ludovico Lami, Siddhartha Das, Mark M. Wilde

Recently, there has been focus on determining the conditions under which the data processing inequality for quantum relative entropy is satisfied with approximate equality. The solution of the exact equality case is due to Petz, who showed that the quantum relative entropy between two quantum states stays the same after the action of a quantum channel if and only if there is a reversal channel that recovers the original states after the channel acts. Furthermore, this reversal channel can be constructed explicitly and is now called the Petz recovery map. Recent developments have shown that a variation of the Petz recovery map works well for recovery in the case of approximate equality of the data processing inequality. Our main contribution here is a proof that bosonic Gaussian states and channels possess a particular closure property, namely, that the Petz recovery map associated to a bosonic Gaussian state \sigma and a bosonic Gaussian channel N is itself a bosonic Gaussian channel. We furthermore give an explicit construction of the Petz recovery map in this case, in terms of the mean vector and covariance matrix of the state \sigma and the Gaussian specification of the channel N.

Civil War Book Review•Jan 1, 2018•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

Optimality Condition for the Petz Map

Bikun Li, Zhaoyou Wang, Guo Zheng +2 more

In quantum error correction, the Petz map serves as a perfect recovery map when the Knill-Laflamme conditions are satisfied. Notably, while perfect recovery is generally infeasible for most quantum channels of finite dimension, the Petz map remains a versatile tool with near-optimal performance in recovering quantum states. This work introduces and proves, for the first time, the necessary and sufficient conditions for the optimality of the Petz map in terms of entanglement fidelity. In some special cases, the violation of this condition can be easily characterized by a simple commutator that can be efficiently computed. We provide multiple examples that substantiate our new findings.

arXiv:2410.23622•Physical Review Letters•May 19, 2025•7 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
Optical systems are a main platform for quantum information processing, while a hidden challenge in these systems is information loss due to scattering into unmonitored modes, typically modeled as state-independent beam-splitter interactions. While such losses simply erase information encoded across modes, they directly degrade information encoded in the quantum state of a mode. Perfect correction of these Gaussian lossy channels with Gaussian operations alone is known to be impossible. In this work, we investigate the Petz recovery map as an approximate recovery. We construct the Petz recovery of single mode losses and its implementations. In particular, we show that the recovery performance of Petz recovery map is better than the recovery protocol that replaces the noisy state with the belief state. Also, when the reference state is far from the true state, it is better not to use the Petz recovery map but to leave the noisy state instead. We discuss the physical intuition of Petz recovery map and finally shows that it is near-optimal among the considered recovery protocols.
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.
A recovery map effectively cancels the action of a quantum operation to a partial or full extent. We study the Petz recovery map in the case where the quantum channel and input states are fermionic and Gaussian. Gaussian states are convenient because they are totally determined by their covariance matrix and because they form a closed set under so-called Gaussian channels. Using a Grassmann representation of fermionic Gaussian maps, we show that the Petz recovery map is also Gaussian and determine it explicitly in terms of the covariance matrix of the reference state and the data of the channel. As a by-product, we obtain a formula for the fidelity between two fermionic Gaussian states. We also discuss subtleties arising from the singularities of the involved matrices.
Recently, there has been focus on determining the conditions under which the data processing inequality for quantum relative entropy is satisfied with approximate equality. The solution of the exact equality case is due to Petz, who showed that the quantum relative entropy between two quantum states stays the same after the action of a quantum channel if and only if there is a reversal channel that recovers the original states after the channel acts. Furthermore, this reversal channel can be constructed explicitly and is now called the Petz recovery map. Recent developments have shown that a variation of the Petz recovery map works well for recovery in the case of approximate equality of the data processing inequality. Our main contribution here is a proof that bosonic Gaussian states and channels possess a particular closure property, namely, that the Petz recovery map associated to a bosonic Gaussian state \sigma and a bosonic Gaussian channel N is itself a bosonic Gaussian channel. We furthermore give an explicit construction of the Petz recovery map in this case, in terms of the mean vector and covariance matrix of the state \sigma and the Gaussian specification of the channel N.
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.
In quantum error correction, the Petz map serves as a perfect recovery map when the Knill-Laflamme conditions are satisfied. Notably, while perfect recovery is generally infeasible for most quantum channels of finite dimension, the Petz map remains a versatile tool with near-optimal performance in recovering quantum states. This work introduces and proves, for the first time, the necessary and sufficient conditions for the optimality of the Petz map in terms of entanglement fidelity. In some special cases, the violation of this condition can be easily characterized by a simple commutator that can be efficiently computed. We provide multiple examples that substantiate our new findings.
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.