An adaptive Bayesian quantum algorithm for phase estimation

• URL: http://arxiv.org/abs/2303.01517v1
• Date: Thu, 2 Mar 2023 19:00:01 GMT
• Title: An adaptive Bayesian quantum algorithm for phase estimation
• Authors: Joseph G. Smith, Crispin H. W. Barnes, David R. M. Arvidsson-Shukur
• Abstract summary: We present a coherence-based phase-estimation algorithm which can achieve the optimal quadratic scaling in the mean absolute error and the mean squared error. In the presence of noise, our algorithm produces errors that approach the theoretical lower bound.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum-phase-estimation algorithms are critical subroutines in many applications for quantum computers and in quantum-metrology protocols. These algorithms estimate the unknown strength of a unitary evolution. By using coherence or entanglement to sample the unitary $N_{\mathrm{tot}}$ times, the variance of the estimates can scale as $O(1/{N^2_{\mathrm{tot}}})$, compared to the best ``classical'' strategy with $O(1/{N_{\mathrm{tot}}})$. The original algorithm for quantum phase estimation cannot be implemented on near-term hardware as it requires large-scale entangled probes and fault-tolerant quantum computing. Therefore, alternative algorithms have been introduced that rely on coherence and statistical inference. These algorithms produce quantum-boosted phase estimates without inter-probe entanglement. This family of phase-estimation algorithms have, until now, never exhibited the possibility of achieving optimal scaling $O(1/{N^2_{\mathrm{tot}}})$. Moreover, previous works have not considered the effect of noise on these algorithms. Here, we present a coherence-based phase-estimation algorithm which can achieve the optimal quadratic scaling in the mean absolute error and the mean squared error. In the presence of noise, our algorithm produces errors that approach the theoretical lower bound. The optimality of our algorithm stems from its adaptive nature: Each step is determined, iteratively, using a Bayesian protocol that analyses the results of previous steps.

Related papers

• Optimal Coherent Quantum Phase Estimation via Tapering [0.0]
  Quantum phase estimation is one of the fundamental primitives that underpins many quantum algorithms. We propose an improved version of the standard algorithm called the tapered quantum phase estimation algorithm. Our algorithm achieves the optimal query complexity without requiring the expensive coherent median technique.
  arXiv  Detail & Related papers  (2024-03-27T18:17:23Z)
• On adaptive low-depth quantum algorithms for robust multiple-phase estimation [11.678822620192438]
  We present robust multiple-phase estimation (RMPE) algorithms with Heisenberg-limited scaling. These algorithms are particularly suitable for early fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2023-03-14T17:38:01Z)
• On proving the robustness of algorithms for early fault-tolerant quantum computers [0.0]
  We introduce a randomized algorithm for the task of phase estimation and give an analysis of its performance under two simple noise models. We calculate that the randomized algorithm can succeed with arbitrarily high probability as long as the required circuit depth is less than 0.916 times the dephasing scale.
  arXiv  Detail & Related papers  (2022-09-22T21:28:12Z)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• Twisted hybrid algorithms for combinatorial optimization [68.8204255655161]
  Proposed hybrid algorithms encode a cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. We show that for levels $p=2,ldots, 6$, the level $p$ can be reduced by one while roughly maintaining the expected approximation ratio.
  arXiv  Detail & Related papers  (2022-03-01T19:47:16Z)
• Optimization and Noise Analysis of the Quantum Algorithm for Solving One-Dimensional Poisson Equation [17.65730040410185]
  We propose an efficient quantum algorithm for solving one-dimensional Poisson equation. We further develop this algorithm to make it closer to the real application on the noisy intermediate-scale quantum (NISQ) devices. We analyze the effect of common noise existing in the real quantum devices on our algorithm using the IBM Qiskit toolkit.
  arXiv  Detail & Related papers  (2021-08-27T09:44:41Z)
• Provably Faster Algorithms for Bilevel Optimization [54.83583213812667]
  Bilevel optimization has been widely applied in many important machine learning applications. We propose two new algorithms for bilevel optimization. We show that both algorithms achieve the complexity of $mathcalO(epsilon-1.5)$, which outperforms all existing algorithms by the order of magnitude.
  arXiv  Detail & Related papers  (2021-06-08T21:05:30Z)
• Quantum Algorithms for Prediction Based on Ridge Regression [0.7612218105739107]
  We propose a quantum algorithm based on ridge regression model, which get the optimal fitting parameters. The proposed algorithm has a wide range of application and the proposed algorithm can be used as a subroutine of other quantum algorithms.
  arXiv  Detail & Related papers  (2021-04-27T11:03:52Z)
• Distributed Stochastic Consensus Optimization with Momentum for Nonconvex Nonsmooth Problems [45.88640334610308]
  This paper presents a new distributed optimization algorithm for non-smooth problems. We show that the proposed algorithm can achieve an overcal communication. Experiments are presented to illustrate the effectiveness of the proposed algorithms.
  arXiv  Detail & Related papers  (2020-11-10T13:12:21Z)
• Single-Timescale Stochastic Nonconvex-Concave Optimization for Smooth Nonlinear TD Learning [145.54544979467872]
  We propose two single-timescale single-loop algorithms that require only one data point each step. Our results are expressed in a form of simultaneous primal and dual side convergence.
  arXiv  Detail & Related papers  (2020-08-23T20:36:49Z)
• Active Model Estimation in Markov Decision Processes [108.46146218973189]
  We study the problem of efficient exploration in order to learn an accurate model of an environment, modeled as a Markov decision process (MDP) We show that our Markov-based algorithm outperforms both our original algorithm and the maximum entropy algorithm in the small sample regime.
  arXiv  Detail & Related papers  (2020-03-06T16:17:24Z)

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.