S
Stephen P. Jordan
Researcher at University of Maryland, College Park
Publications - 82
Citations - 3705
Stephen P. Jordan is an academic researcher from University of Maryland, College Park. The author has contributed to research in topics: Quantum computer & Quantum algorithm. The author has an hindex of 28, co-authored 79 publications receiving 2953 citations. Previous affiliations of Stephen P. Jordan include Microsoft & Case Western Reserve University.
Papers
More filters
ReportDOI
Report on Post-Quantum Cryptography
Lidong Chen,Stephen P. Jordan,Yi-Kai Liu,Dustin Moody,René Peralta,Ray A. Perlner,Daniel Smith-Tone +6 more
TL;DR: 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.
Journal ArticleDOI
Quantum Algorithms for Quantum Field Theories
TL;DR: In this paper, the authors developed a quantum algorithm to compute relativistic scattering probabilities in a massive quantum field theory with quartic self-interactions (φ^4 theory) in spacetime of four and fewer dimensions.
Journal ArticleDOI
Polynomial-Time Quantum Algorithm for the Simulation of Chemical Dynamics
TL;DR: 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.
Journal ArticleDOI
Experimentally generated randomness certified by the impossibility of superluminal signals
Peter Bierhorst,Peter Bierhorst,Emanuel Knill,Emanuel Knill,Scott Glancy,Yanbao Zhang,Yanbao Zhang,Alan Mink,Stephen P. Jordan,Andrea Rommal,Yi-Kai Liu,Bradley G. Christensen,Sae Woo Nam,Martin J. Stevens,Lynden K. Shalm,Lynden K. Shalm +15 more
TL;DR: 1,024 random bits that are uniformly distributed to within 10−12 and unpredictable assuming the impossibility of superluminal communication are generated and certified using a loophole-free Bell test and a protocol is described that is optimized for devices that are characterized by a low per-trial violation of Bell inequalities.
Journal ArticleDOI
Error Correcting Codes For Adiabatic Quantum Computation
TL;DR: In this paper, stabilizer codes are used to produce a constant energy gap against one-local and two-local noise, and the corresponding fault-tolerant universal Hamiltonians are four-and six-local, respectively.