Optimality Condition for the Petz Map

• URL: http://arxiv.org/abs/2410.23622v4
• Date: Mon, 19 May 2025 19:33:13 GMT
• Title: Optimality Condition for the Petz Map
• Abstract summary: In quantum error correction, the Petz map serves as a perfect recovery map when the Knill-Laflamme conditions are satisfied.<n>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.
• Score: 1.6437645274005803
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Tomographic Limits of the Petz Recovery Map [5.906477178856147]
  We discuss recent results on iterated Petz recovery and relate them to Bayesian approaches to quantum state tomography.<n>We show how an extended Petz construction, by lifting the inference problem to a classical distribution over candidate quantum states, recovers the structure of Bayesian and maximum likelihood tomography.
  arXiv  Detail & Related papers  (2026-08-21T17:12:33Z)
• Quantum Decision Theory for Displacement Detection with Finite-Energy GKP States [46.2474896050764]
  We develop a framework for detecting phase-space displacements with finite-energy, $d$-level Gottesman-Kitaev-Preskill (GKP) probes.<n>For single-mode and entanglement-assisted architectures, we derive the Bayesian minimum-error probability.<n>We benchmark the resulting protocols against coherent-state, direction-matched squeezed-vacuum, and twin-beam schemes.
  arXiv  Detail & Related papers  (2026-08-08T10:32:05Z)
• Experimental Tabletop Petz recovery of a photonic qubit [12.121642774978362]
  We implement the Petz recovery map for a versatile class of qubit channels with tunable decoherence and dissipation.<n>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.
  arXiv  Detail & Related papers  (2026-06-10T12:45:29Z)
• False traps on quantum-classical optimization landscapes [3.213138004671347]
  We show that false traps can still emerge on landscapes even with sufficient parameters.<n>The emergence of false traps is linked to the loss of distinguishability among states or operators in the objective function.
  arXiv  Detail & Related papers  (2026-03-05T14:03:09Z)
• ECPv2: Fast, Efficient, and Scalable Global Optimization of Lipschitz Functions [91.31596562378076]
  ECPv2 is a scalable and theoretically grounded algorithm for global optimization of Lipschitz-continuous functions with unknown Lipschitzs.<n>We show that ECPv2 retains ECP's no-regret guarantees with optimal-time bounds and expands the acceptance region with these findings.
  arXiv  Detail & Related papers  (2025-11-20T17:30:55Z)
• Optimal squeezing to minimize vulnerability to losses [0.0]
  We show that the robustness of the non-Gaussian states to losses can be significantly improved by pre-squeezing of the quantum state.<n>We consider such well-known quantum states as Schrodinger cat, Fock, and banana'' ones.
  arXiv  Detail & Related papers  (2025-09-25T13:58:41Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Resolvability of classical-quantum channels [54.825573549226924]
  We study the resolvability of classical-quantum channels in two settings, for the channel output generated from the worst input, and form the fixed independent and identically distributed (i.i.d.) input. For the fixed-input setting, while the direct part follows from the known quantum soft covering result, we exploit the recent alternative quantum Sanov theorem to solve the strong converse.
  arXiv  Detail & Related papers  (2024-10-22T05:18:43Z)
• Quantum channel correction outperforming direct transmission [0.0]
  Long-distance optical quantum channels are necessarily lossy. Quantum states carrying information in the channel can be probabilistically amplified to compensate for loss, but are destroyed when amplification fails. We perform distillation by heralded amplification to improve a noisy entanglement channel. We employ entanglement swapping to demonstrate that arbitrary quantum information transmission is unconditionally improved.
  arXiv  Detail & Related papers  (2024-06-07T06:09:26Z)
• Robustness of Fixed Points of Quantum Channels and Application to Approximate Quantum Markov Chains [8.056359341994941]
  Given a quantum channel and a state which satisfy a fixed point equation approximately, can one find a new channel and a state, which are respectively close to the original ones, such that they satisfy an exact fixed point equation? We affirmatively answer the question, under fairly general assumptions on these structures, through a compactness argument.
  arXiv  Detail & Related papers  (2024-05-02T17:59:19Z)
• Optimal control in large open quantum systems: the case of transmon readout and reset [44.99833362998488]
  We present a framework that combines the adjoint-state method together with reverse-time backpropagation to solve prohibitively large open-system quantum control problems. We apply this framework to optimize two inherently dissipative operations in superconducting qubits. Our results show that while standard pulses for dispersive readout are nearly optimal, adding a transmon drive during the protocol can yield 2x improvements in fidelity and duration.
  arXiv  Detail & Related papers  (2024-03-21T18:12:51Z)
• Streaming quantum state purification [4.189670490218164]
  Quantum state purification is the task of recovering a nearly pure copy of an unknown pure quantum state. This basic task has applications to quantum communication over noisy channels and quantum computation with imperfect devices. We derive an efficient purification procedure based on the swap test for qudits of any dimension.
  arXiv  Detail & Related papers  (2023-09-28T12:33:09Z)
• Entanglement Distribution in Quantum Repeater with Purification and Optimized Buffer Time [53.56179714852967]
  We explore entanglement distribution using quantum repeaters with optimized buffer time. We observe that increasing the number of memories on end nodes leads to a higher entanglement distribution rate per memory. When imperfect operations are considered, however, we make the surprising observation that the per-memory entanglement rate decreases with increasing number of memories.
  arXiv  Detail & Related papers  (2023-05-23T23:23:34Z)
• Randomized adaptive quantum state preparation [0.0]
  A cost function is minimized to prepare a desired quantum state through an adaptively constructed quantum circuit. We provide theoretical arguments and numerical evidence that convergence to the target state can be achieved for almost all initial states.
  arXiv  Detail & Related papers  (2023-01-10T20:32:49Z)
• Smooth Non-Rigid Shape Matching via Effective Dirichlet Energy Optimization [46.30376601157526]
  We introduce pointwise map smoothness via the Dirichlet energy into the functional map pipeline. We propose an algorithm for optimizing it efficiently, which leads to high-quality results in challenging settings.
  arXiv  Detail & Related papers  (2022-10-05T14:07:17Z)
• Quantifying the performance of approximate teleportation and quantum error correction via symmetric two-PPT-extendibility [5.192118773220603]
  In practice, the ideal realization of quantum teleportation relies on having access to a maximally entangled state. We present a method to quantify the performance of approximate teleportation when using an arbitrary resource state.
  arXiv  Detail & Related papers  (2022-07-14T13:53:50Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• A Quantum Optimal Control Problem with State Constrained Preserving Coherence [68.8204255655161]
  We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels. We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
  arXiv  Detail & Related papers  (2022-03-24T21:31:34Z)
• Reliable Simulation of Quantum Channels: the Error Exponent [5.8303977553652]
  We study the error exponent of quantum channel simulation, which characterizes the optimal speed of exponential convergence. We obtain an achievability bound for quantum channel simulation in the finite-blocklength setting.
  arXiv  Detail & Related papers  (2021-12-08T18:55:54Z)
• Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
  We propose that quantum circuits can be modeled as queuing networks. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
  arXiv  Detail & Related papers  (2021-06-26T10:55:52Z)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)
• Unraveling the origin of higher success probabilities in quantum versus semi-classical annealing [0.0]
  We study whether and when a full quantum representation of the dynamics leads to higher probability to end up in the desired ground. We find strong evidence for the importance of entanglement to end close to the optimal solution.
  arXiv  Detail & Related papers  (2020-10-27T12:52:09Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Recoverability for optimized quantum $f$-divergences [22.04181157631236]
  We show 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. Not only do these results lead to physically meaningful refinements of the data-processing inequality for the sandwiched R'enyi relative entropy, but they also have implications for perfect reversibility.
  arXiv  Detail & Related papers  (2020-08-04T15:56:12Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)
• Holevo Capacity of Discrete Weyl Channels [10.60025721557741]
  Holevo capacity is the maximum rate at which a quantum channel can reliably transmit classical information without entanglement. We consider discrete Weyl channels (DWCs) and exploit their symmetry properties to model DWC as a classical symmetric channel. We characterize lower and upper bounds on the Holevo capacity of DWCs using simple computational formulae.
  arXiv  Detail & Related papers  (2020-03-04T08:19:31Z)
• Preparation of ordered states in ultra-cold gases using Bayesian optimization [0.10499611180329804]
  We explore quantum optimal control framework based on Bayesian optimization. We show that Bayesian optimization is capable of finding better control solutions with regards to finite and noisy data.
  arXiv  Detail & Related papers  (2020-01-10T15:43:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.