4 citations · 5 across the 6 of their papers we have counts for
6 papers · 1 filter
Iterative warm-start optimization with quantum imaginary time evolution
Phillip C. Lotshaw, Titus Morris, Stuart Hadfield +1
Approximate combinatorial optimization is a promising use case for quantum computers. The quantum optimization algorithms often employ a fixed ansatz that evolves an unbiased initi…
Quantum DPLL and Generalized Constraints in Iterative Quantum Algorithms
Lucas T. Brady, Stuart Hadfield
Too often, quantum computer scientists seek to create new algorithms entirely fresh from new cloth when there are extensive and optimized classical algorithms that can be generaliz…
FOCQS: Feedback Optimally Controlled Quantum States
Lucas T. Brady, Stuart Hadfield
Quantum optimization, both for classical and quantum functions, is one of the most well-studied applications of quantum computing, but recent trends have relied on hybrid methods t…
Highly-efficient quantum Fourier transformations for some nonabelian groups
Edison M. Murairi, M. Sohaib Alam, Henry Lamm +2
Quantum Fourier transformations are an essential component of many quantum algorithms, from prime factoring to quantum simulation. While the standard abelian QFT is well-studied, i…
Scattering Processes from Quantum Simulation Algorithms for Scalar Field Theories
Andrew Hardy, Priyanka Mukhopadhyay, M. Sohaib Alam +8
We provide practical simulation methods for scalar field theories on a quantum computer that yield improved asymptotics as well as concrete gate estimates for the simulation and ph…
Imposing Constraints on Driver Hamiltonians and Mixing Operators: From Theory to Practical Implementation
Hannes Leipold, Federico M. Spedalieri, Stuart Hadfield +1
Driver Hamiltonians and Mixing Operators that satisfy constraints is an important part of ansatz construction for many quantum algorithms. In this manuscript, we give general algeb…