60 citations · 178 across the 36 of their papers we have counts for
40 papers
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…
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…
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…
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…
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…
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…
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,…
Efficient circuits for leaf-separable state preparation
Sunil Vittal, Anthony Wilkie, Nika Rastegari +2
Efficient state preparation is a challenging and important problem in quantum computing. In this work, we present a recursive state preparation algorithm that combines logarithmic-…
An Exclusive-Sum-of-Products Pipeline for QAOA
Matthew Brunet, Shilpi Shah, Mostafa Atallah +2
The quantum approximate optimization algorithm is commonly used to solve combinatorial optimization problems. While unconstrained problems map naturally into the algorithm, incorpo…
Partitioned-Constraint QAOA (PC-QAOA): Structural State Preparation and Penalty Enforcement for Quantum Optimization
Anthony Wilkie, Alexander DeLise, Andrew Del Real +2
Constrained combinatorial optimization remains challenging for quantum algorithms because feasibility must be explicitly enforced, typically through penalty terms or problem-specif…
A mixed-integer program for circuit execution time minimization with precedence constraints
Mostafa Atallah, James Ostrowski, Rebekah Herrman
We present a mixed-integer programming (MIP) model for scheduling quantum circuits to minimize execution time. Our approach maximizes parallelism by allowing non-overlapping gates…
Decomposition of Sparse Amplitude Permutation Gates with Application to Preparation of Sparse Clustered Quantum States
Igor Gaidai, Rebekah Herrman
In this work we consider a novel heuristic decomposition algorithm for -qubit gates that implement specified amplitude permutations on sparse states with non-zero amplitudes…
Leaky forcing and resilience of Cartesian products of
Rebekah Herrman, Grace Wisdom
Zero forcing is a process on a graph in which a set of initially colored vertices,, can color their neighbors according to the color change rule. T…
Efficient Sparse State Preparation via Quantum Walks
Alvin Gonzales, Rebekah Herrman, Colin Campbell +4
Continuous-time quantum walks (CTQWs) on dynamic graphs, referred to as dynamic CTQWs, are a recently introduced universal model of computation that offers a new paradigm in which…
An angle rounding parameter initialization technique for ma-QAOA
Anthony Wilkie, James Ostrowski, Rebekah Herrman
The multi-angle quantum approximate optimization algorithm (ma-QAOA) is a recently introduced algorithm that gives at least the same approximation ratio as the quantum approximate…
Bootstrap percolation and -hull number in direct products of graphs
Boštjan Brešar, Jaka Hedžet, Rebekah Herrman
The -neighbor bootstrap percolation is a graph infection process based on the update rule by which a vertex with infected neighbors becomes infected. We say that an initial…
Quantum approximate optimization algorithm with random and subgraph phase operators
Anthony Wilkie, Igor Gaidai, James Ostrowski +1
The quantum approximate optimization algorithm (QAOA) is a promising quantum algorithm that can be used to approximately solve combinatorial optimization problems. The usual QAOA a…
Quantum Distance Approximation for Persistence Diagrams
Bernardo Ameneyro, Rebekah Herrman, George Siopsis +1
Topological Data Analysis methods can be useful for classification and clustering tasks in many different fields as they can provide two dimensional persistence diagrams that summa…
Performance Analysis of Multi-Angle QAOA for p > 1
Igor Gaidai, Rebekah Herrman
In this paper we consider the scalability of Multi-Angle QAOA with respect to the number of QAOA layers. We found that MA-QAOA is able to significantly reduce the depth of QAOA cir…
Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms
Moises Ponce, Rebekah Herrman, Phillip C. Lotshaw +4
The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current nois…
A Proof of the Grundy domination strong product conjecture
Rebekah Herrman, Stephen G. Z. Smith
The Grundy domination number of a simple graph is the length of the longest sequence of unique vertices , , that satisfies the proper…
Extending Grundy domination to -Grundy domination
Rebekah Herrman, Stephen G. Z. Smith
The Grundy domination number of a graph is the length of the longest sequence of unique vertices satisfying $N[v_i] \setminus \cup_{j=1}^{i-1}N…
Approximate Boltzmann Distributions in Quantum Approximate Optimization
Phillip C. Lotshaw, George Siopsis, James Ostrowski +4
Approaches to compute or estimate the output probability distributions from the quantum approximate optimization algorithm (QAOA) are needed to assess the likelihood it will obtain…
Multi-Angle QAOA Does Not Always Need All Its Angles
Kaiyan Shi, Rebekah Herrman, Ruslan Shaydulin +3
Introducing additional tunable parameters to quantum circuits is a powerful way of improving performance without increasing hardware requirements. A recently introduced multiangle…