Stuart Hadfield

Dr. Stuart Hadfield


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 February 2019 in Algorithms
Verified
Journal Article
Open access
PDF file
SHStuart Hadfield
Stuart Hadfield
ZWZhihui Wang
Zhihui Wang
BOBryan O’gorman
Bryan O’gorman
EREleanor Rieffel
Eleanor Rieffel
DVDavide Venturelli
Davide Venturelli
RBRupak Biswas
Rupak Biswas
The next few years will be exciting as prototype universal quantum processors emerge, enabling the implementation of a wider variety of algorithms. Of particular interest are quantum heuristics, which require experimentation on quantum hardware for their evaluation and which have the potential to significantly expand the breadth of applications for which quantum computers have an established advantage. A leading candidate is Farhi et al.’s quantum approximate optimization algorithm, which alternates between applying a cost function based Hamiltonian and a mixing Hamiltonian. Here, we extend this framework to allow alternation between more general families of operators. The essence of this extension, the quantum alternating operator ansatz, is the consideration of general parameterized families of unitaries rather than only those corresponding to the time evolution under a fixed local Hamiltonian for a time specified by the parameter. This ansatz supports the representation of a larger, and potentially more useful, set of states than the original formulation, with potential long-term impact on a broad array of application areas. For cases that call for mixing only within a desired subspace, refocusing on unitaries rather than Hamiltonians enables more efficiently implementable mixers than was possible in the original framework. Such mixers are particularly useful for optimization problems with hard constraints that must always be satisfied, defining a feasible subspace, and soft constraints whose violation we wish to minimize. More efficient implementation enables earlier experimental exploration of an alternating operator approach, in the spirit of the quantum approximate optimization algorithm, to a wide variety of approximate optimization, exact optimization, and sampling problems. In addition to introducing the quantum alternating operator ansatz, we lay out design criteria for mixing operators, detail mappings for eight problems, and provide a compendium with brief descriptions of mappings for a diverse array of problems.

5 February 2018 in Physical Review A
Verified
Journal Article
Open access
PDF file
ZWZhihui Wang
Zhihui Wang
SHStuart Hadfield
Stuart Hadfield
ZJZhang Jiang
Zhang Jiang
EREleanor G. Rieffel
Eleanor G. Rieffel
Farhi et al. recently proposed a class of quantum algorithms, the quantum approximate optimization algorithm (QAOA), for approximately solving combinatorial optimization problems (E. Farhi et al., arXiv:1411.4028; arXiv:1412.6062; arXiv:1602.07674). A level-p QAOA circuit consists of p steps; in each step a classical Hamiltonian, derived from the cost function, is applied followed by a mixing Hamiltonian. The 2p times for which these two Hamiltonians are applied are the parameters of the algorithm, which are to be optimized classically for the best performance. As p increases, parameter optimization becomes inefficient due to the curse of dimensionality. The success of the QAOA approach will depend, in part, on finding effective parameter-setting strategies. Here we analytically and numerically study parameter setting for the QAOA applied to MaxCut. For the level-1 QAOA, we derive an analytical expression for a general graph. In principle, expressions for higher p could be derived, but the number of terms quickly becomes prohibitive. For a special case of MaxCut, the “ring of disagrees,” or the one-dimensional antiferromagnetic ring, we provide an analysis for an arbitrarily high level. Using a fermionic representation, the evolution of the system under the QAOA translates into quantum control of an ensemble of independent spins. This treatment enables us to obtain analytical expressions for the performance of the QAOA for any p. It also greatly simplifies the numerical search for the optimal values of the parameters. By exploring symmetries, we identify a lower-dimensional submanifold of interest; the search effort can be accordingly reduced. This analysis also explains an observed symmetry in the optimal parameter values. Further, we numerically investigate the parameter landscape and show that it is a simple one in the sense of having no local optima.

28 October 2024 in Nature Reviews Physics
Verified
Journal Article
Closed access
PDF file
AAAmira Abbas
Amira Abbas
AAAndris Ambainis
Andris Ambainis
BABrandon Augustino
Brandon Augustino
ABAndreas Bärtschi
Andreas Bärtschi
HBHarry Buhrman
Harry Buhrman
CZChrista Zoufal
Christa Zoufal

28 August 2020 in IOP SciNotes
Verified
Journal Article
Open access
JMJeffrey Marshall
Jeffrey Marshall
FWFilip Wudarski
Filip Wudarski
SHStuart Hadfield
Stuart Hadfield
THTad Hogg
Tad Hogg
Recently Xue et al (2019 arXiv:1909.02196) demonstrated numerically that QAOA performance varies as a power law in the amount of noise under certain physical noise models. In this short note, we provide a deeper analysis of the origin of this behavior. In particular, we provide an approximate closed form equation for the fidelity and expected cost in terms of the noise rate, system size, and circuit depth. As an application, we show these equations accurately model the trade off between larger circuits which attain better expected cost values, at the expense of greater degradation due to noise.

2 June 2022 in Physical Review D
Verified
Journal Article
Closed access
PDF file
MAM. Sohaib Alam
M. Sohaib Alam
SHStuart Hadfield
Stuart Hadfield
HLHenry Lamm
Henry Lamm
ALAndy C. Y. Li
Andy C. Y. Li
SCSQMS Collaboration
SQMS Collaboration
We describe the simulation of dihedral gauge theories on digital quantum computers. The non-Abelian discrete gauge group DN—the dihedral group—serves as an approximation to U(1)×Z2 lattice gauge theory. In order to carry out such a lattice simulation, we detail the construction of efficient quantum circuits to realize basic primitives including the non-Abelian Fourier transform over DN, the trace operation, and the group multiplication and inversion operations. For each case the required quantum resources scale linearly or as low-degree polynomials in n=logN. We experimentally benchmark our gates on the Rigetti Aspen-9 quantum processor for the case of D4. The estimated fidelity of all D4 gates was found to exceed 80%.

10 November 2023 in Science Advances
Verified
Journal Article
Closed access
MDMaxime Dupont
Maxime Dupont
BEBram Evert
Bram Evert
MHMark J. Hodson
Mark J. Hodson
BSBhuvanesh Sundar
Bhuvanesh Sundar
SJStephen Jeffrey
Stephen Jeffrey
MRMatthew J. Reagor
Matthew J. Reagor
Combinatorial optimization is a broadly attractive area for potential quantum advantage, but no quantum algorithm has yet made the leap. Noise in quantum hardware remains a challenge, and more sophisticated quantum-classical algorithms are required to bolster their performance. Here, we introduce an iterative quantum heuristic optimization algorithm to solve combinatorial optimization problems. The quantum algorithm reduces to a classical greedy algorithm in the presence of strong noise. We implement the quantum algorithm on a programmable superconducting quantum system using up to 72 qubits for solving paradigmatic Sherrington-Kirkpatrick Ising spin glass problems. We find the quantum algorithm systematically outperforms its classical greedy counterpart, signaling a quantum enhancement. Moreover, we observe an absolute performance comparable with a state-of-the-art semidefinite programming method. Classical simulations of the algorithm illustrate that a key challenge to reaching quantum advantage remains improving the quantum device characteristics.