154 citations · 357 across the 11 of their papers we have counts for
11 papers
The Hidden Subgroup Problem in Semidirect Products and Quasi-Hamiltonian Groups
Mauro E. S. Morales
Several early quantum algorithms, including Simon's algorithm and Shor's period-finding are instances of the hidden subgroup problem (HSP) over finite abelian groups. No polynomial…
Cheat-Penalised Quantum Weak Coin-Flipping
Atul Singh Arora, Carl A. Miller, Mauro E. S. Morales +1
Coin-flipping is a fundamental task in two-party cryptography where two remote mistrustful parties wish to generate a shared uniformly random bit. While quantum protocols promising…
Efficiently learning fermionic unitaries with few non-Gaussian gates
Sharoon Austin, Mauro E. S. Morales, Alexey Gorshkov
Fermionic Gaussian unitaries are known to be efficiently learnable and simulatable. In this paper, we present a learning algorithm that learns an -mode circuit containing pa…
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…
Selection and improvement of product formulae for best performance of quantum simulation
Mauro E. S. Morales, Pedro C. S. Costa, Giacomo Pantaleoni +3
Quantum algorithms for simulation of Hamiltonian evolution are often based on product formulae. The fractal methods give a systematic way to find arbitrarily high-order product for…
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…
Fermion Sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states
Michał Oszmaniec, Ninnat Dangniam, Mauro E. S. Morales +1
Fermionic Linear Optics (FLO) is a restricted model of quantum computation which in its original form is known to be efficiently classically simulable. We show that, when initializ…
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…