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.
M. Jarret and Jordan, S. P.,
“Adiabatic optimization without local minima”,
Quantum Information and Computation, vol. 15, no. 3-4, pp. 181-199, 2015.
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.
J. Bringewatt, Dorland, W., Jordan, S. P., and Mink, A.,
“Diffusion Monte Carlo Versus Adiabatic Computation for Local Hamiltonians”,
Physical Review A, vol. 97, no. 2, p. 022323, 2018.
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.
N. Bao, Bousso, R., Jordan, S. P., and Lackey, B.,
“Fast optimization algorithms and the cosmological constant”,
Physical Review D, vol. 96, no. 10, p. 103512, 2017.