Stephen Jordan

spjordan's picture
Adjunct Associate Professor
3100K Atlantic Building
(301) 857-2481

Stephen Jordan is an Adjunct Associate Professor in the University of Maryland Institute for Advanced Computer Studies (UMIACS) and a physicist in the Information Technology Laboratory at the National Institute of Standards and Technology (NIST). Jordan’s research focuses on quantum information, especially algorithms, complexity and post-quantum cryptography. This includes simulating chemistry and particle physics on quantum computers, applying methods from physics and topology to computer science, and investigating alternative models of quantum computation, such as the adiabatic, permutational, and one-clean-qubit models. He received his doctoral degree in physics from MIT in 2008.



S. P. Jordan, Permutational Quantum Computing, Quantum Information & Computation, vol. 10, no. 5, pp. 470-497, 2010.


A. M. Childs, Cleve, R., Jordan, S. P., and Yeung, D., Discrete-query quantum algorithm for NAND trees, Theory of Computing, vol. 5, no. 1, pp. 119 - 123, 2009.
S. P. Jordan and Wocjan, P., Estimating Jones and HOMFLY polynomials with One Clean Qubit, Quantum Information and Computation, vol. 9, no. 3, pp. 264-289, 2009.


S. P. Jordan and Farhi, E., Perturbative Gadgets at Arbitrary Orders, Physical Review A, vol. 77, no. 6, 2008.
I. Kassal, Jordan, S. P., Love, P. J., Mohseni, M., and Aspuru-Guzik, A., Polynomial-time quantum algorithm for the simulation of chemical dynamics , Proceedings of the National Academy of Sciences, vol. 105, no. 48, pp. 18681 - 18686, 2008.
P. W. Shor and Jordan, S. P., Estimating Jones polynomials is a complete problem for one clean qubit, Quantum Information & Computation, vol. 8, no. 8, pp. 681-714, 2008.



S. P. Jordan, Fast quantum algorithm for numerical gradient estimation, Physical Review Letters, vol. 95, no. 5, 2005.