Skip to content
March 31, 20234:00 pm – 5:00 pm (CDT)

Adiabatic Oracle for quantum algorithms.


Nikolai Sinitsyn (LANL)


V. Pokrovsky



Mitchell Institute for Fundamental Physics & Astronomy

College Station, Texas 77843

Event Details

Quantum algorithms, such as by Shor and Grover, rely on the concept of an oracle, which is a quantum function that can be called by a computer in one computation step. In real applications this function is not given for free. It must be generated as a quantum dynamic process. It may be harder to realize than to solve the original problem. I will argue that a physical solution for the fast oracle implementation for many famous NP-complete problems is possible. Moreover, this may be easier to implement in practice than the universal quantum computing. References [1] Bin Yan, and N. A. Sinitsyn. Adiabatic oracle for Grover algorithm. arXiv:2207.05665 [2] Bin Yan, and N. A. Sinitsyn. Analytical solution for nonadiabatic quantum annealing to arbitrary Ising spin Hamiltonian. Nature Comm. 13 (1): 2212 (2022)

Copyright © 2023. All rights reserved, Texas A&M University Trademark | Texas A&M University, College Station, Texas 77843