12 citations · 31 across the 15 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
quant-ph2025
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…
quant-ph2025★ 1 cited
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…