17 citations · 20 across the 5 of their papers we have counts for
5 papers
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…
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…
Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study
Eleanor G. Rieffel, Ata Akbari Asanjan, M. Sohaib Alam +20
Quantum computing is one of the most enticing computational paradigms with the potential to revolutionize diverse areas of future-generation computational systems. While quantum co…
Measurement-Based Quantum Approximate Optimization
Tobias Stollenwerk, Stuart Hadfield
Parameterized quantum circuits are attractive candidates for potential quantum advantage in the near term and beyond. At the same time, as quantum computing hardware not only conti…
Iterative Quantum Algorithms for Maximum Independent Set: A Tale of Low-Depth Quantum Algorithms
Lucas T. Brady, Stuart Hadfield
Quantum algorithms have been widely studied in the context of combinatorial optimization problems. While this endeavor can often analytically and practically achieve quadratic spee…