1. Research
  2. Publications

Publications

Export 42 results:
Author Title Type [ Year(Asc)]
Filters: Author is Stephen P. Jordan  [Clear All Filters]
2012
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.
2011
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.
2010
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.
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.
S. P. Jordan, Mansour, T., and Severini, S., “On the degeneracy of SU(3)k topological phases”, 2010.
S. P. Jordan, “Permutational Quantum Computing”, Quantum Information & Computation, vol. 10, no. 5, pp. 470-497, 2010.
2009
S. P. Jordan and Wocjan, P., “Efficient quantum circuits for arbitrary sparse unitaries”, Physical Review A, vol. 80, no. 6, 2009.
P. M. Wocjan, Jordan, S. P., Ahmadi, H., and Brennan, J. P., “Efficient quantum processing of ideals in finite rings”, 2009.
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.
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.
2008
S. P. Jordan and Farhi, E., “Perturbative Gadgets at Arbitrary Orders”, Physical Review A, vol. 77, no. 6, 2008.
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.
S. P. Jordan, “Fast quantum algorithms for approximating some irreducible representations of groups ”, 2008.
S. P. Jordan, “Quantum Computation Beyond the Circuit Model”, 2008.
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.
2006
S. P. Jordan, Farhi, E., and Shor, P. W., “Error correcting codes for adiabatic quantum computation”, Physical Review A, vol. 74, no. 5, 2006.
2005
S. P. Jordan, “Fast quantum algorithm for numerical gradient estimation”, Physical Review Letters, vol. 95, no. 5, 2005.