Bayesian Quantum Amplitude Estimation

• URL: http://arxiv.org/abs/2412.04394v1
• Date: Thu, 05 Dec 2024 18:09:41 GMT
• Title: Bayesian Quantum Amplitude Estimation
• Authors: Alexandra Ramôa, Luis Paulo Santos,
• Abstract summary: We introduce BAE, a noise-aware Bayesian algorithm for quantum amplitude estimation. We show that BAE achieves Heisenberg-limited estimation and benchmark it against other approaches.
• Score: 49.1574468325115
• License:
• Abstract: Quantum amplitude estimation is a fundamental routine that offers a quadratic speed-up over classical approaches. The original QAE protocol is based on phase estimation. The associated circuit depth and width, and the assumptions of fault tolerance, are unfavorable for near-term quantum technology. Subsequent approaches attempt to replace the original protocol with hybrid iterative quantum-classical strategies. In this work, we introduce BAE, a noise-aware Bayesian algorithm for QAE that combines quantum circuits with a statistical inference backbone. BAE can dynamically characterize device noise and adapt to it in real-time. Problem-specific insights and approximations are used to keep the problem tractable. We further propose an annealed variant of BAE, drawing on methods from statistical inference, to enhance statistical robustness. Our proposal is parallelizable in both quantum and classical components, offers tools for fast noise model assessment, and can leverage preexisting information. Additionally, it accommodates experimental limitations and preferred cost trade-offs. We show that BAE achieves Heisenberg-limited estimation and benchmark it against other approaches, demonstrating its competitive performance in both noisy and noiseless scenarios.

Related papers

• Non-Markovian Noise Mitigation: Practical Implementation, Error Analysis, and the Role of Environment Spectral Properties [3.1003326924534482]
  We propose a non-Markovian Noise Mitigation(NMNM) method by extending the probabilistic error cancellation (PEC) method in the QEM framework to treat non-Markovian noise. We establish a direct connection between the overall approximation error and sampling overhead of QEM and the spectral property of the environment.
  arXiv  Detail & Related papers  (2025-01-09T07:22:06Z)
• Optimal Quantum Purity Amplification [2.05170973574812]
  Quantum purity amplification (QPA) offers a novel approach to counteract the pervasive noise that degrades quantum states. We present the optimal QPA protocol for general quantum systems against global depolarizing noise. Our findings suggest that QPA could improve the performance of quantum information processing tasks.
  arXiv  Detail & Related papers  (2024-09-26T17:46:00Z)
• 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)
• Superposed Quantum Error Mitigation [1.732837834702512]
  Overcoming the influence of noise and imperfections is a major challenge in quantum computing. We present an approach based on applying a desired unitary computation in superposition between the system of interest and some auxiliary states. We demonstrate, numerically and on the IBM Quantum Platform, that parallel applications of the same operation lead to significant noise mitigation.
  arXiv  Detail & Related papers  (2023-04-17T18:01:01Z)
• Self-protected quantum simulation and quantum phase estimation in the presence of classical noise [0.0]
  We propose self-protected quantum simulations immune to a large class of classical noise. For readout we generalize the conventional quantum phase estimation to its upgraded version in the presence of classical noise.
  arXiv  Detail & Related papers  (2022-12-07T14:30:47Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• 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)
• Policy Gradient based Quantum Approximate Optimization Algorithm [2.5614220901453333]
  We show that policy-gradient-based reinforcement learning algorithms are well suited for optimizing the variational parameters of QAOA in a noise-robust fashion. We analyze the performance of the algorithm for quantum state transfer problems in single- and multi-qubit systems.
  arXiv  Detail & Related papers  (2020-02-04T00:46:51Z)

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.