We estimate the run-time and energy consumption of simulating non-equilibrium dynamics on neutral atom quantum computers in analog mode, directly comparing their performance to state-of-the-art classical methods, namely Matrix Product States and Neural Quantum States. By collecting both experimental data from a quantum processing unit (QPU) in analog mode and numerical benchmarks, we enable accurate predictions of run-time and energy consumption for large-scale simulations on both QPUs and classical systems through fitting of theoretical scaling laws. Our analysis shows that neutral atom devices are already operating in a competitive regime, achieving comparable or superior performance to classical approaches while consuming significantly less energy. These results demonstrate the potential of analog neutral atom quantum computing for energy-efficient simulation and highlight a viable path toward sustainable computational strategies.
We estimate the run-time and energy consumption of simulating non-equilibrium dynamics on neutral atom quantum computers in analog mode, directly comparing their performance to state-of-the-art classical methods, namely Matrix Product States and Neural Quantum States. By collecting both experimental data from a quantum processing unit (QPU) in analog mode and numerical benchmarks, we enable accurate predictions of run-time and energy consumption for large-scale simulations on both QPUs and classical systems through fitting of theoretical scaling laws. Our analysis shows that neutral atom devices are already operating in a competitive regime, achieving comparable or superior performance to classical approaches while consuming significantly less energy. These results demonstrate the potential of analog neutral atom quantum computing for energy-efficient simulation and highlight a viable path toward sustainable computational strategies.
Analog quantum processors based on Rydberg atom arrays are a powerful platform for many-body quantum simulation, combinatorial optimization, and graph machine learning. As these devices become increasingly accessible, establishing confidence in their outputs requires predictive models that quantitatively connect microscopic hardware imperfections to empirical results. Here, we present a noise-aware emulation framework that propagates the dominant noise mechanisms throughout the full computation cycle to predict device behavior. We validate the framework by benchmarking two representative protocols, quantum annealing and post-quench dynamics, on three Pasqal quantum processors where classical simulations still provide ground truth. Across all three devices, the measured observables fall within the uncertainty envelopes predicted by the emulator. Beyond reproducing the data, the framework isolates which physical mechanism dominates in each operating regime, provides quantitative guidance for algorithm design and hardware improvements, and establishes a foundation for verifying analog processors in regimes beyond classical reach.
One of the central goals of condensed matter physics is to understand the emergence of collective phenomena in strongly correlated quantum systems. However, the exponential complexity of many-body quantum states poses fundamental challenges to both analytical and classical numerical methods. This thesis explores how classical computation can support and extend the capabilities of quantum simulation, with a focus on both analog and digital quantum simulators, guided by and aligned with recent experimental advancements. The first part of this thesis focuses on analog quantum simulation in solid-state moiré materials. In particular, we investigate WSe2/WTe2 heterobilayers as promising platforms for simulating extended Hubbard models on a triangular lattice. Using large-scale density matrix renormalization group (DMRG) simulations, we map out the quantum phase diagram as a function of kinetic energy and Coulomb interactions. Our results identify several exotic phases, including chiral spin liquids and generalized Wigner crystals, and provide theoretical guidance for experimental exploration of interaction-driven quantum phase transitions in these systems. The second part addresses digital quantum simulators and the challenge of quantum error correction. We propose a machine learning-based decoder for fault-tolerant quantum computation in the presence of logical circuits, motivated by the architecture of neutral atom-based quantum processors. By designing a modular neural network architecture and training it on realistic error models, we achieve competitive decoding accuracy and efficiency. Our work highlights the potential of classical machine learning to enhance the performance of quantum error correction, bridging algorithmic design with practical hardware considerations. Together, these studies demonstrate the essential role of classical computation in supporting quantum simulation, from characterizing novel phases in analog platforms to enabling fault tolerance in digital quantum devices. The interplay between theoretical modeling, numerical simulation, and experimental collaboration provides a path forward for probing and harnessing quantum many-body phenomena.
While extensive research over the past decades has been dedicated to developing scalable quantum computers, the question of their energetic performance has only gained attention more recently, but its importance is now recognized. In fact, quantum computers can only be a viable alternative if their energy cost scales favorably, and some research has shown that there is even a potential quantum energy advantage. In parallel, Rydberg atoms have recently emerged as one of the most promising platforms to implement a large-scale quantum computer. This work aims at contributing first steps to understand the energy efficiency of this platform, by investigating the energy consumption of the different elements of a Rydberg atom quantum computer. First, an experimental implementation of the Quantum Phase Estimation algorithm is analyzed, and an estimation of the energetic cost of executing it is calculated. Then, we derive an estimate of how the energy cost of performing the Quantum Fourier Transform scales with the number of qubits in the Rydberg platform. This analysis facilitates a comparison of the energy consumption of different elements within a Rydberg atom quantum computer, from the preparation of the atoms to the execution of the algorithm, and the measurement of the final state, enabling the evaluation of the energy expenditure of the Rydberg platform and the identification of potential improvements. Finally, we use the Quantum Fourier Transform as an energetic benchmark, comparing the scaling we obtained to that of the execution of the Discrete Fourier Transform in two state-of-the-art classical supercomputers. This comparison indicates that, in an ideal error-free scenario, a quantum energy advantage is achieved in the Rydberg platform for the Fourier Transform, in a regime where classical algorithms are still faster.
We propose the Many-Body Quantum Score (MBQS), a practical and scalable application-level benchmark protocol designed to evaluate how accurately quantum processing units (QPUs)---both gate-based and analog---can simulate many-body quantum dynamics. MBQS quantifies performance by identifying the maximum number of qubits with which a QPU can reliably reproduce correlation functions of the transverse-field Ising model following a specific quantum quench. This quench reveals a global correlation surge, a collective peak of connected correlations at all distances, which to our knowledge had not been noticed so far in this context. This paper presents the MBQS protocol and highlights its design principles, supported by analytical insights, classical simulations, and experimental data. It also reports an implementation on Ruby, an analog QPU based on Rydberg atoms developed by the Pasqal company. These findings demonstrate MBQS's potential as a robust and informative tool for benchmarking near-term quantum devices for many-body physics. While the present experimental validation has been performed on an analog device, the protocol has the potential to be implemented on digital platforms as well.
Quantum machine learning has gained considerable attention as quantum technology advances, presenting a promising approach for efficiently learning complex data patterns. Despite this promise, most contemporary quantum methods require significant resources for variational parameter optimization and face issues with vanishing gradients, leading to experiments that are either limited in scale or lack potential for quantum advantage. To address this, we develop a general-purpose, gradient-free, and scalable quantum reservoir learning algorithm that harnesses the quantum dynamics of neutral-atom analog quantum computers to process data. We experimentally implement the algorithm, achieving competitive performance across various categories of machine learning tasks, including binary and multi-class classification, as well as timeseries prediction. Effective and improving learning is observed with increasing system sizes of up to 108 qubits, demonstrating the largest quantum machine learning experiment to date. We further observe comparative quantum kernel advantage in learning tasks by constructing synthetic datasets based on the geometric differences between generated quantum and classical data kernels. Our findings demonstrate the potential of utilizing classically intractable quantum correlations for effective machine learning. We expect these results to stimulate further extensions to different quantum hardware and machine learning paradigms, including early fault-tolerant hardware and generative machine learning tasks.
The quantum dynamics of many-qubit systems is an outstanding problem that has recently driven significant advances in both numerical methods and programmable quantum processing units. In this work, we employ a comprehensive toolbox of state-of-the-art numerical approaches to classically simulate the dynamics of the two-dimensional transverse field Ising model. Our methods include three different tensor network techniques -- matrix product states, tree-tensor networks, and two-dimensional tensor-networks under the belief propagation approximation -- as well as time-dependent variational Monte Carlo with Neural Quantum States. We focus on two paradigmatic dynamical protocols: (i) quantum annealing through a critical point and (ii) post-quench dynamics. Our extensive results show the quantitative predictions of various state-of-the-art numerical methods providing a benchmark for future numerical investigations and experimental studies with the aim to push the limitations on classical and QPUs. In particular, our work connects classical simulability to different regimes associated with quantum dynamics in Rydberg arrays - namely, quasi-adiabatic dynamics, the Kibble-Zurek mechanism, and quantum quenches.