Morales, Mauro E. S.
University of Maryland, College Park
4 papers on CoChatORCID 0000-0003-3222-3623
Most cited papers
- Verified
Reachability Deficits in Quantum Approximate Optimization
Akshay, V., Philathong, H., Morales, M. E. S., & Biamonte, J. D. (2020) · Physical Review Letters
Quantum Computing Algorithms and ArchitectureQuantum many-body systems
Cited by 151
- Verified
On the Universality of the Quantum Approximate Optimization Algorithm
Morales, M. E. S., Biamonte, J., & Zimborás, Z. (2019) · arXiv
Quantum Computing Algorithms and ArchitectureQuantum many-body systems
Cited by 95
- Verified
Variational learning of Grover's quantum search algorithm
Morales, M. E. S., Tlyachev, T., & Biamonte, J. (2018) · Physical Review A
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 57
- Verified
Assessing quantum and classical approaches to combinatorial optimization: Testing quadratic speed-ups for heuristic algorithms
Costa, P. C. S., Morales, M. E. S., An, D., & Sanders, Y. R. (2025) · Physical Review A
Quantum Computing Algorithms and ArchitectureQuantum many-body systems
Cited by 0
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free