1 citations · 1 across the 2 of their papers we have counts for
6 papers
Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis
Michael J. Bremner, Zhengfeng Ji, Xingjian Li +2
We study a parameterized version of the local Hamiltonian problem, called the weighted local Hamiltonian problem, where the relevant quantum states are superpositions of computatio…
Quantum Parameterized Complexity
Michael J. Bremner, Zhengfeng Ji, Ryan L. Mann +3
Parameterized complexity theory was developed in the 1990s to enrich the complexity-theoretic analysis of problems that depend on a range of parameters. In this paper we establish…
On the Universality of the Quantum Approximate Optimization Algorithm
Mauro E. S. Morales, Jacob Biamonte, Zoltán Zimborás
The quantum approximate optimization algorithm (QAOA) is considered to be one of the most promising approaches towards using near-term quantum computers for practical application.…
Reachability Deficits in Quantum Approximate Optimization
V. Akshay, H. Philathong, M. E. S. Morales +1
The quantum approximate optimization algorithm (QAOA) has rapidly become a cornerstone of contemporary quantum algorithm development. Despite a growing range of applications, only…
Entanglement Scaling in Quantum Advantage Benchmarks
Jacob D. Biamonte, Mauro E. S. Morales, Dax Enshan Koh
A contemporary technological milestone is to build a quantum device performing a computational task beyond the capability of any classical computer, an achievement known as quantum…
Variationally Learning Grover's Quantum Search Algorithm
Mauro E. S. Morales, Timur Tlyachev, Jacob Biamonte
Given a parameterized quantum circuit such that a certain setting of these real-valued parameters corresponds to Grover's celebrated search algorithm, can a variational algorithm r…