Mauro E.S. Morales
Mauro E.S. Morales
Postdoctoral Fellow, University of Maryland
Verified email at
Cited by
Cited by
Reachability deficits in quantum approximate optimization
V Akshay, H Philathong, MES Morales, JD Biamonte
Physical review letters 124 (9), 090504, 2020
On the universality of the quantum approximate optimization algorithm
MES Morales, JD Biamonte, Z Zimborás
Quantum Information Processing 19 (9), 1-26, 2020
Variational learning of Grover's quantum search algorithm
MES Morales, T Tlyachev, J Biamonte
Physical Review A 98 (6), 062333, 2018
Fermion sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states
M Oszmaniec, N Dangniam, MES Morales, Z Zimborás
PRX Quantum 3 (2), 020328, 2022
Entanglement scaling in quantum advantage benchmarks
JD Biamonte, MES Morales, DE Koh
Physical Review A 101 (1), 012349, 2020
Greatly improved higher-order product formulae for quantum simulation
MES Morales, P Costa, DK Burgarth, YR Sanders, DW Berry
arXiv preprint arXiv:2210.15817, 2022
Quantum supremacy lower bounds by entanglement scaling
J Biamonte, MES Morales, DE Koh
arXiv preprint arXiv:1808.00460, 2018
Further improving quantum algorithms for nonlinear differential equations via higher-order methods and rescaling
P Costa, P Schleich, MES Morales, DW Berry
arXiv preprint arXiv:2312.09518, 2023
Quantum Parameterized Complexity
MJ Bremner, Z Ji, RL Mann, L Mathieson, MES Morales, ATE Shaw
arXiv preprint arXiv:2203.08002, 2022
Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis
MJ Bremner, Z Ji, X Li, L Mathieson, MES Morales
arXiv preprint arXiv:2211.05325, 2022
Robust quantum computational advantage using fermionic linear optics and magic input states
M l Oszmaniec, N Dangniam, MES Morales, Z Zimborás
Science 369 (6507), 1084-1089, 2020
Entanglement Scaling in Quantum Supremacy Benchmarks
MES Morales, DE Koh, JD Biamonte
arXiv preprint arXiv:1808.00460, 2018
The system can't perform the operation now. Try again later.
Articles 1–12