Dylan Herman
Orcid: 0000-0002-8721-7848
According to our database1,
Dylan Herman
authored at least 15 papers
between 2021 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Provably faster randomized and quantum algorithms for k-means clustering via uniform sampling.
CoRR, April, 2025
CoRR, April, 2025
2024
Quantum, January, 2024
Generalized Short Path Algorithms: Towards Super-Quadratic Speedup over Markov Chain Search for Combinatorial Optimization.
CoRR, 2024
Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era.
Proceedings of the 43rd IEEE/ACM International Conference on Computer-Aided Design, 2024
Proceedings of the 61st ACM/IEEE Design Automation Conference, 2024
2023
Code from "Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem".
Dataset, August, 2023
Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem.
CoRR, 2023
Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Portfolio Optimization.
CoRR, 2023
2022
Constrained Quantum Optimization for Extractive Summarization on a Trapped-ion Quantum Computer.
CoRR, 2022
2021
Proceedings of the IEEE/ACM International Conference On Computer Aided Design, 2021