activity
20182026
most citedEmpirical performance bounds for quantum approximate optimization

60 citations · 178 across the 36 of their papers we have counts for

collaborators
Showing 2026Show all

7 papers · 1 filter

quant-ph2026

Generating Dicke State Graphs

Rebekah Herrman

Graph theory is a powerful tool in quantum computing, with applications ranging from quantum circuit synthesis and optimization to entanglement mapping. Recent work has shown how o…

math-ph2026

Pauli Supported Invariants for Periodic Graphs-Derived Hamiltonians

Sarah Chehade, Andrew Vlasic, Rebekah Herrman +1

We introduce a graph invariant obtained from Pauli decompositions of Hamiltonians derived from local graph neighborhoods. Given a rooted h-hop neighborhood, we construct a local ad…

quant-ph2026

Predicting Resource Efficient Hamiltonian Decomposition for Continuous-Time Quantum Walk Simulations

Mostafa Atallah, Rebekah Herrman, Zain H. Saleem

Simulating a continuous-time quantum walk (CTQW) on a graph in the circuit model of quantum computing requires decomposing its Hamiltonian into terms that can be Trotterized into h…

quant-ph2026

Moment-Structured Block Encodings of Periodic Finite-Difference Operators

Jishnu Mahmud, Rebekah Herrman

Block encoding is the standard technique for accessing matrix data in quantum linear-algebra algorithms. Its implementation directly affects its subnormalization, which in turn con…

quant-ph2026

Explicit Block Encoding of Difference-of-Gaussian Operators on a Periodic Grid

Jishnu Mahmud, John Winship, Tom Lash +2

The Difference-of-Gaussian (DoG) is a widely used operator across applications, including image processing (feature and edge detection), quantum machine learning, and finite-differ…

quant-ph2026

Layer-wise QUBO-Based Training of CNN Classifiers for Quantum Annealing

Mostafa Atallah, Rebekah Herrman

Variational quantum circuits for image classification suffer from barren plateaus, while quantum kernel methods scale quadratically with dataset size. We propose an iterative frame…

quant-ph2026

A matching decomposition algorithm for simulating quantum walk Hamiltonians

Mostafa Atallah, Alvin Gonzales, Daniel Dilley +3

In this work, we present a new algorithm for generating quantum circuits that efficiently implement continuous time quantum walks on arbitrary simple sparse graphs. The algorithm,…