The National Academies Logo
Research Associateship Programs
Fellowships Office
Policy and Global Affairs

Participating Agencies - NIST

  Sign InPrintable View

Opportunity at National Institute of Standards and Technology (NIST)

Quantum Algorithms and Complexity

Location

Information Technology Laboratory, Applied and Computational Mathematics Division

RO# Location
50.77.11.B7891 Gaithersburg, MD

Please note: This Agency only participates in the February and August reviews.

Advisers

Name E-mail Phone
Jordan, Stephen Paul stephen.jordan@nist.gov 301.857.2481

Description

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.

 

Keywords:
Quantum; Algorithms; Complexity; Computing; Theory;

Eligibility

Citizenship:  Open to U.S. citizens
Level:  Open to Postdoctoral applicants
Copyright © 2014. National Academy of Sciences. All rights reserved. 500 Fifth St. N.W., Washington, D.C. 20001.
Terms of Use and Privacy Statement.