Skip to content

Author

Dylan Herman

4 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Nov 2026

No Exponential Quantum Advantage for Decoded Quantum Interferometry with Local Quantum Decoders

Decoded quantum interferometry (DQI) reduces optimization of sparse linear constraint problems, and sampling from their Gibbs measures, to decoding a linear code from a quantum state. We study DQI on random $D$-regular $k$-sparse instances with $k\ge3$, for which local decoders such as belief propagation with quantum m...

Brandon Augustino, Shouvanik Chakrabarti, Enrico Fontana et al. · 1 citation · ⚡1
Preprint Oct 2026

The Quartic Gap Between Quantum and Dequantized Algorithms for Linear Algebra Is Tight

Quantum algorithms for linear algebra that access a matrix $A$ through quantum random access memory (QRAM) prepare quantum states proportional to the solutions of linear systems and related problems. Dequantized classical algorithms, when given sampling and query access to $A$, return sampling and query access to an ap...

Shouvanik Chakrabarti, D. Herman, J. Kim et al. · 1 citation
Preprint Oct 2026

Quantum algorithms for orthogonal polynomial transforms

A quantum orthogonal polynomial transform (QOPT) is an algorithmic primitive that maps a superposition of standard basis states $\sum_k \alpha_{k} \ket{k}$ coherently to a basis of normalized univariate polynomials orthogonal with respect to a probability measure $\mu(x)$. We provide new discrete and continuous QOPTs f...

A. Prakash, S. Sureshbabu, Dylan Herman et al. · 0 citations
Preprint Sep 2026

Near-Optimal Quantum Lower Bounds for Convex Optimization via Fourier Rank

We establish a near-linear quantum query lower bound for high-accuracy convex optimization over an explicit family of $n$-dimensional ellipsoids. We focus on linear optimization with an explicitly given objective, where the feasible set is accessed through a membership oracle. We show that any algorithm that, for every...

Brandon Augustino, Shouvanik Chakrabarti, Enrico Fontana et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.