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

Participating Agencies - ARL/USMA

  Sign InPrintable View

Opportunity at Davies Teaching Fellowships (ARL/USMA)

Mathematical Physics: Quantum Computing: Algorithms, Computational Complexity, Formal verification, and Annealing


MD and NM-Computational and Information Sciences-FFP, Computational and Information Sciences Directorate - FFP

RO# Location
AA.36.02.B8401 Adelphi, MD 207831197


Name E-mail Phone
Balu, Radhakrishnan 301.394.4302


In step with the steady advances in the development of technologies to realize quantum information processing attempts to describe computation using higher level languages, design of novel quantum algorithms, formal verification of the quantum processing, and quantum computational complexity studies are progressing in earnest. We use mathematical tools based on quantum probability, quantum logic, quantum groups (Hopf algebras), and differential geometry techniques to investigate challenging problems in quantum information processing. Opportunities exist to perform complexity analysis of quantum gates to realize a unitary operator, development of algorithms based on quantum annealing paradigm, and construction of topological invariants based on Hopf algebras.


Quantum computation; Quantum information; Quantum algorithms; Quantum computational complexity; Information sciences; Quantum; information; Computation; Algorithms;


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.