Lewis W. Anderson

Lewis W. Anderson

Auto-generated profile, based on publicly available information

Lewis W. Anderson

Clarendon Laboratory, University of Oxford, Parks Road, Oxford OX1 3PU, United Kingdom

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
6 June 2022 in Physical Review A
Verified
Journal Article
Closed access
PDF file
LALewis W. Anderson
Lewis W. Anderson
MKMartin Kiffner
Martin Kiffner
PBPanagiotis Kl. Barkoutsos
Panagiotis Kl. Barkoutsos
ITIvano Tavernelli
Ivano Tavernelli
JCJason Crain
Jason Crain
DJDieter Jaksch
Dieter Jaksch
Variational quantum algorithms (VQAs) are increasingly being applied in simulations of strongly bound (covalently bonded) systems using full molecular orbital basis representations. The application of quantum computers to the weakly bound intermolecular and noncovalently bonded regime, however, has remained largely unexplored. In this work, we develop a coarse-grained representation of the electronic response that is ideally suited for determining the ground state of weakly interacting molecules using a VQA. We require qubit numbers that grow linearly with the number of molecules and derive scaling behavior for the number of circuits and measurements required, which compare favorably to traditional variational quantum eigensolver methods. We demonstrate our method on IBM superconducting quantum processors and show its capability to resolve the dispersion energy as a function of separation for a pair of nonpolar molecules—thereby establishing a means by which quantum computers can model Van der Waals interactions directly from zero-point quantum fluctuations. Within this coarse-grained approximation, we conclude that current-generation quantum hardware is capable of probing energies in this weakly bound but nevertheless chemically ubiquitous and biologically important regime. Finally, we perform experiments on simulated and real quantum computers for systems of three, four, and five oscillators as well as oscillators with anharmonic onsite binding potentials; the consequences of the latter are unexamined in large systems using classical computational methods but can be incorporated here with low computational overhead.

26 January 2026 in Physical Review Research
Verified
Journal Article
Open access
BJBen Jaderberg
Ben Jaderberg
GPGeorge Pennington
George Pennington
KMKate V. Marshall
Kate V. Marshall
LALewis W. Anderson
Lewis W. Anderson
AAAbhishek Agarwal
Abhishek Agarwal
JCJason Crain
Jason Crain
Preparing matrix product states (MPSs) on quantum computers is an essential routine in the simulation of many-body physics. However, widely used schemes based on staircase circuits are often too deep to execute on current hardware. Here, we demonstrate that MPSs with short-range correlations can be prepared with shallow circuits by leveraging heuristics from approximate quantum compiling (AQC). We achieve this with ADAPT-AQC, an adaptive-ansatz preparation algorithm, and introduce a generalized initialization procedure for the existing AQC-Tensor algorithm. We first compare these methods for the task of preparing a molecular electronic structure ground state. We then use them to prepare an antiferromagnetic (AFM) ground state of the 50-site Heisenberg XXZ spin chain near the AFM-XY phase boundary. Through the execution of circuits with up to 59 depth and 1251 gates, we perform a global quench and observe the relaxation of magnetic ordering in a parameter regime previously inaccessible due to deep ground-state preparation circuits. Our results demonstrate how the integration of quantum and classical resources can push the boundary of what can be studied on quantum computers.

25 March 2025 in Quantum
Verified
Journal Article
Open access
PDF file
LALewis W. Anderson
Lewis W. Anderson
MKMartin Kiffner
Martin Kiffner
TOTom O'Leary
Tom O'Leary
JCJason Crain
Jason Crain
DJDieter Jaksch
Dieter Jaksch
Computing vacuum states of lattice gauge theories (LGTs) containing fermionic degrees of freedom can present significant challenges for classical computation using Monte-Carlo methods. Quantum algorithms may offer a pathway towards more scalable computation of groundstate properties of LGTs. However, a comprehensive understanding of the quantum computational resources required for such a problem is thus far lacking. In this work, we investigate using the quantum subspace expansion (QSE) algorithm to compute the groundstate of the Schwinger model, an archetypal LGT describing quantum electrodynamics in one spatial dimension. We perform numerical simulations, including the effect of measurement noise, to extrapolate the resources required for the QSE algorithm to achieve a desired accuracy for a range of system sizes. Using this, we present a full analysis of the resources required to compute LGT vacuum states using a quantum algorithm using qubitization within a fault tolerant framework. We develop of a novel method for performing qubitization of a LGT Hamiltonian based on a 'linear combination of unitaries' (LCU) approach. The cost of the corresponding block encoding operation scales as O~(N) with system size N. Including the corresponding prefactors, our method reduces the gate cost by multiple orders of magnitude when compared to previous LCU methods for the QSE algorithm, which scales as O~(N2) when applied to the Schwinger model. While the qubit and single circuit T-gate cost resulting from our resource analysis is appealing to early fault-tolerant implementation, we find that the number of shots required to avoid numerical instability within the QSE procedure must be significantly reduced in order to improve the feasibility of the methodology we consider and discuss how this might be achieved.

5 May 2025 in Quantum
Verified
Journal Article
Open access
PDF file
TOTom O'Leary
Tom O'Leary
LALewis W. Anderson
Lewis W. Anderson
DJDieter Jaksch
Dieter Jaksch
MKMartin Kiffner
Martin Kiffner
We present an iterative generalisation of the quantum subspace expansion algorithm used with a Krylov basis. The iterative construction connects a sequence of subspaces via their lowest energy states. Diagonalising a Hamiltonian in a given Krylov subspace requires the same quantum resources in both the single step and sequential cases. We propose a variance-based criterion for determining a good iterative sequence and provide numerical evidence that these good sequences display improved numerical stability over a single step in the presence of finite sampling noise. Implementing the generalisation requires additional classical processing with a polynomial overhead in the subspace dimension. By exchanging quantum circuit depth for additional measurements the quantum subspace expansion algorithm appears to be an approach suited to near term or early error-corrected quantum hardware. Our work suggests that the numerical instability limiting the accuracy of this approach can be substantially alleviated in a parameter-free way.

31 July 2025 in arXiv
Verified
Preprint
Open access
PDF file
DMD. A. Millar
D. A. Millar
LAL. W. Anderson
L. W. Anderson
EAE. Altamura
E. Altamura
OWO. Wallis
O. Wallis
MSM. E. Sahin
M. E. Sahin
STS. J. Thomson
S. J. Thomson
Excited states of many-body quantum systems play a key role in a wide range of physical and chemical phenomena. Unlike ground states, for which many efficient variational techniques exist, there are few ways to systematically construct excited states of generic quantum systems on either classical or quantum hardware. To address this challenge, we introduce a general approach that allows us to obtain arbitrary eigenstates of quantum systems at a given energy. By combining the shift-invert mechanism with imaginary time evolution, we are able to avoid explicit inversion of the Hamiltonian and construct excited eigenstates of large many-body quantum systems. We demonstrate the technique classically by applying it to large disordered spin chains. Based on this approach, we propose a hybrid scheme suitable for near-future quantum hardware.

3 June 2026 in Physical Review Research
Verified
Journal Article
Open access
DMD. A. Millar
D. A. Millar
LAL. W. Anderson
L. W. Anderson
EAE. Altamura
E. Altamura
OWO. Wallis
O. Wallis
MSM. E. Sahin
M. E. Sahin
STS. J. Thomson
S. J. Thomson
Excited states of many-body quantum systems play a key role in a wide range of physical and chemical phenomena. Despite this, there is a notable lack of scalable algorithms capable of preparing highly excited eigenstates. To address this challenge, we introduce a general approach that directly targets eigenstates near a chosen energy, applicable to both classical and quantum simulation frameworks. Our approach combines the shift-invert mechanism with imaginary time evolution, enabling the construction of excited states of large many-body quantum systems. We demonstrate the technique classically by computing midspectrum eigenstates of disordered spin chains with up to L = 128 sites. Based on this, we propose a hybrid scheme compatible with near-term quantum hardware.