Demonstration of the Rodeo Algorithm on a Quantum Computer

• URL: http://arxiv.org/abs/2110.07747v2
• Date: Tue, 2 Jul 2024 00:32:21 GMT
• Title: Demonstration of the Rodeo Algorithm on a Quantum Computer
• Authors: Zhengrong Qian, Jacob Watkins, Gabriel Given, Joey Bonitati, Kenneth Choi, Dean Lee,
• Abstract summary: Rodeo algorithm is an efficient algorithm for eigenstate preparation and eigenvalue estimation for any observable on a quantum computer. It is exponentially faster than well-known algorithms such as phase estimation and adiabatic evolution for eigenstate preparation. It has yet to be implemented on an actual quantum device.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The rodeo algorithm is an efficient algorithm for eigenstate preparation and eigenvalue estimation for any observable on a quantum computer. This makes it a promising tool for studying the spectrum and structure of atomic nuclei as well as other fields of quantum many-body physics. The only requirement is that the initial state has sufficient overlap probability with the desired eigenstate. While it is exponentially faster than well-known algorithms such as phase estimation and adiabatic evolution for eigenstate preparation, it has yet to be implemented on an actual quantum device. In this work, we apply the rodeo algorithm to determine the energy levels of a random one-qubit Hamiltonian, resulting in a relative error of $0.08\%$ using mid-circuit measurements on the IBM Q device Casablanca. This surpasses the accuracy of directly-prepared eigenvector expectation values using the same quantum device. We take advantage of the high-accuracy energy determination and use the Hellmann-Feynman theorem to compute eigenvector expectation values for a different random one-qubit observable. For the Hellmann-Feynman calculations, we find a relative error of $0.7\%$. We conclude by discussing possible future applications of the rodeo algorithm for multi-qubit Hamiltonians.

Related papers

• A quantum implementation of high-order power method for estimating geometric entanglement of pure states [39.58317527488534]
  This work presents a quantum adaptation of the iterative higher-order power method for estimating the geometric measure of entanglement of multi-qubit pure states. It is executable on current (hybrid) quantum hardware and does not depend on quantum memory. We study the effect of noise on the algorithm using a simple theoretical model based on the standard depolarising channel.
  arXiv  Detail & Related papers  (2024-05-29T14:40:24Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• 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)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Predicting Gibbs-State Expectation Values with Pure Thermal Shadows [1.4050836886292868]
  We propose a quantum algorithm that can predict $M$ linear functions of an arbitrary Gibbs state with only $mathcalO(logM)$ experimental measurements. We show that the algorithm can be successfully employed as a subroutine for training an eight-qubit fully connected quantum Boltzmann machine.
  arXiv  Detail & Related papers  (2022-06-10T18:00:08Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Mitigating algorithmic errors in quantum optimization through energy extrapolation [4.426846282723645]
  We present a scalable extrapolation approach to mitigating a non-negligible error in estimates of the ground state energy. We have verified the validity of these approaches through both numerical simulation and experiments on an IBM quantum computer.
  arXiv  Detail & Related papers  (2021-09-16T17:39:11Z)
• Double sparse quantum state preparation [1.7338677787507775]
  We propose a quantum state preparation algorithm called CVO-QRAM with computational cost O(kM) The proposed algorithm can be an alternative to create sparse states in future NISQ devices.
  arXiv  Detail & Related papers  (2021-08-30T21:32:26Z)
• Algorithms for quantum simulation at finite energies [0.7734726150561088]
  We introduce two kinds of quantum algorithms to explore microcanonical and canonical properties of many-body systems. One is a hybrid quantum algorithm that computes expectation values in a finite energy interval around its mean energy. The other is a quantum-assisted Monte Carlo sampling method to compute other quantities.
  arXiv  Detail & Related papers  (2020-06-04T17:40:29Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.