Petz Recovery Research Articles

Integral fluctuation theorems and trace-preserving map.

The detailed fluctuation theorem implies symmetry in the generating function of entropy production probability. The integral fluctuation theorem directly follows from this symmetry and the normalization of the probability. In this paper, we rewrite the generating function by integrating measurements and evolution into a constructed mapping. This mapping is completely positive, and the original integral fluctuation theorem is determined by the trace-preserving property of these constructed maps. We illustrate the convenience of this method by discussing the eigenstate fluctuation theorem and heat exchange between two baths. This set of methods is also applicable to the generating functions of quasiprobability, where we observe the Petz recovery map arising naturally from this approach.

Jaynes-Cummings atoms coupled to a structured environment: leakage elimination operators and the Petz recovery maps

We consider the Jaynes-Cummings (JC) model embedded in a structured environment, where the atom inside an optical cavity will be affected by a hierarchical environment consisting of the cavity and its environment. We propose several effective strategies to control and suppress the decoherence effects to protect the quantum coherence of the JC atom. We study the non-perturbative control of the system dynamics by means of the leakage elimination operators. We also investigate a full quantum state reversal scheme by engineering the system and its coupling to the bath via the Petz recovery map. Our findings conclude that, with the Petz recovery map, the dynamics of the JC atom can be fully recovered regardless of Markov or non-Markovian noises. Finally, we show that our quantum control and recovery methods are effective at protecting different aspects of the system coherence.

Petz recovery maps for qudit quantum channels

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.

Monotonicity of optimized quantum f-divergence

Optimized quantum f-divergence was first introduced by Wilde and further explored by Li and Wilde later. Wilde raised the question of whether the monotonicity of optimized quantum f-divergence can be generalized to maps that are not quantum channels. In this paper, we answer this question by generalizing the monotonicity of optimized quantum f-divergences to positive trace preserving maps satisfying a Schwarz inequality. Any 2-positive maps satisfy such a Schwarz inequality. The main tool in this paper is the Petz recovery map.

Petz recovery from subsystems in conformal field theory

We probe the multipartite entanglement structure of the vacuum state of a CFT in 1+1 dimensions, using recovery operations that attempt to reconstruct the density matrix in some region from its reduced density matrices on smaller subregions. We use an explicit recovery channel known as the twirled Petz map, and study distance measures such as the fidelity, relative entropy, and trace distance between the original state and the recovered state. One setup we study in detail involves three contiguous intervals A, B and C on a spatial slice, where we can view these quantities as measuring correlations between A and C that are not mediated by the region B that lies between them. We show that each of the distance measures is both UV finite and independent of the operator content of the CFT, and hence depends only on the central charge and the cross-ratio of the intervals. We evaluate these universal quantities numerically using lattice simulations in critical spin chain models, and derive their analytic forms in the limit where A and C are close using the OPE expansion. In the case where A and C are far apart, we find a surprising non-commutativity of the replica trick with the OPE limit. For all values of the cross-ratio, the fidelity is strictly better than a general information-theoretic lower bound in terms of the conditional mutual information. We also compare the mutual information between various subsystems in the original and recovered states, which leads to a more qualitative understanding of the differences between them. Further, we introduce generalizations of the recovery operation to more than three adjacent intervals, for which the fidelity is again universal with respect to the operator content.

The Petz (lite) recovery map for the scrambling channel

Abstract We study properties of the Petz recovery map in chaotic systems, such as the Hayden–Preskill setup for evaporating black holes and the Sachdev–Ye–Kitaev (SYK) model. Since these systems exhibit the phenomenon called scrambling, we expect that the expression of the recovery channel $\mathcal {R}$ gets simplified, given by just the adjoint $\mathcal {N}^{\dagger }$ of the original channel $\mathcal {N}$ which defines the time evolution of the states in the code subspace embedded into the physical Hilbert space. We check this phenomenon in two examples. The first one is the Hayden–Preskill setup described by Haar random unitaries. We compute the relative entropy $S(\mathcal {R}\left[\mathcal {N}[\rho ]\right] ||\rho )$ and show that it vanishes when the decoupling is archived. We further show that the simplified recovery map is equivalent to the protocol proposed by Yoshida and Kitaev. The second example is the SYK model where the 2D code subspace is defined by an insertion of a fermionic operator, and the system is evolved by the SYK Hamiltonian. We check the recovery phenomenon by relating some matrix elements of an output density matrix $\langle{T}|\mathcal {R}[\mathcal {N}[\rho ]]|{T^{\prime }}\rangle$ to Rényi-two modular flowed correlators, and show that they coincide with the elements for the input density matrix with small error after twice the scrambling time.

Black hole interior Petz map reconstruction and Papadodimas-Raju proposal

We study the reconstruction of the bulk operators in AdS/CFT when the geometry contains a black hole. The black hole exterior can be mapped to the CFT via a very simple Petz map which coincides with the HKLL map reconstruction of the black hole exterior. For the interior modes of the bulk theory, using the definition of the Petz recovery channel in modular theory, we can find the mapping from the black hole interior to the dual boundary theory. In the case of the evaporating black hole, it is expected that the interior modes map to some operators that have support only on the bath system, the cavity that absorbs the Hawking radiation. The most important observation that we have here is that in the case that we have a typical black hole microstate in the bulk, the CFT dual of the interior modes that we can find using the Petz recovery channel are exactly the operators that so-called “mirror operator “ in the Papadodimas-Raju proposal. Therefore, we can interpret Papadodimas-Raju proposal as an example of the Petz map reconstruction. It may help us answer some open questions about their procedure.

Explicit reconstruction of the entanglement wedge via the Petz map

We revisit entanglement wedge reconstruction in AdS/CFT using the Petz recovery channel. In the case of a spherical region on the boundary, we show that the Petz map reproduces the AdS-Rindler HKLL reconstruction. Moreover, for a generic subregion of the boundary, we could obtain the same boundary representation of a local bulk field lies in the entanglement wedge as the one proposed earlier in [1, 2] using properties of the modular flow.

Axioms for retrodiction: achieving time-reversal symmetry with a prior

We propose a category-theoretic definition of retrodiction and use it to exhibit a time-reversal symmetry for all quantum channels. We do this by introducing retrodiction families and functors, which capture many intuitive properties that retrodiction should satisfy and are general enough to encompass both classical and quantum theories alike. Classical Bayesian inversion and all rotated and averaged Petz recovery maps define retrodiction families in our sense. However, averaged rotated Petz recovery maps, including the universal recovery map of Junge-Renner-Sutter-Wilde-Winter, do not define retrodiction functors, since they fail to satisfy some compositionality properties. Among all the examples we found of retrodiction families, the original Petz recovery map is the only one that defines a retrodiction functor. In addition, retrodiction functors exhibit an inferential time-reversal symmetry consistent with the standard formulation of quantum theory. The existence of such a retrodiction functor seems to be in stark contrast to the many no-go results on time-reversal symmetry for quantum channels. One of the main reasons is because such works defined time-reversal symmetry on the category of quantum channels alone, whereas we define it on the category of quantum channels and quantum states. This fact further illustrates the importance of a prior in time-reversal symmetry.

Observational entropy, coarse-grained states, and the Petz recovery map: information-theoretic properties and bounds

Observational entropy provides a general notion of quantum entropy that appropriately interpolates between Boltzmann’s and Gibbs’ entropies, and has recently been argued to provide a useful measure of out-of-equilibrium thermodynamic entropy. Here we study the mathematical properties of observational entropy from an information-theoretic viewpoint, making use of recently strengthened forms of the monotonicity property of quantum relative entropy. We present new bounds on observational entropy applying in general, as well as bounds and identities related to sequential and post-processed measurements. A central role in this work is played by what we call the ‘coarse-grained’ state, which emerges from the measurement’s statistics by Bayesian retrodiction, without presuming any knowledge about the ‘true’ underlying state being measured. The degree of distinguishability between such a coarse-grained state and the true (but generally unobservable) one is shown to provide upper and lower bounds on the difference between observational and von Neumann entropies.

State retrieval beyond Bayes' retrodiction

In the context of irreversible dynamics, associating to a physical process its intuitive reverse can result to be a quite ambiguous task. It is a standard choice to define the reverse process using Bayes' theorem, but, in general, this choice is not optimal. In this work we explore whether it is possible to characterise an optimal reverse map building from the concept of state retrieval maps. In doing so, we propose a set of principles that state retrieval maps should satisfy. We find out that the Bayes inspired reverse is just one case in a whole class of possible choices, which can be optimised to give a map retrieving the initial state more precisely than the Bayes rule. Our analysis has the advantage of naturally extending to the quantum regime. In fact, we find a class of reverse transformations containing the Petz recovery map as a particular case, corroborating its interpretation as quantum analogue of the Bayes retrieval. Finally, we present numerical evidences that by adding a single extra axiom one can isolate the usual reverse process derived from Bayes' theorem.

Quantum Algorithm for Petz Recovery Channels and Pretty Good Measurements.

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 singularvaluetransformation and oblivious amplitude amplification, we provide a quantum algorithm to implement thePetz 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.

Revisiting the equality conditions of the data-processing inequality for the sandwiched Rényi divergence

We provide a transparent, simple, and unified treatment of recent results on the equality conditions for the data-processing inequality of the sandwiched quantum Rényi divergence, including the statement that the equality in the data-processing implies recoverability via the Petz recovery map for the full range of the Rényi parameter α recently proven by Jenčová [J. Phys. A: Math. Theor. 50, 085303 (2017)]. We also obtain a new set of equality conditions, generalizing a previous result by Leditzky et al. [Lett. Math. Phys. 107, 61 (2017)].

Approximating invertible maps by recovery channels: Optimality and an application to non-Markovian dynamics

We investigate the problem of reversing quantum dynamics, specifically via optimal Petz recovery maps. We focus on typical decoherence channels, such as dephasing, depolarizing and amplitude damping. We illustrate how well a physically implementable recovery map simulates an inverse evolution. We extend this idea to explore the use of recovery maps as an approximation of inverse maps, and apply it in the context of non-Markovian dynamics. We show how this strategy attenuates non-Markovian effects, such as the backflow of information.

Approximate Petz Recovery from the Geometry of Density Operators

We derive a new bound on the effectiveness of the Petz map as a universal recovery channel in approximate quantum error correction using the second sandwiched R\'{e}nyi relative entropy $\tilde{D}_{2}$. For large Hilbert spaces, our bound implies that the Petz map performs quantum error correction with order-$\epsilon$ accuracy whenever the data processing inequality for $\tilde{D}_{2}$ is saturated up to terms of order $\epsilon^2$ times the inverse Hilbert space dimension. Conceptually, our result is obtained by extending arXiv:2011.03473, in which we studied exact saturation of the data processing inequality using differential geometry, to the case of approximate saturation. Important roles are played by (i) the fact that the exponential of the second sandwiched R\'{e}nyi relative entropy is quadratic in its first argument, and (ii) the observation that the second sandwiched R\'{e}nyi relative entropy satisfies the data processing inequality even when its first argument is a non-positive Hermitian operator.

Reversing Lindblad Dynamics via Continuous Petz Recovery Map.

An important issue in developing quantum technology is that quantum states are so sensitive to noise. We propose a protocol that introduces reverse dynamics, in order to precisely control quantum systems against noise described by the Lindblad master equation. The reverse dynamics can be obtained by constructing the Petz recovery map in continuous time. By providing the exact form of the Hamiltonian and jump operators for the reverse dynamics, we explore the potential of utilizing the near-optimal recovery of the Petz map in controlling noisy quantum dynamics. While time-dependent dissipation engineering enables us to fully recover a single quantum trajectory, we also design a time-independent recovery protocol to protect encoded quantum information against decoherence. Our protocol can efficiently suppress only the noise part of dynamics thereby providing an effective unitary evolution of the quantum system.

Recoverability for optimized quantum f-divergences

The optimized quantum f-divergences form a family of distinguishability measures that includes the quantum relative entropy and the sandwiched Rényi relative quasi-entropy as special cases. In this paper, we establish physically meaningful refinements of the data-processing inequality for the optimized f-divergence. In particular, the refinements state that the absolute difference between the optimized f-divergence and its channel-processed version is an upper bound on how well one can recover a quantum state acted upon by a quantum channel, whenever the recovery channel is taken to be a rotated Petz recovery channel. Not only do these results lead to physically meaningful refinements of the data-processing inequality for the sandwiched Rényi relative entropy, but they also have implications for perfect reversibility (i.e. quantum sufficiency) of the optimized f-divergences. Along the way, we improve upon previous physically meaningful refinements of the data-processing inequality for the standard f-divergence, as established in recent work of Carlen and Vershynina [arXiv:1710.02409, arXiv:1710.08080]. Finally, we extend the definition of the optimized f-divergence, its data-processing inequality, and all of our recoverability results to the general von Neumann algebraic setting, so that all of our results can be employed in physical settings beyond those confined to the most common finite-dimensional setting of interest in quantum information theory.

Conditional Distributions for Quantum Systems

Conditional distributions, as defined by the Markov category framework, are studied in the setting of matrix algebras (quantum systems). Their construction as linear unital maps are obtained via a categorical Bayesian inversion procedure. Simple criteria establishing when such linear maps are positive are obtained. Several examples are provided, including the standard EPR scenario, where the EPR correlations are reproduced in a purely compositional (categorical) manner. A comparison between the Bayes map, the Petz recovery map, and the Leifer-Spekkens acausal belief propagation is provided, illustrating some similarities and key differences.

Approximate Tensorization of the Relative Entropy for Noncommuting Conditional Expectations

In this paper, we derive a new generalisation of the strong subadditivity of the entropy to the setting of general conditional expectations onto arbitrary finite-dimensional von Neumann algebras. This generalisation, referred to as approximate tensorization of the relative entropy, consists in a lower bound for the sum of relative entropies between a given density and its respective projections onto two intersecting von Neumann algebras in terms of the relative entropy between the same density and its projection onto an algebra in the intersection, up to multiplicative and additive constants. In particular, our inequality reduces to the so-called quasi-factorization of the entropy for commuting algebras, which is a key step in modern proofs of the logarithmic Sobolev inequality for classical lattice spin systems. We also provide estimates on the constants in terms of conditions of clustering of correlations in the setting of quantum lattice spin systems. Along the way, we show the equivalence between conditional expectations arising from Petz recovery maps and those of general Davies semigroups.

Recovery map stability for the data processing inequality

Let be a finite dimensional von Neumann algebra and a von Neumann subalgebra of it. For states and on , let and be the corresponding states induced on . The data processing inequality implies that where is the relative entropy. Petz proved that there is equality if and only if , where is the Petz recovery map. We prove a quantitative version of Petz’s theorem. In it simplest form, our bound iswhere is the relative modular operator. Since , this yields a bound that is independent of . We also prove an analogous result with a more complicated constant in which the roles of and are interchanged on the right.Quantum information theoretic inequalities are usually much harder to prove, or differ from, their classical counterparts because classical proofs often rely on conditioning argument that do not carry over to the quantum setting. In particular, quantum conditional expectations rarely preserve expectations—something that always happens in the classical setting. We also prove a simple theorem characterizing states and subalgebras for which conditional expectations do preserve expectation with respect to , illuminating the quantum obstacle to the existence of nicely behaved conditional expectations and the origins the Petz recovery map.