• Corpus ID: 239009836

Demonstration of the Rodeo Algorithm on a Quantum Computer

@inproceedings{Qian2021DemonstrationOT,
  title={Demonstration of the Rodeo Algorithm on a Quantum Computer},
  author={Zhengrong Qian and Jacob Watkins and Gabriel Given and Joey Bonitati and Kenneth Choi and Dean Lee},
  year={2021}
}
The rodeo algorithm is an efficient algorithm for eigenstate preparation and eigenvalue estimation for any observable on a quantum computer. 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… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 17 REFERENCES
Quantum Computation by Adiabatic Evolution
We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that
Phys
  • Rev. Lett. 127, 040505
  • 2021
Phys
  • Rev. X 11, 011020
  • 2021
arXiv e-prints
  • arXiv:2109.06868
  • 2021
Phys
  • Rev. A 102, 022409
  • 2020
Phys
  • Rev. C 102, 064624
  • 2020
Quant
  • Inf. Comp. 14, 306
  • 2013
I and J
New Journal of Physics 14
  • 013024
  • 2012
and M
  • Sipser, “Quantum computation by adiabatic evolution,”
  • 2000
...
1
2
...