Rodeo Algorithm for Quantum Computing

Abstract

We present a stochastic quantum computing algorithm that can prepare any eigenvector of a quantum Hamiltonian within a selected energy interval $[E-\epsilon ,E+\epsilon ]$. In order to reduce the spectral weight of all other eigenvectors by a suppression factor $\delta$, the required computational effort scales as $O[|\log \delta |/(p\epsilon )]$, where $p$ is the squared overlap of the initial state with the target eigenvector. The method, which we call the rodeo algorithm, uses auxiliary qubits to control the time evolution of the Hamiltonian minus some tunable parameter $E$. With each auxiliary qubit measurement, the amplitudes of the eigenvectors are multiplied by a stochastic factor that depends on the proximity of their energy to $E$. In this manner, we converge to the target eigenvector with exponential accuracy in the number of measurements. In addition to preparing eigenvectors, the method can also compute the full spectrum of the Hamiltonian. We illustrate the performance with several examples. For energy eigenvalue determination with error $\epsilon$, the computational scaling is $O[(\log \epsilon {)}^2/(p\epsilon )]$. For eigenstate preparation, the computational scaling is $O(\log \Delta /p)$, where $\Delta$ is the magnitude of the orthogonal component of the residual vector. The speed for eigenstate preparation is exponentially faster than that for phase estimation or adiabatic evolution.

Added new material on algorithmic performance and preconditioning. 5 pages and 6 figures (main text), 2 pages and 3 figures (supplemental materials)

References in corpus (3)

• Algorithms for quantum simulation at finite energies
• Spectral density estimation with the Gaussian Integral Transform
• Projective Cooling for the transverse Ising model

Cited by in corpus (42)

• Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
• Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
• Quantum Simulating Nature's Fundamental Fields
• Variational approaches to constructing the many-body nuclear ground state for quantum computing
• Accessing ground state and excited states energies in many-body system after symmetry restoration using quantum computers
• Multi-Body Entanglement and Information Rearrangement in Nuclear Many-Body Systems
• Projection algorithm for state preparation on quantum computers
• Filtering states with total spin on a quantum computer
• Spectral density reconstruction with Chebyshev polynomials
• Quantum state preparation by adiabatic evolution with customized gates
• Nearly-optimal state preparation for quantum simulations of lattice gauge theories
• Nuclear scattering via quantum computing
• Nearly optimal quantum algorithm for generating the ground state of a free quantum field theory
• Optimal scheduling in probabilistic imaginary-time evolution on a quantum computer
• A quantum-classical co-processing protocol towards simulating nuclear reactions on contemporary quantum hardware
• Efficient Quantum Simulation of QCD Jets on the Light Front
• Scattering phase shifts from a quantum computer
• Demonstration of the Rodeo Algorithm on a Quantum Computer
• Multi-nucleon structure and dynamics via quantum computing
• Partonic distribution functions and amplitudes using tensor network methods
• Solving reaction dynamics with quantum computing algorithms
• Coupled-cluster theory for strong entanglement in nuclei
• Deep Quantum Circuit Simulations of Low-Energy Nuclear States
• Trimmed Sampling Algorithm for the Noisy Generalized Eigenvalue Problem
• Boltzmann Distributions on a Quantum Computer via Active Cooling
• First-quantized adiabatic time evolution for the ground state of a many-electron system and the optimal nuclear configuration
• Quantum techniques for eigenvalue problems
• Neutron-nucleus dynamics simulations for quantum computers
• Encoded probabilistic imaginary-time evolution on a trapped-ion quantum computer for ground and excited states of spin qubits
• Semicoherent Symmetric Quantum Processes: Theory and Applications
• Full-counting statistics of particle distribution on a digital quantum computer
• Identification of a natural fieldlike entanglement resource in trapped-ion chains
• Simplified projection on total spin zero for state preparation on quantum computers
• Toward scalable quantum computations of atomic nuclei
• Estimating the Number of States via the Rodeo Algorithm for Quantum Computation
• Controlled Gate Networks: Theory and Application to Eigenvalue Estimation
• Preparing low-variance states using a distributed quantum algorithm
• A low-circuit-depth quantum computing approach to the nuclear shell model
• Unraveling Rodeo Algorithm Through the Zeeman Model
• Quantum State Preparation with Resolution Refinement
• Hierarchical Fusion Method for Scalable Quantum Eigenstate Preparation
• Quantum Compressive Sensing: Mathematical Machinery, Quantum Algorithms, and Quantum Circuitry