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 WSe$_2$/WTe$_2$ 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.
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.
(English) In recent years, the evolution of quantum technologies has resulted in an unprecedented control over individual quantum particles and many-body systems. This remarkable progress has given rise to a new era, marked by the convergence of classical and quantum methodologies to investigate fundamental questions concerning the nature of quantum matter, improving our understanding of the role of entanglement in solid-state systems or the mechanisms behind high-energy physics. From analog quantum simulators to digital quantum computers, these advancements hold potential across diverse domains. This thesis explores the interplay between classical and quantum methods in understanding topological phases of matter. We concentrate on three distinct directions: non-conventional topological superconductors, interaction-induced topological phases in ultracold atom quantum simulators, and applications of variational quantum algorithms. Each trajectory relies on the combination of different techniques with the aim of understanding and characterizing topological phenomena in different settings. Exploring non-conventional topological superconductors involves extending the paradigmatic Kitaev chain model by incorporating additional terms in the Hamiltonian such as long-range interactions and quasi-periodic potentials. This investigation is relevant to better understand the impact of real-world conditions on the both the topological and localization properties of systems hosting non-local Majorana modes, which are promising candidates for topological quantum computation. In the realm of interacting systems, we explore the realization of interaction-induced topological phases in systems of ultracold atoms in optical lattices, both in one and two dimensions. The remarkable control and versatility of such platforms enable the simulation of both theoretical topological models and strongly correlated physics. Notably, the interplay between interactions and topology can give rise to intriguing phenomena, such as delocalized fractional charges and gapless topological phases,challenging existing intuition. We employ advanced numerical methods based on tensor networks to benchmark the experimental proposals that open the door to the realization and detection of novel many-body phases of matter, including topological quantum critical points and a higher-order topological Peierls insulator in Bose-Hubbard models with long-range interactions. Variational quantum algorithms, conversely, have the potential to efficiently tackle a wide range of problems, including ground state search, phase classification or accessing topological invariants. Despite current limitations in trainability and scalability, these hybrid classical-quantum algorithms provide practical insights into current quantum hardware capabilities and can inspire future architectures. We explore the application of variational quantum algorithms to shed light on topological phenomena, raising questions about their ability to discern topological phase transitions and compute topological invariants in situations where classical approaches fail. This thesis presents a comprehensive exploration of distinct approaches to topological quantum matter by leveraging quantum technologies and quantum-inspired classical algorithms. Our results not only advance our understanding of quantum systems but also pave the way for the realization and discovery of novel physics extending to quantum information processing, materials science, and beyond.
Quantum computers provide a promising platform to understand and control the dynamics of quantum many-body systems, yet current devices operate in the noisy intermediate-scale quantum (NISQ) regime, where decoherence caused by interactions with the environment severely limit their ability to accurately carry out computations. This thesis investigates how these limitations affect the simulation of quantum many-body systems, and explores strategies to design efficient quantum algorithms that can operate under realistic experimental constraints. In the first part, we assess the performance of currently available quantum hardware using lattice gauge theory as a challenging testbed. We study digital quantum simulations of a one-dimensional discretization of quantum electrodynamics on Rydberg atom and superconducting platforms, combining classical simulations with realistic noise models and quantum simulations on actual cloud-accessible devices, and analyze the impact of decoherence and gate errors on the accurate reconstruction of dynamical observables. Our findings show that, for the hardware available at the time of the study, reliable simulations without high quality error mitigation are restricted to short circuit depths or small system sizes. These limitations motivate the second part of the work, where we focus on constructing resource-efficient quantum algorithms by exploiting physical insight from quantum many-body physics. First, we introduce an approximate inversion protocol for classical shadows that enables the efficient estimation of global properties of quantum states using shallow quantum circuits. Then, we propose an algorithm for the preparation of short-range correlated quantum states, based on reconstructing the global state by learning local reduced density matrices through classical variational optimization. Taken together, the results of this thesis provide insight into the capabilities of currently available quantum devices and demonstrate how structure inherent to quantum many-body systems can be leveraged to design algorithms compatible with current hardware.
Quantum computing offers a new, orthogonal direction for investigating fundamental physics, extending beyond classical numerical methods and conventional observables. Realizing this potential requires directly confronting the noise limiting currently available quantum computers. Progress rests on advancing algorithms, interpreting their results, and managing their errors together. This thesis presents several advancements in the use of quantum simulation and quantum information to probe fundamental physics.
The first is in the use of quantum computers to simulate collisions in quantum field theories. Central to these simulations are new wavepacket preparation, time evolution, and error mitigation techniques, which allow for simulations with some of the largest effective circuit volumes to date. These methods enable the first quantum simulation providing numerical evidence for inelastic particle production, a key process in fundamental physics.
The second advancement centers on the role quantum-information-theoretic quantities play in physical processes. Beyond mere correlations with the physics of the process, entanglement and magic are shown to probe the interactions present in scattering and hadronization dynamics.
A precision study requires a complete quantification of algorithmic and hardware uncertainties, an outstanding goal as quantum simulations mature. The third advancement in this thesis addresses error management. A framework minimizing the effect of algorithmic errors in analog quantum simulations is presented. In a step toward fault tolerance, error detection in encoded quantum simulations is shown to improve estimation of local observables relative to unencoded runs.
Together, the developments in this thesis mark practical progress toward fault-tolerant quantum simulations of fundamental physics capable of scientific discovery.
Quantum computers have the potential to solve certain problems exponentially faster than classical computers. However, realizing this potential in practice is a major challenge, as it requires precise control over large-scale quantum systems operating at extremely low error rates. Quantum error correction (QEC) provides a path to achieving such error rates, but its substantial resource overhead poses a significant practical barrier. In addition, identifying which computational problems offer a provable quantum advantage—and which remain fundamentally intractable—remains an open question. This thesis presents progress towards addressing both of these challenges. The first part of this thesis describes advances that substantially reduce the resource overhead of QEC. We begin by presenting realizations of logical circuits in dynamically reconfigurable arrays of neutral atoms. By jointly decoding the logical qubits, we reduce the cost of implementing such transversal Clifford circuits by a factor proportional to the code distance. We then develop new theories of fault tolerance to extend these savings to universal quantum computation with magic state inputs. Finally, we introduce techniques for fast correlated decoding, enabling practical implementations of these improvements in experimental hardware. Collectively, these advances accelerate progress toward large-scale computation and reduce the cost of QEC by over an order of magnitude. The second part of the thesis explores the relative power of quantum and classical computation in combinatorial optimization, a class of problems that is ubiquitous in science and engineering and foundational to the theory of computational complexity. We experimentally implement the optimized quantum adiabatic algorithm (QAA) in neutral atom arrays and observe evidence of a superlinear speedup over classical simulated annealing on certain hard problem instances. To interpret these results, we develop a theoretical framework to compare the performance of QAA with a broad class of classical Markov chain Monte Carlo algorithms. We identify conditions under which a quantum quadratic speedup is achievable and propose modifications to the QAA to reliably realize this advantage. Together, these contributions advance both the practical implementation and theoretical understanding of quantum algorithms.
Quantum computing may solve selected classes of problems more efficiently than classical computers, with applications in areas such as cryptography, chemistry, and optimization. However, current quantum systems remain limited in scale and reliability and depend on substantial classical-computing support. This thesis investigates this challenge in two complementary contexts: classical simulation, where efficient computation enables the exploration of larger quantum systems; and quantum error correction, where efficient real-time decoding enables more reliable quantum operation.The first part examines the classical simulation of quantum computers, focusing on the computational and memory challenges that limit its scalability. It organizes the field across device, gate, and algorithmic levels, with particular attention to state-vector, path-based, hybrid, and tensor-based methods. The survey relates their computation, memory, data-movement, and communication bottlenecks to acceleration approaches for CPUs, GPUs, FPGAs, and distributed systems. It further highlights recurring optimization strategies, including reduced precision, data compression, parallel execution, improved memory locality, specialized matrix units, and reconfigurable hardware, providing a common framework for current techniques and future acceleration opportunities.The second part addresses the real-time classical processing required for quantum error correction. Starting from a high-accuracy Graph Neural Network surface-code decoder, it applies algorithm-hardware co-design through hardware-guided pruning and retraining, input-graph filtering, quantization, and a custom FPGA architecture. For code distances up to d=7, the resulting designs satisfy both max-latency and average-latency decoding requirements while reducing the logical error rate by 13% and 40%, respectively, compared with the evaluated Minimum Weight Perfect Matching baseline.Together, these works show how classical computer-architecture techniques can support quantum computing from scalable exploration through simulation to reliable operation through real-time error correction.
The simulation of quantum matter with classical hardware plays a central role in the discovery and development of quantum many-body systems, with far-reaching implications in condensed matter physics and quantum technologies. In general, efficient and sophisticated algorithms are required to overcome the severe challenge posed by the exponential scaling of the Hilbert space of quantum systems. In contrast, hardware built with quantum bits of information are inherently capable of efficiently finding solutions of quantum many-body problems. While a universal and scalable quantum computer is still beyond the horizon, recent advances in qubit manufacturing and coherent control of synthetic quantum matter are leading to a new generation of intermediate scale quantum hardware. \n \nThe complexity underlying quantum many-body systems closely resembles the one encountered in many problems in the world of information and technology. In both contexts, the complexity stems from a large number of interacting degrees of freedom. A powerful strategy in the latter scenario is machine learning, a subfield of artificial intelligence where large amounts of data are used to extract relevant features and patterns. In particular, artificial neural networks have been demonstrated to be capable of discovering low-dimensional representations of complex objects from high-dimensional dataset, leading to the profound technological revolution we all witness in our daily life. \n \nIn this Thesis, we envision a new paradigm for scientific discovery in quantum physics. On the one hand, we have the essentially unlimited data generated with the increasing amount of highly controllable quantum hardware. On the other hand, we have a set of powerful algorithms that efficiently capture non-trivial correlations from high-dimensional data. Therefore, we fully embrace this data-driven approach to quantum mechanics, and anticipate new exciting possibilities in the field of quantum many-body physics and quantum information science. We revive a powerful stochastic neural network called a restricted Boltzmann machine, which slowly moved out of fashion after playing a central role in the machine learning revolution of the early 2010s. We introduce a neural-network representation of quantum states based on this generative model. We propose a set of algorithms to reconstruct unknown quantum states from measurement data and numerically demonstrate their potential, with important implications for current experiments. These include the reconstruction of experimentally inaccessible properties, such as entanglement, and diagnostics to determine sources of noise. Furthermore, we introduce a machine learning framework for quantum error correction, where a neural network learns the best decoding strategy directly from data. We expect that the full integration between quantum hardware and artificial intelligence will become the gold standard, and will drive the world into the era of fault-tolerant quantum computing and large-scale quantum simulations.