Biography

Rebekah Herrman is an Assistant Professor in the Industrial and Systems Engineering department at the University of Tennessee Knoxville. She received her PhD in mathematics in 2020 from the University of Memphis with a focus in combinatorics. While there, she studied graph theory games and optimization problems on graphs. She is a class of 2022 DARPA FORWARD Riser, a 22-23 APS Career Mentoring Fellow, and her work is currently supported by the National Science Foundation. Aside from graph theory, her current research interest is quantum machine learning applied to combinatorial optimization problems.

Education

• BS Mathematics and Physics, Christian Brothers University
• MS Mathematics The University of Memphis
• PhD Mathematics, The University of Memphis, adviser Béla Bollobás

Research Publications

1. Herrman, R., Ostrowski, J., Humble, T. S., & Siopsis, G. (2021). Lower bounds on circuit depth of the quantum approximate optimization algorithm. Quantum Information Processing, 20(2), 1-17.
2. Herrman, R., & Humble, T. S. (2019). Continuous-time quantum walks on dynamic graphs. Physical Review A, 100(1), 012306.
3. Herrman, R., & van Hintum, P. (2021). The (t, r) broadcast domination number of some regular graphs. Discrete Applied Mathematics, 289, 270-280.
4. https://scholar.google.com/citations?user=CGJR52sAAAAJ&hl=en&oi=ao