Searcharxiv⌕ Search

arXiv subjects

Nicholas J. Mayhall

Publications and source records attributed to Nicholas J. Mayhall.

39 records · Page 3Linked to original sources

Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm

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$ and $LiH$ molecules and find that they outperform standard state preparation methods in terms of both accuracy and circuit depth.

quant-ph↗

An adaptive variational algorithm for exact molecular simulations on a quantum computer

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, this algorithm 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.

quant-ph↗

Negative exchange interactions in coupled few-electron quantum dots

It has been experimentally shown that negative exchange interactions can arise in a linear three-dot system when a two-electron double quantum dot is exchange coupled to a larger quantum dot containing on the order of one hundred electrons. The origin of this negative exchange can be traced to the larger quantum dot exhibiting a spin triplet-like rather than singlet-like ground state. Here, we show using a microscopic model based on the configuration interaction (CI) method that both triplet-like and singlet-like ground states are realized depending on the number of electrons. In the case of only four electrons, a full CI calculation reveals that triplet-like ground states occur for sufficiently large dots. These results hold for symmetric and asymmetric quantum dots in both Si and GaAs, showing that negative exchange interactions are robust in few-electron double quantum dots and do not require large numbers of electrons.

cond-mat.mes-hall↗