4 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…
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…