My research interest is applied graph theory, including domination, zero-forcing, graph theory games, quantum algorithms, quantum circuit compilation, and efficient quantum state preparation.

Publications

Underline denotes student or postdoc authors.

1. Ameneyro, Bernardo, Herrman, R, Siopsis, G. and Maroulas, V. "Quantum distance approximation for persistence diagrams." Journal of Physics: Complexity 6.1 (2025): 015005. 

2. Ponce, M., Herrman, R., Lotshaw, P. C., Powers, S., Siopsis, G., Humble, T., & Ostrowski, J. (2025). Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms. Quantum Information Processing, 24(2), 60. 

3. Gaidai, I., & Herrman, R. (2024). Performance analysis of multi-angle QAOA for p> 1. Scientific Reports, 14(1), 18911. 

4. Wilkie, A., Gaidai, I., Ostrowski, J., & Herrman, R. (2024). Quantum approximate optimization algorithm with random and subgraph phase operators. Physical Review A, 110(2), 022441. 

5. Bringman, S., Wilkie, A., Herrman, R., & Ostrowski, J. (2024, July). Mathematical model for SWAP gate minimization on NISQ hardware. In 2024 IEEE Computer Society Annual Symposium on VLSI (ISVLSI) (pp. 640-643). IEEE. 

6. Lotshaw, P. C., Siopsis, G., Ostrowski, J., Herrman, R., Alam, R., Powers, S., & Humble, T. S. (2023). Approximate Boltzmann distributions in quantum approximate optimization. Physical Review A, 108(4), 042411. 

7. Alam, R., Siopsis, G., Herrman, R., Ostrowski, J., Lotshaw, P.C., Humble, T.S., “Solving MaxCut with quantum imaginary time evolution”. Quantum Inf Process (2023)

8. Shi, K., Herrman, R., Shaydulin, R., Chakrabarti, S., Pistoia, M., & Larson, J. "Multi-Angle QAOA Does Not Always Need All Its Angles." IEEE/ACM 7th Symposium on Edge Computing (SEC) (2022).

9. Herrman, R. "The (d− 2)-leaky forcing number of Qd and ℓ-leaky forcing number of GP (n, 1)." Discrete Optimization, 46, 100744 (2022). 

10. Lotshaw, P.C., Nguyen, T., Santana, A. et al. "Scaling quantum approximate optimization on near-term hardware." Sci Rep 12, 12388 (2022). 

11. Herrman, R., & Smith, S. G. "On the length of L-Grundy sequences." Discrete Optimization, 45, 100725 (2022). 

12. Herrman, R., Lotshaw, P.C., Ostrowski, J., Humble, T.S., Siopsis, G., “Multi-angle quantum approximate optimization algorithm”.  Scientific Reports, 12(1), 1-10.

13. Herrman, R., van Hintum, P., Smith, Stephen G.Z. “Capture times in the bridge-burning cops and robbers game”.  Discrete Applied Mathematics, 317, 10-17.

14. Herrman, R., and Wong, T.G. "Simplifying continuous-time quantum walks on dynamic graphs." Quantum Inf Process 21, 2 (2022): 1-29 

15. Herrman, R., Treffert L., Ostrowski J., Lotshaw P.C., Humble T.S., and Siopsis G. “Impact of graph structures for QAOA on MaxCut” Quantum Inf Process 20, 289 (2021). 

16. Lotshaw, P.C., Humble, T.S., Herrman, R., Ostrowski, J. and Siopsis, G. "Empirical performance bounds for quantum approximate optimization." Quantum Inf Process 20, 12 (2021): 1-32.

17. Herrman, R., Treffert, L., Ostrowski, J., Lotshaw, P.C., Humble, T.S., Siopsis, G. “Globally optimizing QAOA circuit depth for constrained optimization problems.”  Algorithms 2021, 14, 294. 

18. Herrman, R. and van Hintum, P.  “The (t,r) broadcast domination number of some regular graphs,” Discrete Applied Mathematics, Vol. 289 (2021).

19. Herrman, R., Ostrowski, J., Humble, T.S., Siopsis, G. “Lower bounds on circuit depth of the quantum approximate optimization algorithm.” Quantum Inf Process 20, 59 (2021). 

20. Dvořák, V., Herrman, R., and van Hintum, P. “The eternal game chromatic number of random graphs,” European Journal of Combinatorics. (2021)

21. Herrman, R. and Humble, T.S.  “Continuous-time quantum walks on dynamic graphs,” Phys. Rev. A 100, 012306 (2019).

Pre-prints

Underline denotes student or postdoc authors.

1. Atallah, M., Ostrowski, J., & Herrman, R. (2025). A mixed-integer program for circuit execution time minimization with precedence constraints. arXiv preprint arXiv:2504.09268. 

2. Gaidai, I., & Herrman, R. (2025). Decomposition of Sparse Amplitude Permutation Gates with Application to Preparation of Sparse Clustered Quantum States. arXiv preprint arXiv:2504.08705. 

3. Herrman, R., & Wisdom, G. (2024). Leaky forcing and resilience of Cartesian products of K_n. arXiv preprint arXiv:2411.03178. 

4. Gonzales, A., Herrman, R., Campbell, C., Gaidai, I., Liu, J., Tomesh, T., & Saleem, Z. H. (2024). Arbitrary State Preparation via Quantum Walks. arXiv preprint arXiv:2405.20273. 

5. Wilkie, A., Ostrowski, J., & Herrman, R. An angle rounding parameter initialization technique for ma-QAOA (2024). arXiv preprint arXiv:2404.10743. 

6. Brešar, B., Hedžet, J., & Herrman, R. (2024). Bootstrap percolation and P_3-hull number in direct products of graphs. arXiv preprint arXiv:2403.10957. 

7. Herrman, R. and Smith, Stephen G.Z. "Extending Grundy Domination to k-Grundy Domination."

8. Herrman, R. "Relating the multi-angle quantum approximate optimization algorithm and continuous-time quantum walks on dynamic graphs".

9.  Carlotti, A. and Herrman, R.  “Uniform bounds for non-negativity of the diffusion game”.