Nicholas J. Mayhall

Nicholas J. Mayhall

Auto-generated profile, based on publicly available information

Nicholas J. Mayhall

Department of Chemistry

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
8 July 2019 in Nature Communications
Verified
Journal Article
Open access
PDF file
HGHarper R. Grimsley
Harper R. Grimsley
SESophia E. Economou
Sophia E. Economou
EBEdwin Barnes
Edwin Barnes
NMNicholas J. Mayhall
Nicholas J. Mayhall
Quantum simulation of chemical systems is one of the most promising near-term applications of quantum computers. The variational quantum eigensolver, a leading algorithm for molecular simulations on quantum hardware, has a serious limitation in that it typically relies on a pre-selected wavefunction ansatz that results in approximate wavefunctions and energies. Here we present an arbitrarily accurate variational algorithm that, instead of fixing an ansatz upfront, grows it systematically one operator at a time in a way dictated by the molecule being simulated. This generates an ansatz with a small number of parameters, leading to shallow-depth circuits. We present numerical simulations, including for a prototypical strongly correlated molecule, which show that our algorithm performs much better than a unitary coupled cluster approach, in terms of both circuit depth and chemical accuracy. Our results highlight the potential of our adaptive algorithm for exact simulations with present-day and near-term quantum hardware.

23 August 2021 in The Journal of Chemical Physics
Verified
Journal Article
Open access
PDF file
EEEvgeny Epifanovsky
Evgeny Epifanovsky
AGAndrew T. B. Gilbert
Andrew T. B. Gilbert
XFXintian Feng
Xintian Feng
JLJoonho Lee
Joonho Lee
YMYuezhi Mao
Yuezhi Mao
AKAnna I. Krylov
Anna I. Krylov
This article summarizes technical advances contained in the fifth major release of the Q-Chem quantum chemistry program package, covering developments since 2015. A comprehensive library of exchange–correlation functionals, along with a suite of correlated many-body methods, continues to be a hallmark of the Q-Chem software. The many-body methods include novel variants of both coupled-cluster and configuration-interaction approaches along with methods based on the algebraic diagrammatic construction and variational reduced density-matrix methods. Methods highlighted in Q-Chem 5 include a suite of tools for modeling core-level spectroscopy, methods for describing metastable resonances, methods for computing vibronic spectra, the nuclear–electronic orbital method, and several different energy decomposition analysis techniques. High-performance capabilities including multithreaded parallelism and support for calculations on graphics processing units are described. Q-Chem boasts a community of well over 100 active academic developers, and the continuing evolution of the software is supported by an “open teamware” model and an increasingly modular design.

28 January 2020 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
BGBryan T. Gard
Bryan T. Gard
LZLinghua Zhu
Linghua Zhu
GBGeorge S. Barron
George S. Barron
NMNicholas J. Mayhall
Nicholas J. Mayhall
SESophia E. Economou
Sophia E. Economou
EBEdwin Barnes
Edwin Barnes
The variational quantum eigensolver is one of the most promising approaches for performing chemistry simulations using noisy intermediate-scale quantum (NISQ) processors. The efficiency of this algorithm depends crucially on the ability to prepare multi-qubit trial states on the quantum processor that either include, or at least closely approximate, the actual energy eigenstates of the problem being simulated while avoiding states that have little overlap with them. Symmetries play a central role in determining the best trial states. Here, we present efficient state preparation circuits that respect particle number, total spin, spin projection, and time-reversal symmetries. These circuits contain the minimal number of variational parameters needed to fully span the appropriate symmetry subspace dictated by the chemistry problem while avoiding all irrelevant sectors of Hilbert space. We show how to construct these circuits for arbitrary numbers of orbitals, electrons, and spin quantum numbers, and we provide explicit decompositions and gate counts in terms of standard gate sets in each case. We test our circuits in quantum simulations of the $${H}_{2}$$ H 2 and $$LiH$$ L i H molecules and find that they outperform standard state preparation methods in terms of both accuracy and circuit depth.

16 December 2019 in Journal of Chemical Theory and Computation
Verified
Journal Article
Closed access
HGHarper R. Grimsley
Harper R. Grimsley
DCDaniel Claudino
Daniel Claudino
SESophia E. Economou
Sophia E. Economou
EBEdwin Barnes
Edwin Barnes
NMNicholas J. Mayhall
Nicholas J. Mayhall

1 March 2023 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
HGHarper R. Grimsley
Harper R. Grimsley
GBGeorge S. Barron
George S. Barron
EBEdwin Barnes
Edwin Barnes
SESophia E. Economou
Sophia E. Economou
NMNicholas J. Mayhall
Nicholas J. Mayhall
Variational quantum eigensolvers (VQEs) represent a powerful class of hybrid quantum-classical algorithms for computing molecular energies. Various numerical issues exist for these methods, however, including barren plateaus and large numbers of local minima. In this work, we consider the Adaptive, Problem-Tailored Variational Quantum Eiegensolver (ADAPT-VQE) ansätze, and examine how they are impacted by these local minima. We find that while ADAPT-VQE does not remove local minima, the gradient-informed, one-operator-at-a-time circuit construction accomplishes two things: First, it provides an initialization strategy that can yield solutions with over an order of magnitude smaller error compared to random initialization, and which is applicable in situations where chemical intuition cannot help with initialization, i.e., when Hartree-Fock is a poor approximation to the ground state. Second, even if an ADAPT-VQE iteration converges to a local trap at one step, it can still “burrow” toward the exact solution by adding more operators, which preferentially deepens the occupied trap. This same mechanism helps highlight a surprising feature of ADAPT-VQE: It should not suffer optimization problems due to barren plateaus and random initialization. Even if such barren plateaus appear in the parameter landscape, our analysis suggests that ADAPT-VQE avoids such regions by design.

7 March 2024 in Physical Review Research
Verified
Journal Article
Open access
PDF file
PAPanagiotis G. Anastasiou
Panagiotis G. Anastasiou
YCYanzhu Chen
Yanzhu Chen
NMNicholas J. Mayhall
Nicholas J. Mayhall
EBEdwin Barnes
Edwin Barnes
SESophia E. Economou
Sophia E. Economou
Adaptive quantum variational algorithms are particularly promising for simulating strongly correlated systems on near-term quantum hardware, but they are not yet viable due, in large part, to the severe coherence time limitations on current devices. In this paper, we introduce an algorithm called TETRIS-ADAPT-VQE (tiling efficient trial circuits with rotations implemented simultaneously adaptive derivative-assembled problem-tailored Ansatz variational quantum eigensolver), which iteratively builds up variational Ansätze a few operators at a time in a way dictated by the problem being simulated. This algorithm is a modified version of the ADAPT-VQE algorithm, in which the one-operator-at-a-time rule is lifted to allow for the addition of multiple operators with disjoint supports in each iteration. TETRIS-ADAPT-VQE results in denser but significantly shallower circuits, without increasing the number of controlled-not gates or variational parameters. Its advantage over the original algorithm in terms of circuit depths increases with the system size. Moreover, the expensive step of measuring the energy gradient with respect to each candidate unitary at each iteration is performed only a fraction of the time compared with ADAPT-VQE. These improvements bring us closer to the goal of demonstrating a practical quantum advantage on quantum hardware.