• Publications
  • Influence
Report on Post-Quantum Cryptography
TLDR
The National Institute of Standards and Technology (NIST)'s current understanding about the status of quantum computing and post-quantum cryptography is shared, and NIST’s initial plan to move forward is outlined.
Perturbative gadgets at arbitrary orders
Adiabatic quantum algorithms are often most easily formulated using many-body interactions. However, experimentally available interactions are generally two-body. In 2004, Kempe, Kitaev, and Regev
Quantum Algorithms for Quantum Field Theories
TLDR
A quantum algorithm to compute relativistic scattering probabilities in a massive quantum field theory with quartic self-interactions in spacetime of four and fewer dimensions is developed and achieves exponential speedup over the fastest known classical algorithm.
Error Correcting Codes For Adiabatic Quantum Computation
Mathematics Department, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139(Dated: February 1, 2008)Recently, there has been growing interest in using adiabatic quantum computation
Fast quantum algorithm for numerical gradient estimation.
  • S. Jordan
  • Computer Science
    Physical review letters
  • 25 May 2004
TLDR
The number of bits of precision to which f must be evaluated matches the classical requirement in the limit of large n, and on a quantum computer this requires only one query regardless of d.
Estimating Jones polynomials is a complete problem for one clean qubit
TLDR
It is shown that evaluating a certain approximation to the Jones polynomial at a fifth root of unity for the trace closure of a braid is a complete problem for the one clean qubit complexity class.
Permutational quantum computing
  • S. Jordan
  • Computer Science
    Quantum Inf. Comput.
  • 14 June 2009
TLDR
This work considers a model of quantum computation that disregards even the topology of the particle trajectory, and computes by permuting particles, whereas topological quantum computation requires anyons.
Polynomial-time quantum algorithm for the simulation of chemical dynamics
TLDR
This paper uses the split-operator approach and explicitly simulates all electron-nuclear and interelectronic interactions in quadratic time, and shows how to efficiently obtain chemically relevant observables, such as state-to-state transition probabilities and thermal reaction rates.
Quantum computation of scattering in scalar quantum field theories
TLDR
A quantum algorithm to compute relativistic scattering amplitudes in massive ϕ4 theory in spacetime of four and fewer dimensions offers exponential speedup over existing classical methods at high precision or strong coupling.
Quantum Algorithms for Fermionic Quantum Field Theories
Extending previous work on scalar field theories, we develop a quantum algorithm to compute relativistic scattering amplitudes in fermionic field theories, exemplified by the massive Gross-Neveu
...
...