520 citations · 2.5k across the 46 of their papers we have counts for
5 papers · 1 filter
Fast quantum algorithms for approximating some irreducible representations of groups
Stephen P. Jordan
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum…
Quantum Computation Beyond the Circuit Model
Stephen P. Jordan
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical…
Estimating Jones and HOMFLY polynomials with One Clean Qubit
Stephen P. Jordan, Pawel Wocjan
The Jones and HOMFLY polynomials are link invariants with close connections to quantum computing. It was recently shown that finding a certain approximation to the Jones polynomial…
Perturbative Gadgets at Arbitrary Orders
Stephen P. Jordan, Edward Farhi
Adiabatic quantum algorithms are often most easily formulated using many-body interactions. However, experimentally available interactions are generally two-body. In 2004, Kempe, K…
Polynomial-time quantum algorithm for the simulation of chemical dynamics
Ivan Kassal, Stephen P. Jordan, Peter J. Love +2
The computational cost of exact methods for quantum simulation using classical computers grows exponentially with system size. As a consequence, these techniques can only be applie…