{\rtf1\ansi\deff0\deftab360 {\fonttbl {\f0\fswiss\fcharset0 Arial} {\f1\froman\fcharset0 Times New Roman} {\f2\fswiss\fcharset0 Verdana} {\f3\froman\fcharset2 Symbol} } {\colortbl; \red0\green0\blue0; } {\info {\author Biblio 7.x}{\operator }{\title Biblio RTF Export}} \f1\fs24 \paperw11907\paperh16839 \pgncont\pgndec\pgnstarts1\pgnrestart T. J. Sewell and Jordan, S. P., ?Preparing Renormalization Group Fixed Points on NISQ Hardware?, 2021.\par \par A. Bapat and Jordan, S. P., ?Approximate optimization of MAXCUT with a local spin algorithm?, 2020.\par \par J. Bringewatt, Dorland, W., and Jordan, S. P., ?Polynomial Time Algorithms for Estimating Spectra of Adiabatic Hamiltonians?, Phys. Rev. A, vol. 100, no. 032336, 2019.\par \par P. C. S. Costa, Jordan, S. P., and Ostrander, A., ?Quantum Algorithm for Simulating the Wave Equation?, Phys. Rev. A , vol. 99 , no. 012323 , 2019.\par \par A. Hamed Moosavian, Garrison, J. R., and Jordan, S. P., ?Site-by-site quantum state preparation algorithm for preparing vacua of fermionic lattice field theories ?, 2019.\par \par S. P. Jordan, Krovi, H., Lee, K. S. M., and Preskill, J., ?BQP-completeness of Scattering in Scalar Quantum Field Theory?, Quantum, vol. 2, p. 44, 2018.\par \par 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.\par \par S. P. Jordan and Liu, Y. - K., ?Quantum Cryptanalysis: Shor, Grover, and Beyond?, IEEE Security & Privacy , vol. 16, no. 5, pp. 14-21, 2018.\par \par P. Bierhorst, Knill, E., Glancy, S., Mink, A., Jordan, S. P., Rommal, A., Liu, Y. - K., Christensen, B., Nam, S. Woo, and Shalm, L. K., ?Experimentally Generated Random Numbers Certified by the Impossibility of Superluminal Signaling?, 2017.\par \par 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.\par \par S. P. Jordan, ?Fast quantum computation at arbitrarily low energy?, Physical Review A, vol. 95, p. 032305, 2017.\par \par M. Jarret and Jordan, S. P., ?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.\par \par M. Jarret, Jordan, S. P., and Lackey, B., ?Adiabatic optimization versus diffusion Monte Carlo?, Physical Review A, vol. 94, p. 042318, 2016.\par \par S. P. Jordan, ?Black Holes, Quantum Mechanics, and the Limits of Polynomial-time Computability?, XRDS, vol. 23, pp. 30?33, 2016.\par \par N. Bao, Bouland, A., and Jordan, S. P., ?Grover search and the no-signaling principle?, Physical Review Letters, vol. 117, p. 120501, 2016.\par \par G. Alagic, Jarret, M., and Jordan, S. P., ?Yang-Baxter operators need quantum entanglement to distinguish knots?, Journal of Physics A, vol. 49, no. 7, p. 075203, 2016.\par \par M. Jarret and Jordan, S. P., ?Adiabatic optimization without local minima?, Quantum Information and Computation, vol. 15, no. 3-4, pp. 181-199, 2015.\par \par 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.\par \par M. Jarret and Jordan, S. P., ?The Fundamental Gap for a Class of Schr\'f6dinger Operators on Path and Hypercube Graphs?, Journal of Mathematical Physics, vol. 55, no. 5, p. 052104, 2014.\par \par G. Alagic, Jeffery, S., and Jordan, S. P., ?Partial-indistinguishability obfuscation using braids?, In Proceedings of the Sixth Conference on Theory of Quantum Computation, Communication and Cryptography (TQC14). 2014.\par \par S. P. Jordan, Lee, K. S. M., and Preskill, J., ?Quantum Algorithms for Fermionic Quantum Field Theories?, 2014.\par \par S. P. Jordan, Lee, K. S. M., and Preskill, J., ?Quantum Computation of Scattering in Scalar Quantum Field Theories?, Quantum Information and Computation, vol. 14, no. 11-12, pp. 1014-1080, 2014.\par \par S. P. Jordan, ?Strong Equivalence of Reversible Circuits is coNP-complete?, Quantum Information Computation, vol. 14, pp. 1302?1307, 2014.\par \par 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.\par \par 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.\par \par 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.\par \par 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.\par \par 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.\par \par S. P. Jordan, Mansour, T., and Severini, S., ?On the degeneracy of SU(3)k topological phases?, 2010.\par \par S. P. Jordan, ?Permutational Quantum Computing?, Quantum Information & Computation, vol. 10, no. 5, pp. 470-497, 2010.\par \par 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.\par \par 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.\par \par S. P. Jordan and Wocjan, P., ?Efficient quantum circuits for arbitrary sparse unitaries?, Physical Review A, vol. 80, no. 6, 2009.\par \par P. M. Wocjan, Jordan, S. P., Ahmadi, H., and Brennan, J. P., ?Efficient quantum processing of ideals in finite rings?, 2009.\par \par 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.\par \par 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.\par \par S. P. Jordan, ?Fast quantum algorithms for approximating some irreducible representations of groups?, 2008.\par \par S. P. Jordan and Farhi, E., ?Perturbative Gadgets at Arbitrary Orders?, Physical Review A, vol. 77, no. 6, 2008.\par \par 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.\par \par S. P. Jordan, ?Quantum Computation Beyond the Circuit Model?, 2008.\par \par S. P. Jordan, Farhi, E., and Shor, P. W., ?Error correcting codes for adiabatic quantum computation?, Physical Review A, vol. 74, no. 5, 2006.\par \par S. P. Jordan, ?Fast quantum algorithm for numerical gradient estimation?, Physical Review Letters, vol. 95, no. 5, 2005.\par \par }