Richard Meister

Richard Meister

Auto-generated profile, based on publicly available information

Richard Meister

Department of Computing, Imperial College London, London, UK

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
3 March 2023 in Science Advances
Verified
Journal Article
Closed access
HCHans Hon Sang Chan
Hans Hon Sang Chan
RMRichard Meister
Richard Meister
TJTyson Jones
Tyson Jones
DTDavid P. Tew
David P. Tew
SBSimon C. Benjamin
Simon C. Benjamin
First-quantized, grid-based methods for chemistry modeling are a natural and elegant fit for quantum computers. However, it is infeasible to use today’s quantum prototypes to explore the power of this approach because it requires a substantial number of near-perfect qubits. Here, we use exactly emulated quantum computers with up to 36 qubits to execute deep yet resource-frugal algorithms that model 2D and 3D atoms with single and paired particles. A range of tasks is explored, from ground state preparation and energy estimation to the dynamics of scattering and ionization; we evaluate various methods within the split-operator QFT (SO-QFT) Hamiltonian simulation paradigm, including protocols previously described in theoretical papers and our own techniques. While we identify certain restrictions and caveats, generally, the grid-based method is found to perform very well; our results are consistent with the view that first-quantized paradigms will be dominant from the early fault-tolerant quantum computing era onward.

17 March 2025 in PRX Quantum
Verified
Journal Article
Open access
HCHans Hon Sang Chan
Hans Hon Sang Chan
RMRichard Meister
Richard Meister
MGMatthew L. Goh
Matthew L. Goh
BKBálint Koczor
Bálint Koczor
We present shadow spectroscopy as a simulator-agnostic quantum algorithm for estimating energy gaps using very few circuit repetitions (shots) and no extra resources (ancilla qubits) beyond performing time evolution and measurements. The approach builds on the fundamental feature that every observable property of a quantum system must evolve according to the same harmonic components: we can reveal them by postprocessing classical shadows of time-evolved quantum states to extract a large number of time-periodic signals N o ∝ 10 8 , whose frequencies correspond to Hamiltonian energy differences with precision limited as ϵ ∝ 1 / T for simulation time T . We provide strong analytical guarantees that (a) quantum resources scale as O ( log  N o ) , while the classical computational complexity is linear O ( N o ) , (b) the signal-to-noise ratio increases with the number of processed signals as ∝ N o , and (c) spectral peak positions are immune to reasonable levels of noise. We demonstrate our approach on model spin systems and the excited-state conical intersection of molecular CH 2 and verify that our method is indeed intuitively easy to use in practice, robust against gate noise, amiable to a new type of algorithmic-error mitigation technique, and uses relatively few shots given a reasonable initial state is supplied—we demonstrate that even 10 shots per time step can be sufficient. Finally, we measured a high-quality, experimental shadow spectrum of a spin chain on readily available IBM quantum computers, achieving the same precision as in noise-free simulations without using any advanced error mitigation, and verified scalability in tensor-network simulations of up to 100-qubit systems.

1 July 2023 in New Journal of Physics
Verified
Journal Article
Open access
RMRichard Meister
Richard Meister
CGCica Gustiani
Cica Gustiani
SBSimon C Benjamin
Simon C Benjamin
Gate-level quantum circuits are often derived manually from higher level algorithms. While this suffices for small implementations and demonstrations, ultimately automatic circuit design will be required to realise complex algorithms using hardware-specific operations and connectivity. Therefore, ab initio creation of circuits within a machine, either a classical computer or a hybrid quantum–classical device, is of key importance. We explore a range of established and novel techniques for the synthesis of new circuit structures, the optimisation of parameterised circuits, and the efficient removal of low-value gates via the quantum geometric tensor. Using these techniques we tackle the tasks of automatic encoding of unitary processes and translation (recompilation) of a circuit from one form to another. Using emulated quantum computers with various noise-free gate sets we provide simple examples involving up to 10 qubits, corresponding to 20 qubits in the augmented space we use. Further applications of specific relevance to chemistry modelling are considered in a sister paper, ‘Exploiting subspace constraints and ab initio variational methods for quantum chemistry’. The emulation environments used were QuEST, QuESTlink and pyQuEST. All resources will be made openly accessible and are currently available upon request.

28 November 2025 in Nature Communications
Verified
Journal Article
Open access
PDF file
ŠŠŠtěpán Šmíd
Štěpán Šmíd
RMRichard Meister
Richard Meister
MBMario Berta
Mario Berta
RBRoberto Bondesan
Roberto Bondesan
Quantum computers hold the potential to revolutionise the simulation of quantum many-body systems, with profound implications for fundamental physics and applications like molecular and material design. However, demonstrating quantum advantage in simulating quantum systems of practical relevance remains a significant challenge. In this work, we introduce a quantum algorithm for preparing Gibbs states of interacting fermions on a lattice with provable polynomial resource requirements. Our approach builds on recent progress in theoretical computer science that extends classical Markov chain Monte Carlo methods to the quantum domain. We derive a bound on the mixing time for quantum Gibbs state preparation by showing that the generator of the quantum Markovian evolution is gapped at any temperature up to a maximal interaction strength. This enables the efficient preparation of low-temperature states of weakly interacting fermions and the calculation of their free energy. We present exact numerical simulations for small system sizes that support our results and identify well-suited algorithmic choices for simulating the Fermi-Hubbard model beyond our rigorous guarantees.

1 July 2023 in New Journal of Physics
Verified
Journal Article
Open access
CGCica Gustiani
Cica Gustiani
RMRichard Meister
Richard Meister
SBSimon C Benjamin
Simon C Benjamin
Variational methods offer a highly promising route to exploiting quantum computers for chemistry tasks. Here we employ methods described in a sister paper to the present report, entitled exploring ab initio machine synthesis of quantum circuits, in order to solve problems using adaptively evolving quantum circuits. Consistent with prior authors we find that this approach can outperform human-designed circuits such as the coupled-cluster or hardware-efficient ansätze, and we make comparisons for larger instances up to 14 qubits Moreover we introduce a novel approach to constraining the circuit evolution in the physically relevant subspace, finding that this greatly improves performance and compactness of the circuits. We consider both static and dynamics properties of molecular systems. The emulation environment used is QuESTlink all resources are open source and linked from this paper.

16 June 2025 in Physical Review A
Verified
Journal Article
Open access
ZSZhu Sun
Zhu Sun
GBGregory Boyd
Gregory Boyd
ZCZhenyu Cai
Zhenyu Cai
HJHamza Jnane
Hamza Jnane
BKBálint Koczor
Bálint Koczor
NSNikitas Stamatopoulos
Nikitas Stamatopoulos
We explore the important task of applying a phase exp ( i f ( x ) ) to a computational basis state | x 〉 . The closely related task of rotating a target qubit by an angle depending on f ( x ) is also studied. Such operations are key in many quantum subroutines, and frequently f ( x ) can be well approximated by a piecewise function; examples range from the application of diagonal Hamiltonian terms (such as the Coulomb interaction) in grid-based many-body simulation to derivative pricing algorithms. Here, we exploit a parallelization of the piecewise approach so that all constituent elementary rotations are performed simultaneously, that is, we achieve a total rotation depth of one. Moreover, we explore the use of recursive catalyst “towers” to implement these elementary rotations efficiently. We find that strategies prioritizing execution speed can achieve circuit depth as low as O ( log 2 n + log 2 S ) for a register of n qubits and a piecewise approximation of S sections (presuming prior preparation of enabling resource states), albeit total qubit count then scales with S . In the limit of multiple repetitions of the oracle, we find that catalyst tower approaches have an O ( S n ) T -count. Published by the American Physical Society 2025