Quantum algorithm for Petz recovery channels and pretty good measurements

• URL: http://arxiv.org/abs/2006.16924v2
• Date: Wed, 1 Jun 2022 23:18:19 GMT
• Title: Quantum algorithm for Petz recovery channels and pretty good measurements
• Authors: Andr\'as Gily\'en, Seth Lloyd, Iman Marvian, Yihui Quek, Mark M. Wilde
• Abstract summary: 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.
• Score: 9.537146822132904
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 paper 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.

Related papers

• Quantum-Channel Matrix Optimization for Holevo Bound Enhancement [87.57725685513088]
  We propose a unified projected gradient ascent algorithm to optimize the quantum channel given a fixed input ensemble.<n> Simulation results demonstrate that the proposed quantum channel optimization yields higher Holevo bounds than input ensemble optimization.
  arXiv  Detail & Related papers  (2026-02-19T04:15:03Z)
• Memory effects in repeated uses of quantum channels [0.0]
  Quantum Information Processing tasks can be efficiently formulated in terms of quantum dynamical maps.<n>A key QIP task is quantum state transfer (QST) aimed at sharing quantum information between distant nodes of a quantum network.<n>We show that even relatively small readout timing errors give rise to memory effects which have a highly detrimental impact on subsequent QST tasks.
  arXiv  Detail & Related papers  (2025-11-07T19:00:14Z)
• Weakly-Driven Quantum Walks for Memory-Constrained Pauli Channel Learning [8.505960463791139]
  We introduce a mechanism termed the weakly-driven quantum walk'' to mitigate the demand for high-quality quantum memory.<n>Our algorithm lowers the quantum memory overhead to a constant order while preserving the exponential advantage in measurement complexity.
  arXiv  Detail & Related papers  (2025-09-09T13:09:48Z)
• Mid-circuit measurement as an algorithmic primitive [0.39321523855648755]
  We assess how quantum phase estimation (QPE) and mid-circuit measurements can improve the performance of variational quantum algorithms.<n>We demonstrate that a mid-circuit measurement acts as a low-energy filter when the desired outcome is obtained.
  arXiv  Detail & Related papers  (2025-05-30T18:00:03Z)
• Implementation and readout of maximally entangled two-qubit gates quantum circuits in a superconducting quantum processor [32.40607221598716]
  In a transmon-based 5-qubit superconducting quantum processor, we compared the performance of quantum circuits involving an increasing level of complexity. Here we report the results obtained from the analysis of the outputs of quantum circuits using two readout paradigms. The first method is suitable for single-qubit circuits, while the second is essential for accurately interpreting the outputs of circuits involving two-qubit gates.
  arXiv  Detail & Related papers  (2025-03-31T16:20:56Z)
• Realization of Constant-Depth Fan-Out with Real-Time Feedforward on a Superconducting Quantum Processor [33.096693427147535]
  We demonstrate a quantum fan-out gate with real-time feedforward on up to four output qubits using a superconducting quantum processor. Our work highlights the potential of mid-circuit measurements combined with real-time conditional operations to improve the efficiency of complex quantum algorithms.
  arXiv  Detail & Related papers  (2024-09-11T03:40:24Z)
• QAdaPrune: Adaptive Parameter Pruning For Training Variational Quantum Circuits [2.3332157823623403]
  emphQAdaPrune is an adaptive parameter pruning algorithm that automatically determines the threshold and then intelligently prunes the redundant and non-performing parameters. We show that the resulting sparse parameter sets yield quantum circuits that perform comparably to the unpruned quantum circuits.
  arXiv  Detail & Related papers  (2024-08-23T19:57:40Z)
• Entanglement-enhanced learning of quantum processes at scale [2.2278634757583875]
  We show that entanglement with auxiliary noisy quantum memory combined with error mitigation considerably enhances the learning of quantum processes. Our study demonstrates that entanglement with auxiliary noisy quantum memory combined with error mitigation considerably enhances the learning of quantum processes.
  arXiv  Detail & Related papers  (2024-08-06T18:00:20Z)
• Quantum quench dynamics as a shortcut to adiabaticity [31.114245664719455]
  We develop and test a quantum algorithm in which the incorporation of a quench step serves as a remedy to the diverging adiabatic timescale. Our experiments show that this approach significantly outperforms the adiabatic algorithm.
  arXiv  Detail & Related papers  (2024-05-31T17:07:43Z)
• 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)
• 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)
• Efficient Computation of the Quantum Rate-Distortion Function [6.281229317487581]
  We show how symmetry reduction can significantly simplify common instances of the entanglement-assisted quantum rate-distortion problems. We propose an inexact variant of the mirror descent algorithm to compute the quantum rate-distortion function with provable sublinear convergence rates.
  arXiv  Detail & Related papers  (2023-09-28T00:46:53Z)
• Quantivine: A Visualization Approach for Large-scale Quantum Circuit Representation and Analysis [31.203764035373677]
  We develop Quantivine, an interactive system for exploring and understanding quantum circuits. A series of novel circuit visualizations are designed to uncover contextual details such as qubit provenance, parallelism, and entanglement. The effectiveness of Quantivine is demonstrated through two usage scenarios of quantum circuits with up to 100 qubits.
  arXiv  Detail & Related papers  (2023-07-18T04:51:28Z)
• Quantum gradient evaluation through quantum non-demolition measurements [0.0]
  We discuss a Quantum Non-Demolition Measurement protocol to estimate the derivatives of a cost function with a quantum computer. This is a key step for the implementation of variational quantum circuits.
  arXiv  Detail & Related papers  (2023-01-17T19:00:08Z)
• Adaptive channel estimation for mitigating circuits executed on noisy quantum devices [0.40611352512781856]
  Current quantum computing devices typically exhibit error rates of 1e-2 or greater. In this study, we investigate if one can infer the critical channel parameters dynamically from the noisy binary output of the executed quantum circuit. Our metric of performance is the Hellinger distance between the post-stabilization observations and the reference (ideal)
  arXiv  Detail & Related papers  (2022-08-18T18:19:18Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.