Opportunity at U.S. Army Research Laboratory (ARL)
Mathematical Physics: Quantum Computing: Algorithms, Computational Complexity, Formal verification, and Annealing
Location
MD and NM-Computational and Information Sciences, Computational and Information Sciences Directorate
| RO# |
Location |
|
| 76.36.02.B8401 |
Adelphi, MD 207831197 |
Advisers
| Name |
E-mail |
Phone |
|
| Balu, Radhakrishnan |
radhakrishnan.balu.civ@mail.mil |
301.394.4302 |
Description
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.
Keywords:
Quantum computation; Quantum information; Quantum algorithms; Quantum computational complexity; Information sciences; Quantum; information; Computation; Algorithms;
Eligibility
Citizenship:
Open to U.S. citizens, permanent residents and non-U.S. citizens
Level:
Open to Postdoctoral applicants