Opportunity at National Institute of Standards and Technology (NIST)
Quantum Algorithms and Complexity
Information Technology Laboratory, Applied and Computational Mathematics Division
Please note: This Agency only participates in the February and August reviews.
|Jordan, Stephen Paul
Quantum computers promise to solve certain computational problems faster than is possible using conventional classical algorithms. Although large-scale quantum computers do not yet exist, it is possible to mathematically analyze the computational power that quantum computers will have, if built. One branch of such analysis is the construction of quantum algorithms for specific computational problems. A second branch of such analysis uses the tools of computational complexity theory, which classify computational problems into complexity classes. We are involved in the design and analysis of quantum algorithms and in proving theorems about quantum complexity classes. We are particularly interested in quantum algorithms for simulating physical systems; alternative models of quantum computation, such as the adiabatic model; and quantum algorithms applied to cryptanalysis.
Quantum; Algorithms; Complexity; Computing; Theory;
Open to U.S. citizens
Open to Postdoctoral applicants