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

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

Hanzhang Zhao, Shenglong Xu

quant-phSubmitted Oct 14, 2026• Announced Oct 15, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks whether Petz recovery can be implemented without separately synthesizing its square-root and inverse-square-root factors. It uses the polar representation of the Petz recovery isometry: for $M=\sum_i |i\rangle_C\otimes\sqrt{\sigma}E_i^\dagger$, recovery is the singular-value sign transformation $\operatorname{sgn}(M)$. Explicit block encodings and an extended isometry give an approximate recovery channel through one QSVT sequence, with auxiliary registers discarded rather than postselected. For full-rank $\sigma$, the main guarantee compares composite encoding–recovery channels: $\frac12\|\mathcal R^{\vec\theta}\circ\mathcal E-\mathcal R_\sigma^{\mathrm{Petz}}\circ\mathcal E\|_\diamond\leq\sqrt{\|\sigma^{-1}\|_\infty\mathcal I}$, where $\mathcal I=1-|\sum_i\lambda_i^2p(\lambda_i/\alpha)|^2$, $\lambda_i^2$ are eigenvalues of $\mathcal E(\sigma)$, and $\alpha$ is the block-encoding normalization. The proof compares recovery isometries and converts a reference-state overlap into a worst-case bound. This loss supports spectrum-weighted angle optimization; uniform sign approximation gives exponential convergence and sufficient iteration count $k=O((\alpha/\lambda_{\min})\log(1/\varepsilon))$ for fixed reference state and spectrum. The sequence uses $2k+1$ block-encoding calls. Haar-random and Hayden–Preskill examples numerically illustrate convergence to ideal Petz fidelity and connect existing postselected and Grover-based decoders within this formulation. Generic Haar-random block encodings typically require exponentially many iterations; entanglement assistance permits a reduced normalization in the Hayden–Preskill setting. Implementation requires coherent unitary and inverse access, reference-state preparation, and spectral information or certified bounds. The numerical examples use one logical qubit and single Haar realizations; practical codes and realistic noise models are left for future study.

Little sign of AI-generated textMissing comparisonStrong assumptions

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
16+5 pages, 4 figures

Related papers

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•18 citations

Universal recovery in approximate quantum error correction

Dor Elimelech, Victor V. Albert, Alexander Barg

Universal recovery -- the existence of a single recovery map that corrects an entire family of error channels -- is a central feature of quantum error correction (QEC). In exact QEC, linearity guarantees that a code correcting a given error set also corrects every channel whose Kraus operators lie in its linear span, and that a single recovery map suffices for all such channels. Approximate quantum error correction (AQEC), which relaxes perfect recovery to recovery with controlled error, has traditionally lacked this structure. In a recent paper (arXiv:2607.22995), we developed a theory of approximate quantum error correction showing that a restricted form of linearity persists in the approximate setting, yielding uniform AQEC guarantees for the family of channels controlled by a given error set. In this work, we complete the picture by establishing the second half of universal recovery in the approximate setting: a single recovery map can simultaneously correct every channel controlled by a given error set. The error-set theory we proposed quantifies approximate correctability through two parameters: the environment-leakage distance, governing worst-case performance, and the Knill--Laflamme Hellinger distance, governing average-case performance. We show here that both quantities also control universal decoding. We further study the Petz map naturally associated with an error set as an explicit universal recovery, and obtain uniform average- and worst-case guarantees across the entire family of channels.

quant-pharXiv:2608.28962•Sep 1, 2026•4 citations

Spectrally Corrected Polynomial Approximation for Quantum Singular Value Transformation

Krishnan Suresh

Quantum Singular Value Transformation (QSVT) provides a unified framework for applying polynomial functions to the singular values of a block-encoded matrix. QSVT prepares a state proportional to $\bA^{-1}\bb$ with circuit depth $O(d\cdot\mathrm{polylog}(N))$, where $d$ is the polynomial degree of the $1/x$ approximation and $N$ is the size of $\bA$. Current polynomial approximation methods are over the continuous interval $[a,1]$, giving $d = O(\sqrt{\kap}\log(1/\varepsilon))$, and make no use of any properties of $\bA$. We observe here that QSVT solution accuracy depends only on the polynomial accuracy at the eigenvalues of $\bA$. When all $N$ eigenvalues are known exactly, a pure spectral polynomial $p_{S}$ can interpolate $1/x$ at these eigenvalues and achieve unit fidelity at reduced degree. But its practical applicability is limited. To address this, we propose a spectral correction that exploits prior knowledge of $K$ eigenvalues of $\bA$. Given any base polynomial $p_0$, such as Remez, of degree $d_0$, a $K\times K$ linear system enforces exact interpolation of $1/x$ only at these $K$ eigenvalues without increasing $d_0$. The spectrally corrected polynomial $p_{SC}$ preserves the continuous error profile between eigenvalues and inherits the parity of $p_0$. QSVT experiments on the 1D Poisson equation demonstrate up to a $5\times$ reduction in circuit depth relative to the base polynomial, at unit fidelity and improved compliance error. The correction is agnostic to the choice of base polynomial and robust to eigenvalue perturbations up to $10\%$ relative error. Extension to the 2D Poisson equation suggests that correcting a small fraction of the spectrum may suffice to achieve fidelity above $0.999$.

quant-pharXiv:2603.03998•Mar 5, 2026•1 citation

The Petz recovery map for optical losses

Jinyan Chen, Minjeong Song, Jared Jia Xuan Chan +1 more

Optical systems are a main platform for quantum information processing. A main challenge is information loss due to scattering in unmonitored modes. These losses are modeled as state-independent beam-splitter interactions, with a thermal state (for all practical purposes, the vacuum) in the second input port. The 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. For single mode losses and Gaussian reference states, the Petz map is found to use either a beam-splitter or a state-independent amplifier, depending on the parameters. Then we study the recovery performance on several examples, showing that it is near-optimal among the considered class of protocols. We also obtain more specific comparisons: Petz is always better than just re-preparing the reference state; but it is worse than doing nothing if the reference state is far from the true state. Finally, we extend our study to losses on two modes, and compare the global Petz map to the local implementation on each mode separately.

quant-pharXiv:2511.05941•Nov 11, 2025•3 citations

Quantum Algorithm for Petz Recovery Channels and Pretty Good Measurements

András Gilyén, Seth Lloyd, Iman Marvian +2 more

The Petz recovery channel plays an important role in quantum information science as an operation that approximately reverses the effect of a quantum channel. The pretty good measurement is a special case of the Petz recovery channel, and it allows for near-optimal state discrimination. A hurdle to the experimental realization of these vaunted theoretical tools is the lack of a systematic and efficient method to implement them. This Letter sets out to rectify this lack: Using the recently developed tools of quantum singular value transformation and oblivious amplitude amplification, we provide a quantum algorithm to implement the Petz recovery channel when given the ability to perform the channel that one wishes to reverse. Moreover, we prove that, in some sense, our quantum algorithm's usage of the channel implementation cannot be improved by more than a quadratic factor. Our quantum algorithm also provides a procedure to perform pretty good measurements when given multiple copies of the states that one is trying to distinguish.

arXiv:2006.16924•Physical Review Letters•Jun 1, 2022•89 citations

Quantum singular value transformation without block encodings: Near-optimal complexity with minimal ancilla

Shantanav Chakraborty, Hazra, Soumyabrata, Tongyang Li +3 more

We develop new algorithms for Quantum Singular Value Transformation (QSVT), a unifying framework that encapsulates most known quantum algorithms and serves as the foundation for new ones. Existing implementations of QSVT rely on block encoding, incurring an intrinsic $O(\log L)$ ancilla overhead and circuit depth $\widetilde{O}(L dλ)$ for polynomial transformations of a Hamiltonian $H=\sum_{k=1}^L H_k$, where $d$ is the polynomial degree and $λ=\sum_{k}\|H_k\|$. We introduce a simple yet powerful approach that utilizes only basic Hamiltonian simulation techniques, namely, Trotter methods, to: (i) eliminate the need for block encoding, (ii) reduce the ancilla overhead to only a single qubit, and (iii) still maintain near-optimal complexity. Our method achieves a circuit depth of $\widetilde{O}(L(dλ_{\mathrm{comm}})^{1+o(1)})$, without requiring any complicated multi-qubit controlled gates. Moreover, $λ_{\mathrm{comm}}$ depends on the nested commutators of the terms of $H$ and can be substantially smaller than $λ$ for many physically relevant Hamiltonians, a feature absent in standard QSVT. To achieve these results, we make use of Richardson extrapolation in a novel way, systematically eliminating errors in any interleaved sequence of arbitrary unitaries and Hamiltonian evolution operators, thereby establishing a general framework that encompasses QSVT but is more broadly applicable. As applications, we develop end-to-end quantum algorithms for solving linear systems and estimating ground state properties of Hamiltonians, both achieving near-optimal complexity without relying on oracular access. Overall, our results establish a new framework for quantum algorithms, significantly reducing hardware overhead while maintaining near-optimal performance, with implications for both near-term and fault-tolerant quantum computing.

arXiv:2504.02385•Apr 3, 2025•31 citations
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.
The paper asks whether Petz recovery can be implemented without separately synthesizing its square-root and inverse-square-root factors. It uses the polar representation of the Petz recovery isometry: for M=∑i∣i⟩C⊗σEi†M=\sum_i |i\rangle_C\otimes\sqrt{\sigma}E_i^\daggerM=∑i​∣i⟩C​⊗σ​Ei†​, recovery is the singular-value sign transformation sgn⁡(M)\operatorname{sgn}(M)sgn(M). Explicit block encodings and an extended isometry give an approximate recovery channel through one QSVT sequence, with auxiliary registers discarded rather than postselected.
For full-rank σ\sigmaσ, the main guarantee compares composite encoding–recovery channels: 12∥Rθ⃗∘E−RσPetz∘E∥⋄≤∥σ−1∥∞I\frac12\|\mathcal R^{\vec\theta}\circ\mathcal E-\mathcal R_\sigma^{\mathrm{Petz}}\circ\mathcal E\|_\diamond\leq\sqrt{\|\sigma^{-1}\|_\infty\mathcal I}21​∥Rθ∘E−RσPetz​∘E∥⋄​≤∥σ−1∥∞​I​, where I=1−∣∑iλi2p(λi/α)∣2\mathcal I=1-|\sum_i\lambda_i^2p(\lambda_i/\alpha)|^2I=1−∣∑i​λi2​p(λi​/α)∣2, λi2\lambda_i^2λi2​ are eigenvalues of E(σ)\mathcal E(\sigma)E(σ), and α\alphaα is the block-encoding normalization. The proof compares recovery isometries and converts a reference-state overlap into a worst-case bound. This loss supports spectrum-weighted angle optimization; uniform sign approximation gives exponential convergence and sufficient iteration count k=O((α/λmin⁡)log⁡(1/ε))k=O((\alpha/\lambda_{\min})\log(1/\varepsilon))k=O((α/λmin​)log(1/ε)) for fixed reference state and spectrum. The sequence uses 2k+12k+12k+1 block-encoding calls.
Haar-random and Hayden–Preskill examples numerically illustrate convergence to ideal Petz fidelity and connect existing postselected and Grover-based decoders within this formulation. Generic Haar-random block encodings typically require exponentially many iterations; entanglement assistance permits a reduced normalization in the Hayden–Preskill setting. Implementation requires coherent unitary and inverse access, reference-state preparation, and spectral information or certified bounds. The numerical examples use one logical qubit and single Haar realizations; practical codes and realistic noise models are left for future study.
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
Universal recovery -- the existence of a single recovery map that corrects an entire family of error channels -- is a central feature of quantum error correction (QEC). In exact QEC, linearity guarantees that a code correcting a given error set also corrects every channel whose Kraus operators lie in its linear span, and that a single recovery map suffices for all such channels. Approximate quantum error correction (AQEC), which relaxes perfect recovery to recovery with controlled error, has traditionally lacked this structure. In a recent paper (arXiv:2607.22995), we developed a theory of approximate quantum error correction showing that a restricted form of linearity persists in the approximate setting, yielding uniform AQEC guarantees for the family of channels controlled by a given error set. In this work, we complete the picture by establishing the second half of universal recovery in the approximate setting: a single recovery map can simultaneously correct every channel controlled by a given error set. The error-set theory we proposed quantifies approximate correctability through two parameters: the environment-leakage distance, governing worst-case performance, and the Knill--Laflamme Hellinger distance, governing average-case performance. We show here that both quantities also control universal decoding. We further study the Petz map naturally associated with an error set as an explicit universal recovery, and obtain uniform average- and worst-case guarantees across the entire family of channels.
Quantum Singular Value Transformation (QSVT) provides a unified framework for applying polynomial functions to the singular values of a block-encoded matrix. QSVT prepares a state proportional to $\bA^{-1}\bb$ with circuit depth O(d⋅polylog(N))O(d\cdot\mathrm{polylog}(N))O(d⋅polylog(N)), where ddd is the polynomial degree of the 1/x1/x1/x approximation and NNN is the size of $\bA$. Current polynomial approximation methods are over the continuous interval [a,1][a,1][a,1], giving $d = O(\sqrt{\kap}\log(1/\varepsilon))$, and make no use of any properties of $\bA$. We observe here that QSVT solution accuracy depends only on the polynomial accuracy at the eigenvalues of $\bA$. When all NNN eigenvalues are known exactly, a pure spectral polynomial pSp_{S}pS​ can interpolate 1/x1/x1/x at these eigenvalues and achieve unit fidelity at reduced degree. But its practical applicability is limited. To address this, we propose a spectral correction that exploits prior knowledge of KKK eigenvalues of $\bA$. Given any base polynomial p0p_0p0​, such as Remez, of degree d0d_0d0​, a K×KK\times KK×K linear system enforces exact interpolation of 1/x1/x1/x only at these KKK eigenvalues without increasing d0d_0d0​. The spectrally corrected polynomial pSCp_{SC}pSC​ preserves the continuous error profile between eigenvalues and inherits the parity of p0p_0p0​. QSVT experiments on the 1D Poisson equation demonstrate up to a 5×5\times5× reduction in circuit depth relative to the base polynomial, at unit fidelity and improved compliance error. The correction is agnostic to the choice of base polynomial and robust to eigenvalue perturbations up to 10%10\%10% relative error. Extension to the 2D Poisson equation suggests that correcting a small fraction of the spectrum may suffice to achieve fidelity above 0.9990.9990.999.
Optical systems are a main platform for quantum information processing. A main challenge is information loss due to scattering in unmonitored modes. These losses are modeled as state-independent beam-splitter interactions, with a thermal state (for all practical purposes, the vacuum) in the second input port. The 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. For single mode losses and Gaussian reference states, the Petz map is found to use either a beam-splitter or a state-independent amplifier, depending on the parameters. Then we study the recovery performance on several examples, showing that it is near-optimal among the considered class of protocols. We also obtain more specific comparisons: Petz is always better than just re-preparing the reference state; but it is worse than doing nothing if the reference state is far from the true state. Finally, we extend our study to losses on two modes, and compare the global Petz map to the local implementation on each mode separately.
The Petz recovery channel plays an important role in quantum information science as an operation that approximately reverses the effect of a quantum channel. The pretty good measurement is a special case of the Petz recovery channel, and it allows for near-optimal state discrimination. A hurdle to the experimental realization of these vaunted theoretical tools is the lack of a systematic and efficient method to implement them. This Letter sets out to rectify this lack: Using the recently developed tools of quantum singular value transformation and oblivious amplitude amplification, we provide a quantum algorithm to implement the Petz recovery channel when given the ability to perform the channel that one wishes to reverse. Moreover, we prove that, in some sense, our quantum algorithm's usage of the channel implementation cannot be improved by more than a quadratic factor. Our quantum algorithm also provides a procedure to perform pretty good measurements when given multiple copies of the states that one is trying to distinguish.
We develop new algorithms for Quantum Singular Value Transformation (QSVT), a unifying framework that encapsulates most known quantum algorithms and serves as the foundation for new ones. Existing implementations of QSVT rely on block encoding, incurring an intrinsic O(log⁡L)O(\log L)O(logL) ancilla overhead and circuit depth O~(Ldλ)\widetilde{O}(L dλ)O(Ldλ) for polynomial transformations of a Hamiltonian H=∑k=1LHkH=\sum_{k=1}^L H_kH=∑k=1L​Hk​, where ddd is the polynomial degree and λ=∑k∥Hk∥λ=\sum_{k}\|H_k\|λ=∑k​∥Hk​∥. We introduce a simple yet powerful approach that utilizes only basic Hamiltonian simulation techniques, namely, Trotter methods, to: (i) eliminate the need for block encoding, (ii) reduce the ancilla overhead to only a single qubit, and (iii) still maintain near-optimal complexity. Our method achieves a circuit depth of O~(L(dλcomm)1+o(1))\widetilde{O}(L(dλ_{\mathrm{comm}})^{1+o(1)})O(L(dλcomm​)1+o(1)), without requiring any complicated multi-qubit controlled gates. Moreover, λcommλ_{\mathrm{comm}}λcomm​ depends on the nested commutators of the terms of HHH and can be substantially smaller than λλλ for many physically relevant Hamiltonians, a feature absent in standard QSVT. To achieve these results, we make use of Richardson extrapolation in a novel way, systematically eliminating errors in any interleaved sequence of arbitrary unitaries and Hamiltonian evolution operators, thereby establishing a general framework that encompasses QSVT but is more broadly applicable. As applications, we develop end-to-end quantum algorithms for solving linear systems and estimating ground state properties of Hamiltonians, both achieving near-optimal complexity without relying on oracular access. Overall, our results establish a new framework for quantum algorithms, significantly reducing hardware overhead while maintaining near-optimal performance, with implications for both near-term and fault-tolerant quantum computing.