Rodeo Algorithm for Quantum Computing
Kenneth Choi, Dean Lee, Joey Bonitati, Zhengrong Qian, Jacob Watkins

TL;DR
The paper introduces the rodeo algorithm, a stochastic quantum computing method that efficiently prepares eigenvectors and computes the spectrum of a Hamiltonian, with exponential speed advantages over traditional methods.
Contribution
The paper presents the rodeo algorithm, a novel stochastic quantum algorithm for eigenvector preparation and spectrum computation with improved scaling and efficiency.
Findings
Scales as O[|log δ|/(p ε)] for eigenvector preparation.
Computational effort for spectrum determination scales as O[(log ε)^2/(p ε)].
Exponential speedup over phase estimation and adiabatic methods.
Abstract
We present a stochastic quantum computing algorithm that can prepare any eigenvector of a quantum Hamiltonian within a selected energy interval . In order to reduce the spectral weight of all other eigenvectors by a suppression factor , the required computational effort scales as , where 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 . 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 . In this manner, we converge to the target eigenvector with exponential accuracy in the number of measurements. In addition to preparing eigenvectors,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
