Amplitude Estimation from Quantum Signal Processing

• URL: http://arxiv.org/abs/2207.08628v2
• Date: Thu, 1 Sep 2022 19:32:47 GMT
• Title: Amplitude Estimation from Quantum Signal Processing
• Authors: Patrick Rall and Bryce Fuller
• Abstract summary: Amplitude estimation algorithms are based on Grover's algorithm: alternating reflections about the input state and the desired outcome. We find that quantum signal processing lets us estimate the amplitude in a more flexible way.
• Score: 0.30458514384586405
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Amplitude estimation algorithms are based on Grover's algorithm: alternating reflections about the input state and the desired outcome. But what if we are given the ability to perform arbitrary rotations, instead of just reflections? In this situation, we find that quantum signal processing lets us estimate the amplitude in a more flexible way. We leverage this technique to give improved and simplified algorithms for many amplitude estimation tasks: we perform non-destructive estimation without any assumptions on the amplitude, develop an algorithm with improved performance in practice, present a new method for unbiased amplitude estimation, and finally give a simpler method for trading quantum circuit depth for more repetitions of short circuits.

Related papers

• Low depth amplitude estimation without really trying [1.1005025875011782]
  Quantum amplitude estimation algorithms provide quadratic speedup to Monte-Carlo simulations. They require a circuit depth that scales as inverse of the estimation error. We bypass this limitation by performing the classical Monte-Carlo method on the quantum algorithm itself.
  arXiv  Detail & Related papers  (2024-10-02T01:59:33Z)
• A Sample Efficient Alternating Minimization-based Algorithm For Robust Phase Retrieval [56.67706781191521]
  In this work, we present a robust phase retrieval problem where the task is to recover an unknown signal. Our proposed oracle avoids the need for computationally spectral descent, using a simple gradient step and outliers.
  arXiv  Detail & Related papers  (2024-09-07T06:37:23Z)
• Bregman-divergence-based Arimoto-Blahut algorithm [53.64687146666141]
  We generalize the Arimoto-Blahut algorithm to a general function defined over Bregman-divergence system. We propose a convex-optimization-free algorithm that can be applied to classical and quantum rate-distortion theory.
  arXiv  Detail & Related papers  (2024-08-10T06:16:24Z)
• Quantum amplitude estimation from classical signal processing [0.0]
  We show that the problem of amplitude estimation can be mapped directly to a problem in signal processing called direction of arrival estimation. We create a phase-estimation free, parallel quantum amplitude estimation (QAE) algorithm with a total query complexity of $sim 4.9/varepsilon$ and a parallel query complexity of $sim 0.40/varepsilon$ at 95% confidence.
  arXiv  Detail & Related papers  (2024-05-23T15:31:46Z)
• Optimal Algorithms for the Inhomogeneous Spiked Wigner Model [89.1371983413931]
  We derive an approximate message-passing algorithm (AMP) for the inhomogeneous problem. We identify in particular the existence of a statistical-to-computational gap where known algorithms require a signal-to-noise ratio bigger than the information-theoretic threshold to perform better than random.
  arXiv  Detail & Related papers  (2023-02-13T19:57:17Z)
• Few Quantum Algorithms on Amplitude Distribution [0.5584060970507505]
  Amplitude filtering is concerned with identifying basis-states in a superposition whose amplitudes are greater than a specified threshold. Given the scarcity of qubits, the focus of this work is to design log-space algorithms for them.
  arXiv  Detail & Related papers  (2022-07-30T08:11:29Z)
• Low depth amplitude estimation on a trapped ion quantum computer [5.443245599372994]
  Amplitude estimation is a fundamental quantum algorithmic primitive that enables quantum computers to achieve quadratic speedups. Recent works have succeeded in somewhat reducing the necessary resources for such algorithms, by trading off some of the speedup for lower depth circuits. We report the results of an experimental demonstration of amplitude estimation on a state-of-the-art trapped ion quantum computer.
  arXiv  Detail & Related papers  (2021-09-20T16:57:19Z)
• Grover search revisited; application to image pattern matching [0.8367938108534343]
  We propose a quantum algorithm that approximately executes the entire Grover database search or pattern matching algorithm. The key idea is to use the recently proposed approximate amplitude encoding method on a shallow quantum circuit.
  arXiv  Detail & Related papers  (2021-08-24T17:30:41Z)
• Learned Block Iterative Shrinkage Thresholding Algorithm for Photothermal Super Resolution Imaging [52.42007686600479]
  We propose a learned block-sparse optimization approach using an iterative algorithm unfolded into a deep neural network. We show the benefits of using a learned block iterative shrinkage thresholding algorithm that is able to learn the choice of regularization parameters.
  arXiv  Detail & Related papers  (2020-12-07T09:27:16Z)
• Activation Relaxation: A Local Dynamical Approximation to Backpropagation in the Brain [62.997667081978825]
  Activation Relaxation (AR) is motivated by constructing the backpropagation gradient as the equilibrium point of a dynamical system. Our algorithm converges rapidly and robustly to the correct backpropagation gradients, requires only a single type of computational unit, and can operate on arbitrary computation graphs.
  arXiv  Detail & Related papers  (2020-09-11T11:56:34Z)
• Nearly Linear Row Sampling Algorithm for Quantile Regression [54.75919082407094]
  We give a row sampling algorithm for the quantile loss function with sample complexity nearly linear in the dimensionality of the data. Based upon our row sampling algorithm, we give the fastest known algorithm for quantile regression and a graph sparsification algorithm for balanced directed graphs.
  arXiv  Detail & Related papers  (2020-06-15T13:40:07Z)

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.