A differentiable quantum phase estimation algorithm

• URL: http://arxiv.org/abs/2406.14113v1
• Date: Thu, 20 Jun 2024 08:55:01 GMT
• Title: A differentiable quantum phase estimation algorithm
• Authors: Davide Castaldo, Soran Jahangiri, Agostino Migliore, Juan Miguel Arrazola, Stefano Corni,
• Abstract summary: We develop a strategy to integrate the quantum phase estimation algorithm within a fully differentiable framework. This is accomplished by devising a smooth estimator able to tackle arbitrary initial states. This work paves the way for new quantum algorithms that combine interference methods and quantum differentiable programming.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The simulation of electronic properties is a pivotal issue in modern electronic structure theory, driving significant efforts over the past decades to develop protocols for computing energy derivatives. In this work, we address this problem by developing a strategy to integrate the quantum phase estimation algorithm within a fully differentiable framework. This is accomplished by devising a smooth estimator able to tackle arbitrary initial states. We provide analytical expressions to characterize the statistics and algorithmic cost of this estimator. Furthermore, we provide numerical evidence that the estimation accuracy is retained when an arbitrary state is considered and that it exceeds the one of standard majority rule. We explicitly use this procedure to estimate chemically relevant quantities, demonstrating our approach through ground-state and triplet excited state geometry optimization with simulations involving up to 19 qubits. This work paves the way for new quantum algorithms that combine interference methods and quantum differentiable programming.

Related papers

• Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
  We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra. A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
  arXiv  Detail & Related papers  (2022-09-28T20:24:53Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• 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)
• Digital quantum simulation of strong correlation effects with iterative quantum phase estimation over the variational quantum eigensolver algorithm: $\mathrm{H_4}$ on a circle as a case study [0.0]
  We generate the initial state by using the classical-quantum hybrid variational quantum eigensolver algorithm with unitary coupled cluster ansatz. We demonstrate that a carefully and appropriately prepared initial state can greatly reduce the effects of noise due to sampling in the estimation of the desired eigenphase.
  arXiv  Detail & Related papers  (2021-10-06T15:48:53Z)
• Estimating distinguishability measures on quantum computers [4.779196219827506]
  We propose and review several algorithms for estimating distinguishability measures based on trace distance and fidelity. The fidelity-based algorithms offer novel physical interpretations of these distinguishability measures. We find that the simulations converge well in both the noiseless and noisy scenarios.
  arXiv  Detail & Related papers  (2021-08-18T22:32:31Z)
• 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)
• Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron Correlation [58.720142291102135]
  We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer. We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
  arXiv  Detail & Related papers  (2021-06-22T18:00:00Z)
• Efficient qubit phase estimation using adaptive measurements [0.0]
  Estimating the quantum phase of a physical system is a central problem in quantum parameter estimation theory. Current methods to estimate quantum phases fail to reach the quantum Cram'er-Rao bound. We propose a new adaptive scheme based on covariant measurements to circumvent this problem.
  arXiv  Detail & Related papers  (2020-12-21T02:43:47Z)
• A Dynamical Systems Approach for Convergence of the Bayesian EM Algorithm [59.99439951055238]
  We show how (discrete-time) Lyapunov stability theory can serve as a powerful tool to aid, or even lead, in the analysis (and potential design) of optimization algorithms that are not necessarily gradient-based. The particular ML problem that this paper focuses on is that of parameter estimation in an incomplete-data Bayesian framework via the popular optimization algorithm known as maximum a posteriori expectation-maximization (MAP-EM) We show that fast convergence (linear or quadratic) is achieved, which could have been difficult to unveil without our adopted S&C approach.
  arXiv  Detail & Related papers  (2020-06-23T01:34:18Z)
• Measuring Analytic Gradients of General Quantum Evolution with the Stochastic Parameter Shift Rule [0.0]
  We study the problem of estimating the gradient of the function to be optimized directly from quantum measurements. We derive a mathematically exact formula that provides an algorithm for estimating the gradient of any multi-qubit parametric quantum evolution. Our algorithm continues to work, although with some approximations, even when all the available quantum gates are noisy.
  arXiv  Detail & Related papers  (2020-05-20T18:24:11Z)
• Approximating the quantum approximate optimization algorithm with digital-analog interactions [0.0]
  We show that the digital-analog paradigm is suited to the variational quantum approximate optimisation algorithm. We observe regimes of single-qubit operation speed in which the considered variational algorithm provides a significant improvement over non-variational counterparts.
  arXiv  Detail & Related papers  (2020-02-27T16:01:40Z)

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.