Demonstration of the Rodeo Algorithm on a Quantum Computer

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.

13 pages and 4 figures (main), 2 pages (supplemental), final version to appear in Eur. Phys. J. A

References in corpus (31)

• A variational eigenvalue solver on a quantum processor
• A Theory of Trotter Error
• Non-Empirical Interactions for the Nuclear Shell Model: An Update
• Ab initio limits of atomic nuclei
• Ab Initio Treatment of Collective Correlations and the Neutrinoless Double Beta Decay of ${}^{48}$Ca
• Accurate bulk properties of nuclei from $A=2$ to $\infty$ from potentials with $\Delta$ isobars
• Light-nuclei spectra from chiral dynamics
• Quantum Krylov subspace algorithms for ground and excited state energy estimation
• Physics of nuclei: Key role of an emergent symmetry
• Linear Response on a Quantum Computer
• Auxiliary field diffusion Monte Carlo calculations of light and medium-mass nuclei with local chiral interactions
• Rodeo Algorithm for Quantum Computing
• Bogoliubov Many-Body Perturbation Theory for Open-Shell Nuclei
• Ab initio optical potentials and nucleon scattering on medium mass nuclei
• Ab initio predictions for polarized DT thermonuclear fusion
• Improved Error-Scaling for Adiabatic Quantum State Transfer
• Emergent geometry and duality in the carbon nucleus
• Preparation of excited states for nuclear dynamics on a quantum computer
• Wavefunction matching for solving quantum many-body problems
• Ab initio computation of the longitudinal response function in ${}^{40}$Ca
• Efficient quantum computation of molecular forces and other energy gradients
• Shell-model coupled-cluster method for open-shell nuclei
• Spectral density estimation with the Gaussian Integral Transform
• Alpha clustering and alpha-capture reaction rate from ab initio symmetry-adapted description of ${}^{20}$Ne
• Self-consistent Green's function approaches
• Hypernuclear No-Core Shell Model
• Effective interactions in the sd shell
• Machine learning-based inversion of nuclear responses
• Spectral density reconstruction with Chebyshev polynomials
• Clustering of Four-Component Unitary Fermions
• Quantum techniques for eigenvalue problems

Cited by in corpus (5)

• Accessing ground state and excited states energies in many-body system after symmetry restoration using quantum computers
• Preparing low-variance states using a distributed quantum algorithm
• Controlled Gate Networks: Theory and Application to Eigenvalue Estimation
• Hierarchical Fusion Method for Scalable Quantum Eigenstate Preparation
• Unraveling Rodeo Algorithm Through the Zeeman Model