Seguir
Rebekah Herrman
Rebekah Herrman
Assistant Professor, University of Tennessee
Dirección de correo verificada de utk.edu - Página principal
Título
Citado por
Citado por
Año
Multi-angle quantum approximate optimization algorithm
R Herrman, PC Lotshaw, J Ostrowski, TS Humble, G Siopsis
Scientific Reports 12 (1), 6781, 2022
1002022
Empirical performance bounds for quantum approximate optimization
PC Lotshaw, TS Humble, R Herrman, J Ostrowski, G Siopsis
arXiv preprint arXiv:2102.06813, 2021
582021
Impact of Graph Structures for QAOA on MaxCut
R Herrman, L Treffert, J Ostrowski, PC Lotshaw, TS Humble, G Siopsis
arXiv preprint arXiv:2102.05997, 2021
472021
Lower bounds on circuit depth of the quantum approximate optimization algorithm
R Herrman, J Ostrowski, TS Humble, G Siopsis
Quantum Information Processing 20, 1-17, 2021
40*2021
Scaling quantum approximate optimization on near-term hardware
PC Lotshaw, T Nguyen, A Santana, A McCaskey, R Herrman, J Ostrowski, ...
Scientific Reports 12 (1), 12388, 2022
392022
Continuous-time quantum walks on dynamic graphs
R Herrman, TS Humble
Physical Review A 100 (1), 012306, 2019
262019
Globally optimizing QAOA circuit depth for constrained optimization problems
R Herrman, L Treffert, J Ostrowski, PC Lotshaw, TS Humble, G Siopsis
Algorithms 14 (10), 294, 2021
252021
Approximate Boltzmann distributions in quantum approximate optimization
PC Lotshaw, G Siopsis, J Ostrowski, R Herrman, R Alam, S Powers, ...
Physical Review A 108 (4), 042411, 2023
192023
Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms
M Ponce, R Herrman, PC Lotshaw, S Powers, G Siopsis, T Humble, ...
Quantum Information Processing 24 (2), 60, 2025
142025
Multiangle qaoa does not always need all its angles
K Shi, R Herrman, R Shaydulin, S Chakrabarti, M Pistoia, J Larson
2022 IEEE/ACM 7th Symposium on Edge Computing (SEC), 414-419, 2022
142022
Performance analysis of multi-angle QAOA for
I Gaidai, R Herrman
Scientific Reports 14 (1), 18911, 2024
102024
Simplifying continuous-time quantum walks on dynamic graphs
R Herrman, TG Wong
Quantum Information Processing 21 (2), 54, 2022
82022
The (t, r) broadcast domination number of some regular graphs
R Herrman, P van Hintum
Discrete Applied Mathematics 289, 270-280, 2021
72021
Solving maxcut with quantum imaginary time evolution
R Alam, G Siopsis, R Herrman, J Ostrowski, PC Lotshaw, TS Humble
Quantum Information Processing 22 (7), 281, 2023
62023
Relating the multi-angle quantum approximate optimization algorithm and continuous-time quantum walks on dynamic graphs
R Herrman
arXiv preprint arXiv:2209.00415, 2022
52022
Quantum approximate optimization algorithm with random and subgraph phase operators
A Wilkie, I Gaidai, J Ostrowski, R Herrman
Physical Review A 110 (2), 022441, 2024
4*2024
The (d− 2)-leaky forcing number of Qd and ℓ-leaky forcing number of GP (n, 1)
R Herrman
Discrete Optimization 46, 100744, 2022
42022
Uniform bounds for non-negativity of the diffusion game
A Carlotti, R Herrman
arXiv preprint arXiv:1805.05932, 2018
42018
On the length of L-Grundy sequences
R Herrman, SGZ Smith
Discrete Optimization 45, 100725, 2022
32022
Arbitrary State Preparation via Quantum Walks
A Gonzales, R Herrman, C Campbell, I Gaidai, J Liu, T Tomesh, ...
2024 IEEE International Conference on Quantum Computing and Engineering (QCE …, 2024
22024
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20