1. Research
  2. Publications

Publications

Export 1257 results:
[ Author(Desc)] Title Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
J
S. P. Jordan, “Fast quantum algorithms for approximating some irreducible representations of groups ”, 2008.
S. P. Jordan, “Black Holes, Quantum Mechanics, and the Limits of Polynomial-time Computability”, XRDS, vol. 23, pp. 30–33, 2016.
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.
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.
S. P. Jordan, “Quantum Computation Beyond the Circuit Model”, 2008.
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.
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 and Farhi, E., “Perturbative Gadgets at Arbitrary Orders”, Physical Review A, vol. 77, no. 6, 2008.
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, “Fast quantum algorithm for numerical gradient estimation”, Physical Review Letters, vol. 95, no. 5, 2005.
S. P. Jordan, “Fast quantum computation at arbitrarily low energy”, Physical Review A, vol. 95, p. 032305, 2017.
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.
S. P. Jordan, “Strong Equivalence of Reversible Circuits is coNP-complete”, Quantum Information Computation, vol. 14, pp. 1302–1307, 2014.
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.
S. P. Jordan and Wocjan, P., “Efficient quantum circuits for arbitrary sparse unitaries”, Physical Review A, vol. 80, no. 6, 2009.
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, “Permutational Quantum Computing”, Quantum Information & Computation, vol. 10, no. 5, pp. 470-497, 2010.
S. P. Jordan, Mansour, T., and Severini, S., “On the degeneracy of SU(3)k topological phases”, 2010.
S. P. Jordan, Farhi, E., and Shor, P. W., “Error correcting codes for adiabatic quantum computation”, Physical Review A, vol. 74, no. 5, 2006.
S. P. Jordan, Lee, K. S. M., and Preskill, J., “Quantum Algorithms for Fermionic Quantum Field Theories”, 2014.
K
D. Kafri, Taylor, J. M., and Milburn, G. J., “A classical channel model for gravitational decoherence”, New Journal of Physics, vol. 16, no. 6, p. 065020, 2014.
D. Kafri, Milburn, G. J., and Taylor, J. M., “Bounds on quantum communication via Newtonian gravity”, New Journal of Physics, vol. 17, no. 1, p. 015006, 2015.
D. Kafri and Taylor, J. M., “Algorithmic Cooling of a Quantum Simulator”, 2012.
D. Kafri and Taylor, J. M., “A noise inequality for classical forces”, 2013.
S. S. Kalantre, Zwolak, J. P., Ragole, S., Wu, X., Zimmerman, N. M., Stewart, M. D., and Taylor, J. M., “Machine Learning techniques for state recognition and auto-tuning in quantum dots”, 2017.