Publications

Export 40 results:
Author Title [ Type(Asc)] Year
Filters: Author is Stephen P. Jordan  [Clear All Filters]
Journal Article
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.
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.
S. P. Jordan, Strong Equivalence of Reversible Circuits is coNP-complete, Quantum Information Computation, vol. 14, pp. 1302–1307, 2014.
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.
S. P. Jordan and Liu, Y. - K., Quantum Cryptanalysis: Shor, Grover, and Beyond, IEEE Security & Privacy , vol. 16, no. 5, pp. 14-21, 2018.
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.
S. P. Jordan, Quantum Computation Beyond the Circuit Model, 2008.
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, Lee, K. S. M., and Preskill, J., Quantum Algorithms for Fermionic Quantum Field Theories, 2014.
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.
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.
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.
J. Bringewatt, Dorland, W., and Jordan, S. P., Polynomial Time Algorithms for Estimating Spectra of Adiabatic Hamiltonians, 2019.
S. P. Jordan and Farhi, E., Perturbative Gadgets at Arbitrary Orders, Physical Review A, vol. 77, no. 6, 2008.
S. P. Jordan, Permutational Quantum Computing, Quantum Information & Computation, vol. 10, no. 5, pp. 470-497, 2010.
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.
N. Bao, Bouland, A., and Jordan, S. P., Grover search and the no-signaling principle, Physical Review Letters, vol. 117, p. 120501, 2016.
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.
S. P. Jordan, Fast quantum computation at arbitrarily low energy, Physical Review A, vol. 95, p. 032305, 2017.
S. P. Jordan, Fast quantum algorithms for approximating some irreducible representations of groups , 2008.
S. P. Jordan, Fast quantum algorithm for numerical gradient estimation, Physical Review Letters, vol. 95, no. 5, 2005.
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.
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.
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 and Wocjan, P., Estimating Jones and HOMFLY polynomials with One Clean Qubit, Quantum Information and Computation, vol. 9, no. 3, pp. 264-289, 2009.