4 citations · 6 across the 7 of their papers we have counts for
7 papers
Harmonic sequence state-preparation
Benjamin Rempfer, Parker Kuklinski, Justin Elenewski +1
We demonstrate an efficient circuit to prepare a quantum state with amplitudes proportional to a harmonic sequence. We do this by first preparing a large quantum state with linearl…
Efficient block-encodings require structure
Parker Kuklinski, Benjamin Rempfer, Justin Elenewski +1
Block-encodings are ubiquitous in quantum computing as a way to represent data within a unitary operator. While several unstructured methods are applicable to arbitrary data, these…
A simpler Gaussian state-preparation
Parker Kuklinski, Benjamin Rempfer, Kevin Obenland +1
The ability to efficiently state-prepare Gaussian distributions is critical to the success of numerous quantum algorithms. The most popular algorithm for this subroutine (Kitaev-We…
Manipulating quasi-bound states in a photonic crystal with periodic impurities to store quantum information
Benjamin Rempfer, Gonzalo Ordonez
We analytically model a one-dimensional lattice with periodic impurities representing a photonic crystal from first principles. We then investigate bound states in the continuum by…
Comparison of Superconducting NISQ Architectures
Benjamin Rempfer, Kevin Obenland
Advances in quantum hardware have begun the noisy intermediate-scale quantum (NISQ) computing era. A pressing question is: what architectures are best suited to take advantage of t…
Detailed assessment of calculating drag force with quantum computers: Explicit time-evolution precludes exponential advantage for nonlinear differential equations
John Penuel, Amara Katabarwa, Peter D. Johnson +5
This study examines the potential for fault-tolerant quantum computers to provide utility in fluid dynamics simulations, with a focus on drag force calculations for ship hull desig…
S-FABLE and LS-FABLE: Fast approximate block-encoding algorithms for unstructured sparse matrices
Parker Kuklinski, Benjamin Rempfer
The Fast Approximate BLock-Encoding algorithm (FABLE) is a technique to block-encode arbitrary dense matrices into quantum circuits using at most one and two-q…