Stephen Jordan

spjordan's picture
Adjunct Associate Professor (2014-2018)
Home Institution: 
Microsoft Research
Visit Dates: 
May 16, 2023
November 17, 2019 to November 21, 2019
June 10, 2019 to June 12, 2019
January 29, 2019 to February 1, 2019
July 17, 2018 to July 19, 2018
April 12, 2018 to April 13, 2018

Stephen Jordan was 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 focused on quantum information, especially algorithms, complexity and post-quantum cryptography. This included 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. After QuICS, he continued on as a Senior Researcher for the Quantum Architectures and Computation (QuARC) group at Microsoft Research in Redmond Washington.

Publications

2014

G. Alagic, Bapat, A., and Jordan, S. P., “Classical simulation of Yang-Baxter gates”, 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014), vol. 27, pp. 161-175, 2014.
S. P. Jordan, Lee, K. S. M., and Preskill, J., “Quantum Algorithms for Fermionic Quantum Field Theories”, 2014.
M. Jarret and Jordan, S. P., “The Fundamental Gap for a Class of Schrödinger Operators on Path and Hypercube Graphs”, Journal of Mathematical Physics, vol. 55, no. 5, p. 052104, 2014.

2013

A. D. Bookatz, Jordan, S. P., Liu, Y. - K., and Wocjan, P., “Testing quantum expanders is co-QMA-complete”, Physical Review A, vol. 87, no. 4, 2013.

2012

S. P. Jordan, Lee, K. S. M., and Preskill, J., “Quantum Algorithms for Quantum Field Theories”, Science, vol. 336, no. 6085, pp. 1130 - 1133, 2012.
S. P. Jordan, Kobayashi, H., Nagaj, D., and Nishimura, H., “Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems”, Quantum Information and Computation, vol. 12, no. 5-6, pp. 461-471, 2012.

2011

S. P. Jordan and Alagic, G., “Approximating the Turaev-Viro Invariant of Mapping Tori is Complete for One Clean Qubit”, In Proceedings of the Sixth Conference on Theory of Quantum Computation, Communication and Cryptography (TQC11). 2011.

2010

S. P. Jordan, Gosset, D., and Love, P. J., “QMA-complete problems for stoquastic Hamiltonians and Markov matrices”, Physical Review A, vol. 81, no. 3, 2010.
G. Alagic, Jordan, S. P., Koenig, R., and Reichardt, B. W., “Approximating Turaev-Viro 3-manifold invariants is universal for quantum computation ”, Physical Review A, vol. 82, no. 4, 2010.
S. P. Jordan, Mansour, T., and Severini, S., “On the degeneracy of SU(3)k topological phases”, 2010.
S. P. Jordan, “Permutational Quantum Computing”, Quantum Information & Computation, vol. 10, no. 5, pp. 470-497, 2010.

2009

S. P. Jordan and Wocjan, P., “Efficient quantum circuits for arbitrary sparse unitaries”, Physical Review A, vol. 80, no. 6, 2009.
P. M. Wocjan, Jordan, S. P., Ahmadi, H., and Brennan, J. P., “Efficient quantum processing of ideals in finite rings”, 2009.
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.

2008

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.
S. P. Jordan, “Fast quantum algorithms for approximating some irreducible representations of groups ”, 2008.
S. P. Jordan, “Quantum Computation Beyond the Circuit Model”, 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.