Stuart Hadfield
Columbia University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Stuart Hadfield.
Proceedings of the Second International Workshop on Post Moores Era Supercomputing | 2017
Stuart Hadfield; Zhihui Wang; Eleanor G. Rieffel; Bryan O'Gorman; Davide Venturelli; Rupak Biswas
Challenging computational problems arising in the practical world are frequently tackled by heuristic algorithms. Small universal quantum computers will emerge in the next year or two, enabling a substantial broadening of the types of quantum heuristics that can be investigated beyond quantum annealing. The immediate question is: what experiments should we prioritize that will give us insight into quantum heuristics? One leading candidate is the quantum approximate optimization algorithm (QAOA) metaheuristic. In this work, we provide a framework for designing QAOA circuits for a variety of combinatorial optimization problems with both hard constraints that must be met and soft constraints whose violation we wish to minimize. We work through a number of examples, and discuss design principles.
Quantum Information Processing | 2015
Stuart Hadfield; Anargyros Papageorgiou
Approximating ground and a fixed number of excited state energies, or equivalently low-order Hamiltonian eigenvalues, is an important but computationally hard problem. Typically, the cost of classical deterministic algorithms grows exponentially with the number of degrees of freedom. Under general conditions, and using a perturbation approach, we provide a quantum algorithm that produces estimates of a constant number
arXiv: Quantum Physics | 2018
Stuart Hadfield
arXiv: Quantum Physics | 2017
Stuart Hadfield; Zhihui Wang; Bryan O'Gorman; Eleanor G. Rieffel; Davide Venturelli; Rupak Biswas
j
Quantum Information & Computation | 2015
Mihir K. Bhaskar; Stuart Hadfield; Anargyros Papageorgiou; Iasonas Petras
Physical Review A | 2018
Zhihui Wang; Stuart Hadfield; Zhang Jiang; Eleanor G. Rieffel
j of different low-order eigenvalues. The algorithm relies on a set of trial eigenvectors, whose construction depends on the particular Hamiltonian properties. We illustrate our results by considering a special case of the time-independent Schrödinger equation with
New Journal of Physics | 2018
Stuart Hadfield; Anargyros Papageorgiou
arXiv: Quantum Physics | 2018
Stuart Hadfield
d
Bulletin of the American Physical Society | 2018
Eleanor G. Rieffel; Stuart Hadfield; Zhihui Wang; Bryan O'Gorman; Davide Venturelli
Bulletin of the American Physical Society | 2017
Stuart Hadfield; Anargyros Papageorgiou
d degrees of freedom. Our algorithm computes estimates of a constant number