Adjunct Associate Professor (2014-2018)

3100K Atlantic Building

(301) 857-2481

Home Institution:

Microsoft Research

Visit Dates:

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.

“Quantum Algorithm for Simulating the Wave Equation”, Phys. Rev. A , vol. 99 , no. 012323 , 2019. ,

“Quantum Cryptanalysis: Shor, Grover, and Beyond”, IEEE Security & Privacy , vol. 16, no. 5, pp. 14-21, 2018. ,

“Diffusion Monte Carlo Versus Adiabatic Computation for Local Hamiltonians”, Physical Review A, vol. 97, no. 2, p. 022323, 2018. ,

“BQP-completeness of Scattering in Scalar Quantum Field Theory”, Quantum, vol. 2, p. 44, 2018. ,

“Fast optimization algorithms and the cosmological constant”, Physical Review D, vol. 96, no. 10, p. 103512, 2017. ,

“Fast quantum computation at arbitrarily low energy”, Physical Review A, vol. 95, p. 032305, 2017. ,

“Modulus of continuity eigenvalue bounds for homogeneous graphs and convex subgraphs with applications to quantum Hamiltonians”, Journal of Mathematical Analysis and Applications, vol. 452, no. 2, pp. 1269-1290, 2017. ,

“Black Holes, Quantum Mechanics, and the Limits of Polynomial-time Computability”, XRDS, vol. 23, pp. 30–33, 2016. ,

“Grover search and the no-signaling principle”, Physical Review Letters, vol. 117, p. 120501, 2016. ,

“Adiabatic optimization versus diffusion Monte Carlo”, Physical Review A, vol. 94, p. 042318, 2016. ,

“Yang-Baxter operators need quantum entanglement to distinguish knots”, Journal of Physics A, vol. 49, no. 7, p. 075203, 2016. ,

“Adiabatic optimization without local minima”, Quantum Information and Computation, vol. 15, no. 3-4, pp. 181-199, 2015. ,

“Strong Equivalence of Reversible Circuits is coNP-complete”, Quantum Information Computation, vol. 14, pp. 1302–1307, 2014. ,

“Quantum Computation of Scattering in Scalar Quantum Field Theories”, Quantum Information and Computation, vol. 14, no. 11-12, pp. 1014-1080, 2014. ,

“Partial-indistinguishability obfuscation using braids”, In Proceedings of the Sixth Conference on Theory of Quantum Computation, Communication and Cryptography (TQC14). 2014. ,

“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. ,

“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. ,

“Testing quantum expanders is co-QMA-complete”, Physical Review A, vol. 87, no. 4, 2013. ,