1 citations · 1 across the 1 of their papers we have counts for
4 papers
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…
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…
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…
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…