Rebekah Herrman

Orcid: 0000-0001-6944-4206

According to our database1, Rebekah Herrman authored at least 22 papers between 2021 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Layer-wise QUBO-Based Training of CNN Classifiers for Quantum Annealing.
CoRR, March, 2026

Decomposition of sparse amplitude permutation gates with application to preparation of sparse clustered quantum states.
Quantum Inf. Process., January, 2026

Bootstrap percolation and <i>P<sub>3</sub></i>-hull number in direct products of graphs.
Discuss. Math. Graph Theory, 2026

2025
Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms.
Quantum Inf. Process., February, 2025

Extended Poster Abstract: Graph Matching Trotterization for CTQW Circuit Simulation.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2025

2024
QAOA with random and subgraph phase operators.
CoRR, 2024

Quantum Distance Approximation for Persistence Diagrams.
CoRR, 2024

Arbitrary State Preparation via Quantum Walks.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2024

Mathematical Model for SWAP Gate Minimization on NISQ Hardware.
Proceedings of the IEEE Computer Society Annual Symposium on VLSI, 2024

2023
Solving MaxCut with quantum imaginary time evolution.
Quantum Inf. Process., July, 2023

Performance Analysis of Multi-Angle QAOA for p > 1.
CoRR, 2023

2022
Simplifying continuous-time quantum walks on dynamic graphs.
Quantum Inf. Process., 2022

On the length of L-Grundy sequences.
Discret. Optim., 2022

The (d-2)-leaky forcing number of Qd and ℓ-leaky forcing number of GP(n, 1).
Discret. Optim., 2022

Capture times in the bridge-burning cops and robbers game.
Discret. Appl. Math., 2022

Multiangle QAOA Does Not Always Need All Its Angles.
Proceedings of the 7th IEEE/ACM Symposium on Edge Computing, 2022

2021
Empirical performance bounds for quantum approximate optimization.
Quantum Inf. Process., 2021

Impact of graph structures for QAOA on MaxCut.
Quantum Inf. Process., 2021

Lower bounds on circuit depth of the quantum approximate optimization algorithm.
Quantum Inf. Process., 2021

The eternal game chromatic number of random graphs.
Eur. J. Comb., 2021

The (t, r) broadcast domination number of some regular graphs.
Discret. Appl. Math., 2021

Globally Optimizing QAOA Circuit Depth for Constrained Optimization Problems.
Algorithms, 2021


  Loading...