Ashley Montanaro

University of Bristol — United Kingdom

Computer Science · Physical Sciences

31h-index5.5kcitations169works5.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Quantum Computing Algorithms and Architecture(129), Quantum Information and Cryptography(69), Quantum Mechanics and Applications(24), Quantum and electron transport phenomena(21), Complexity and Algorithms in Graphs(21)

Publications169 total

From Quantum Computing Algorithms to Human Health Applications: Tunnelling through the Disciplinary Barriers
2025Open Access
Programmable digital quantum simulation of 2D Fermi-Hubbard dynamics using 72 superconducting qubits
arXiv (Cornell University)·2025Open Access
Testing Quantum Satisfiability
Communications in Mathematical Physics·2025Open Access
Benchmarking a wide range of optimisers for solving the Fermi–Hubbard model using the variational quantum eigensolver
Quantum Science and Technology·2025Open Access
Challenges and Advances in the Simulation of Targeted Covalent Inhibitors Using Quantum Computing
The Journal of Physical Chemistry Letters·2025Open Access
Unveiling quantum phase transitions from traps in variational quantum algorithms
npj Quantum Information·2025· 3 citedOpen Access
Challenges and Advances in the Simulation of Targeted Covalent Inhibitors Using Quantum Computing
2025Open Access
Testing multipartite productness is easier than testing bipartite productness
Journal of Mathematical Physics·2025Open Access
Efficient and practical Hamiltonian simulation from time-dependent product formulas
Nature Communications·2025· 8 citedOpen Access
Quantum-enhanced belief propagation for LDPC decoding
arXiv (Cornell University)·2024· 1 citedOpen Access
Applying the quantum approximate optimization algorithm to general constraint satisfaction problems
arXiv (Cornell University)·2024Open Access
Benchmarking a wide range of optimisers for solving the Fermi-Hubbard model using the variational quantum eigensolver
arXiv (Cornell University)·2024Open Access
Quantum speedups in solving near-symmetric optimization problems by low-depth QAOA
arXiv (Cornell University)·2024· 2 citedOpen Access
Low-degree approximation of QAC$^0$ circuits
arXiv (Cornell University)·2024Open Access
Quantum Phase Estimation without Controlled Unitaries
arXiv (Cornell University)·2024· 1 citedOpen Access
Solving Boolean Satisfiability Problems With The Quantum Approximate Optimization Algorithm
PRX Quantum·2024· 32 citedOpen Access
Testing multipartite productness is easier than testing bipartite productness
arXiv (Cornell University)·2024Open Access
Quantum and Classical Query Complexities of Functions of Matrices
2024· 4 citedOpen Access
Sketching phase diagrams using low-depth variational quantum algorithms
Quantum Science and Technology·2024· 5 citedOpen Access
Data for "Efficient and practical Hamiltonian simulation from time-dependent product formulas"
arXiv (Cornell University)·2024· 2 citedOpen Access
page 1 of 9Next →

Frequent Co-authors

Toby S. Cubitt(6), Aram W. Harrow(4), Stasja Stanisic(4), Noah Linden(4), Dan Shepherd(3), Lana Mineh(3), Tobias J. Osborne(3), Sami Boulebnane(3), Roberto Minutolo(3), Vincenzo Bellizzi(3), Giuseppe Conte(3), Luca De Nicola(3), Bruno Cianciaruso(3), Michael J. Bremner(2), Sam Pallister(2), Raphaël Clifford(2), Stephen Piddock(2), Andreas Winter(2), Jan Lukas Bosse(2), Filippo Maria Gambetta(2)