Estimating Jones polynomials is a complete problem for one clean qubit. - Peter W. Shor; Stephen P. Jordan (Quantum Inf. Comput., 2008)

Estimating Jones and Homfly polynomials with one clean qubit. - Stephen P. Jordan; Pawel Wocjan (Quantum Inf. Comput., 2009)

Discrete-Query Quantum Algorithm for NAND Trees. - Andrew M. Childs; Richard Cleve; Stephen P. Jordan; David L. Yonge-Mallo (Theory Comput., 2009)

Permutational quantum computing. - Stephen P. Jordan (Quantum Inf. Comput., 2010)

Approximating the Turaev-Viro Invariant of Mapping Tori is Complete for One Clean Qubit. - Stephen P. Jordan; Gorjan Alagic (TQC, 2011)

Partial-indistinguishability obfuscation using braids - Gorjan Alagic; Stacey Jeffery; Stephen P. Jordan (CoRR, 2012)

Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems. - Stephen P. Jordan; Hirotada Kobayashi; Daniel Nagaj; Harumichi Nishimura (Quantum Inf. Comput., 2012)

Classical Simulation of Yang-Baxter Gates. - Gorjan Alagic; Aniruddha Bapat; Stephen P. Jordan (TQC, 2014)

Circuit Obfuscation Using Braids. - Gorjan Alagic; Stacey Jeffery; Stephen P. Jordan (TQC, 2014)

Strong equivalence of reversible circuits is coNP-complete. - Stephen P. Jordan (Quantum Inf. Comput., 2014)

Quantum computation of scattering in scalar quantum field theories. - Stephen P. Jordan; Keith S. M. Lee; John Preskill (Quantum Inf. Comput., 2014)

Adiabatic optimization without local minima. - Michael Jarret; Stephen P. Jordan (Quantum Inf. Comput., 2015)

Black holes, quantum mechanics, and the limits of polynomial-time computability. - Stephen P. Jordan (XRDS, 2016)

Quantum Cryptanalysis: Shor, Grover, and Beyond. - Stephen P. Jordan; Yi-Kai Liu 001 (IEEE Secur. Priv., 2018)

Experimentally generated randomness certified by the impossibility of superluminal signals. - Peter Bierhorst; Emanuel Knill; Scott Glancy; Yanbao Zhang; Alan Mink; Stephen P. Jordan; Andrea Rommal; Yi-Kai Liu 001; Bradley Christensen; Sae Woo Nam; Martin J. Stevens; Lynden K. Shalm (Nat., 2018)

BQP-completeness of scattering in scalar quantum field theory. - Stephen P. Jordan; Hari Krovi; Keith S. M. Lee; John Preskill (Quantum, 2018)

Bang-bang control as a design principle for classical and quantum optimization algorithms. - Aniruddha Bapat; Stephen P. Jordan (Quantum Inf. Comput., 2019)

Efficiently constructing a quantum uniform superposition over bit strings near a binary linear code. - Edward Farhi; Stephen P. Jordan (Quantum Inf. Comput., 2024)