Related papers: Optimality Condition for the Petz Map
We derive necessary and sufficient conditions for the approximate correctability of a quantum code, generalizing the Knill-Laflamme conditions for exact error correction. Our measure of success of the recovery operation is the worst-case…
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…
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…
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…
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…
Given a tripartite quantum state on $A,B,C$ and the erasure channel on $C$, the rotated Petz map is a recovery channel that acts on $B$ to recover the erased quantum information. The infidelity of the best recovery is upper-bounded by the…
The calculation of the error threshold of quantum error correcting codes typically proceeds as follows. First, syndromes are measured. Then, a decoder infers the error chain and the corresponding correction is applied. The threshold is then…
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…
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…
We demonstrate that there exists a universal, near-optimal recovery map---the transpose channel---for approximate quantum error-correcting codes, where optimality is defined using the worst-case fidelity. Using the transpose channel, we…
The Knill-Laflamme (KL) conditions distinguish exact quantum error correction codes, and it has played a critical role in the discovery of state-of-the-art codes. However, the family of exact codes is a very restrictive one and does not…
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…
In this paper, we discuss the quantum data processing inequality and its refinements that are physically meaningful in the context of approximate recoverability. An important conjecture regarding this due to Seshadreesan et. al. in J. Phys.…
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…
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…
Lieb and Ruskai's strong subadditivity theorem, which shows that the conditional mutual information must be nonnegative, is fundamental in quantum theory. It has numerous applications, such as in quantum error correction. When the mutual…
Recently, a lot of attention has been devoted to finding physically realisable operations that realise as closely as possible certain desired transformations between quantum states, e.g. quantum cloning, teleportation, quantum gates, etc.…
We obtain a lower bound on the maximum number of qubits, $Q^{n, \epsilon}(\mathcal{N})$, which can be transmitted over $n$ uses of a quantum channel $\mathcal{N}$, for a given non-zero error threshold $\epsilon$. To obtain our result, we…
We present a class of numerical algorithms which adapt a quantum error correction scheme to a channel model. Given an encoding and a channel model, it was previously shown that the quantum operation that maximizes the average entanglement…
We derive an extremal equation for optimal completely-positive map which most closely approximates a given transformation between pure quantum states. Moreover, we also obtain an upper bound on the maximal mean fidelity that can be attained…