Realizing the Petz Recovery Map on an NMR Quantum Processor

• URL: http://arxiv.org/abs/2508.08998v1
• Date: Tue, 12 Aug 2025 15:07:20 GMT
• Title: Realizing the Petz Recovery Map on an NMR Quantum Processor
• Authors: Gayatri Singh, Ram Sagar Sahani, Vinayak Jagadish, Lea Lautenbacher, Nadja K. Bernardes, Kavita Dorai,
• Abstract summary: We experimentally implement the Petz recovery map on a nuclear magnetic resonance (NMR) quantum processor using the duality quantum computing (DQC) algorithm.<n>Our results validate the feasibility of the Petz-based recovery map in current quantum platforms and highlight its relevance for near-term error mitigation strategies.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The Petz recovery map is a fundamental protocol in quantum information theory, enabling the retrieval of quantum information lost due to noisy processes. Here, we experimentally implement the Petz recovery map on a nuclear magnetic resonance (NMR) quantum processor using the duality quantum computing (DQC) algorithm. Focusing on two paradigmatic single-qubit channels, namely phase damping and amplitude damping, we demonstrate that the recovered states closely match theoretical predictions. Our results validate the feasibility of the Petz-based recovery map in current quantum platforms and highlight its relevance for near-term error mitigation strategies.

Related papers

• Understanding and mitigating noise in molecular quantum linear response for spectroscopic properties on quantum computers [0.0]
  We present a study of quantum linear response theory obtaining spectroscopic properties on simulated fault-tolerant quantum computers. This work introduces novel metrics to analyze and predict the origins of noise in the quantum algorithm. We highlight the significant impact of Pauli saving in reducing measurement costs and noise.
  arXiv  Detail & Related papers  (2024-08-17T23:46:17Z)
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
  We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers. Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
  arXiv  Detail & Related papers  (2024-06-17T14:10:10Z)
• Equivalence Checking of Quantum Circuits by Model Counting [0.0]
  This paper gives a Turing reduction of the (universal) quantum circuits equivalence problem to weighted model counting (WMC) With an open-source implementation, we demonstrate that this novel approach can outperform a state-of-the-art equivalence-checking tool based on ZX calculus and decision diagrams.
  arXiv  Detail & Related papers  (2024-03-27T17:58:20Z)
• Mitigating Errors on Superconducting Quantum Processors through Fuzzy Clustering [38.02852247910155]
  A new Quantum Error Mitigation (QEM) technique uses Fuzzy C-Means clustering to specifically identify measurement error patterns. We report a proof-of-principle validation of the technique on a 2-qubit register, obtained as a subset of a real NISQ 5-qubit superconducting quantum processor. We demonstrate that the FCM-based QEM technique allows for reasonable improvement of the expectation values of single- and two-qubit gates based quantum circuits.
  arXiv  Detail & Related papers  (2024-02-02T14:02:45Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Resource-Efficient Quantum Circuits for Molecular Simulations: A Case Study of Umbrella Inversion in Ammonia [1.439738350540859]
  We develop a novel quantum circuit that reduces the required circuit depth and number of two-qubit entangling gates by about 60%. Even in the presence of device noise, these novel shallower circuits yielded substantially low error rates.
  arXiv  Detail & Related papers  (2023-12-07T11:30:09Z)
• Quantum Speedups in Regret Analysis of Infinite Horizon Average-Reward Markov Decision Processes [32.07657827173262]
  We introduce an innovative quantum framework for the agent's engagement with an unknown MDP.<n>We show that the quantum advantage in mean estimation leads to exponential advancements in regret guarantees for infinite horizon Reinforcement Learning.
  arXiv  Detail & Related papers  (2023-10-18T03:17:51Z)
• Quantum State Reconstruction in a Noisy Environment via Deep Learning [0.9012198585960443]
  We consider the tasks of reconstructing and classifying quantum states corrupted by an unknown noisy channel. We show how such an approach can be used to recover with fidelities exceeding 99%. We also consider the task of distinguishing between different quantum noisy channels, and show how a neural network-based classifier is able to solve such a classification problem with perfect accuracy.
  arXiv  Detail & Related papers  (2023-09-21T10:03:30Z)
• Experimental validation of the Kibble-Zurek Mechanism on a Digital Quantum Computer [62.997667081978825]
  The Kibble-Zurek mechanism captures the essential physics of nonequilibrium quantum phase transitions with symmetry breaking. We experimentally tested the KZM for the simplest quantum case, a single qubit under the Landau-Zener evolution. We report on extensive IBM-Q experiments on individual qubits embedded in different circuit environments and topologies.
  arXiv  Detail & Related papers  (2022-08-01T18:00:02Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Quantum algorithm for Petz recovery channels and pretty good measurements [9.537146822132904]
  The Petz recovery channel plays an important role in quantum information science as an operation that approximately reverses the effect of a quantum channel. We provide a quantum algorithm to implement the Petz recovery channel when given the ability to perform the channel that one wishes to reverse. 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  Detail & Related papers  (2020-06-30T15:51:59Z)

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.