Quantum computing promises to revolutionize several scientific and technological domains through fundamentally new ways of processing information. Among its most compelling applications is digital quantum simulation, where quantum computers are used to replicate the behavior of other quantum systems. This could enable the study of problems that are otherwise intractable on classical computers, transforming fields such as quantum chemistry, condensed matter physics, and materials science. Despite this potential, realizations of practical quantum advantage for relevant problems are hindered by imperfections of current devices. This also affects quantum hardware based on superconducting circuits which is among the most advanced and scalable platforms. The envisaged long-term solution of fault-tolerant quantum computers that correct their own errors remains out of reach mainly due to the associated qubit number overhead. As a result, the field has developed strategies that combine quantum and classical resources, exploit hardware-native operations, and employ error mitigation techniques to extract meaningful results from noisy data. This doctoral thesis contributes to this broader effort by exploring methods for advancing quantum simulation across the full computational stack, including hardware-level innovations, refined techniques for noise modeling and error mitigation, and algorithmic improvements enabled by efficient measurement processing.
Quantum computing promises to revolutionize several scientific and technological domains through fundamentally new ways of processing information. Among its most compelling applications is digital quantum simulation, where quantum computers are used to replicate the behavior of other quantum systems. This could enable the study of problems that are otherwise intractable on classical computers, transforming fields such as quantum chemistry, condensed matter physics, and materials science. Despite this potential, realizations of practical quantum advantage for relevant problems are hindered by imperfections of current devices. This also affects quantum hardware based on superconducting circuits which is among the most advanced and scalable platforms. The envisaged long-term solution of fault-tolerant quantum computers that correct their own errors remains out of reach mainly due to the associated qubit number overhead. As a result, the field has developed strategies that combine quantum and classical resources, exploit hardware-native operations, and employ error mitigation techniques to extract meaningful results from noisy data. This doctoral thesis contributes to this broader effort by exploring methods for advancing quantum simulation across the full computational stack, including hardware-level innovations, refined techniques for noise modeling and error mitigation, and algorithmic improvements enabled by efficient measurement processing.
Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. Access to a computational space that incorporates quantum effects, such as superposition and entanglement, enables the derivation of promising quantum algorithms for important tasks, including preparing the ground state of a quantum system or predicting its evolution over time. Successfully tackling these tasks promises insights into significant theoretical and technological questions, such as superconductivity and the design of new materials. The aim of quantum algorithms is to use a series of quantum operations in a quantum circuit to solve a problem beyond the reach of classical computers. However, the noise and limited scale of current quantum computers restricts these circuits to moderate sizes and depths. As a result, many prominent algorithms are currently infeasible to run for problem sizes of practical interest. In response, recent research focused on variational quantum algorithms, which allow the selection of circuits that act within a quantum device's capabilities. Yet, these algorithms can require the execution of a large number of circuits, leading to prohibitively long computation times. This doctoral thesis develops two main techniques to reduce these quantum computational resource requirements, with the goal of scaling up application sizes on current quantum processors. The first approach is based on stochastic approximations of computationally costly quantities, such as quantum circuit gradients or the quantum geometric tensor (QGT). The second method takes a different perspective on the QGT, leading to a potentially more efficient description of time evolution on current quantum computers. Both techniques rely on maintaining available information and only computing necessary corrections, instead of re-computing possibly redundant data. The main focus of application for our algorithms is the simulation of quantum systems, broadly defined as including the preparation of ground and thermal states, and the real- and imaginary-time propagation of a system. The developed subroutines, however, can further be utilized in the fields of optimization or machine learning. Our algorithms are benchmarked on a range of representative models, such as Ising or Heisenberg spin models, both in numerical simulations and experiments on the hardware. In combination with error mitigation techniques, the latter is scaled up to 27 qubits; into a regime that variational quantum algorithms are challenging to scale to on noisy quantum computers without our algorithms.
Quantum mechanical problems are among the hardest to simulate and, in some cases, remain intractable even for the most powerful computers. Quantum computing has emerged as a new technological platform to address such challenges, with rapid advances in recent years. Yet, current quantum devices remain noisy and limited in scale. Hence, it is essential to identify classically hard problems of practical interest and tractable with existing quantum devices. Among potential applications, the real-time simulation of quantum systems is one of the most promising to deliver an early, practical quantum advantage. This doctoral thesis is therefore centered around simulating quantum dynamics on quantum devices. We first present an overview of the most relevant quantum algorithms for quantum dynamics, highlighting respective advantages and limitations. Further, we identify relevant problems within quantum dynamics that could benefit from quantum simulation in the near future. Second, we propose a method for benchmarking hardware and error mitigation algorithms that is based on well-understood theoretical results and suffers from no scaling issues. The resulting quality metric is intuitive and transferable to other applications. We successfully implement the scheme on up to 133 qubits, demonstrating coherent evolution up to a two-qubit gate depth of 28, featuring 1396 two-qubit gates, before noise becomes prevalent. Third, we propose a novel variant of probabilistic error amplification to implement open quantum dynamics, relying on characterizing and altering hardware noise to mimic the system-environment interaction under study. Lastly, we present two studies on state preparation and phase classification: first, a hybrid algorithm to prepare ground states of electron-phonon systems; second, a quantum machine learning-based approach to distinguish phases in previously prepared quantum states.
Many important physical and mathematical problems are difficult to solve on classical computers, resulting in difficulty in finding new advanced materials, simulating quantum field theories and solving large combinatorial optimisation tasks. Quantum computers have shown great promise in being able to solve these (and many other) problems faster than their classical counterparts, and therefore should be thoroughly investigated as a significant tool for enabling the acceleration of scientific progress. This work develops methods to tackle several problems across the spectrum of quantum algorithms, providing methods suitable for the near-term hardware, to the future where large fault-tolerant quantum computers exist. Therefore, the works in this thesis range from efficiently making use of limited quantum hardware to taking advantage of hardware benefits (e.g. excess qubits) as quantum computation advances. Covered topics include: an alternative paradigm for the optimisation of variational circuits and quantum neural networks; techniques for improving energy estimation of quantum states through the collection and processing of large amounts of randomised measurement data; the use of entanglement in guiding the automatic discovery of quantum circuits; investigating the role of symmetries in adiabatic state preparation of molecules and the large scale parallelisation of a common fault-tolerant subroutine, potentially producing large runtime speed-ups for the simulation of chemistry on quantum computers. Although there are many challenges remaining from both hardware and algorithms perspectives before the large-scale utility of quantum computers can be demonstrated, the contributions of this work make steps towards the efficient utilisation of quantum hardware that will be available in the coming years.
Superconducting quantum computers are yet to reach the fault-tolerant regime, and thus the tantalising promises behind quantum algorithms are laid barren. To cross this knowledge-concealing wasteland, one must first understand how both intrinsic and extrinsic noise hinders the reliability of quantum computing systems. Most recently, in fact, external impinging particle events have been discovered to be one of the causes behind sudden bursts of information loss in these devices. Modelling such events with standard methods is a masterfully complex endeavour, which is ultimately hampered by computational costs in terms of memory and time. There is a growing requirement for an accurate fault model able to characterise a qubit's interaction with impinging particles, and more generally, the performance of full algorithms on quantum computers in the presence of radiation. Such a fault model would be the first of many other steps, paving the way for research on new quantum error correction and mitigation algorithms, and ultimately giving scientists a new instrument for tackling and understanding this ever growing issue. Reaching such goal requires the efficient simulation of quantum systems, both at the algorithmic and device level, pushing against the known limitations and bottlenecks imposed by these methods. The first objective is to understand the feasibility of quantum circuit simulations with the available computational methods, underlining bounds and limitations. This paved the way to provide a physically accurate noise model for the interaction of impinging particles on superconducting qubits, the most widespread and scalable technology for building quantum computers. The model has been devised to be easy to interpret and simulate, whilst being highly expressive and tunable, in order to keep up with future technological advancements in the field. The following step has been to leverage the fault model to develop methods and techniques apt at testing the reliability of \gls{QEC} and quantum algorithms alike. This includes methods for detecting the presence of radiation-induced faults at runtime, and applying partial information reconstruction methods. A deeper understanding of the effects of radiation also prompted the modelling and study of hardware hardening techniques. At last, the interoperation of quantum and classical computing systems has been investigated in the context of the reliability of hybrid machine learning algorithms, which are going to play an ever important role in the high performance computing systems of the future. These contributions press on in the quest for knowledge, impacting the quantum computing stack, correlating logical and physical quantum circuit design, and widening the understanding of how to prevent faults in quantum computing systems, quickening the advent of fault-tolerant quantum computation.
Over the last decade, quantum simulation and computation has progressed from a purely scientific testbed of quantum mechanics to a mature field that is starting to offer new insights into materials, quantum effects, and algorithms that are intractable with even the most state-of-the-art classical computation. Simulating certain quantum Hamiltonians that are theorized to be at the heart of high-Tc superconductivity, topological quantum systems such as the fractional quantum Hall effect or fundamental questions of thermalization quickly exceed the available memory of even the most advanced supercomputers – and in fact all memory in the world – due to the exponential growth of the Hilbert space with system size. As postulated by Feynman himself, the computational system best suited for solving quantum problems is to use a quantum system itself, as it can intrinsically represent the entanglement that is the key resource making quantum computing challenging but also promising. Apart from simulating problems in physics and chemistry, there is also tremendous excitement for quantum computers to provide speedups for general algorithms in optimization at a rate that is exponentially faster than existing classical programming. So far only a small class of algorithms has been actually proven to provide such a speedup, most prominently Shor's algorithm which can factor large prime numbers, and several other search and oracle algorithms. In the last two decades, many experiments using ultracold atoms, ions, or superconducting circuits have focused on analog quantum simulation. Here, a model Hamiltonian that is believed to capture all the relevant physics of the system of study is experimentally realized using different building blocks and interactions but replicating condensed matter effects at an increased scale. This has led to a number of bespoke experiments such as BEC/Fermigass machines, quantum gas microscopes and more exotic setups that are purpose built to study a particular effect. More recently, there has been a shift to develop more universal simulation platforms and optical tweezer arrays have emerged as a leading solution due to their high degree of reconfigurability. Through tremendous improvements in the degree of control and measurement of single qubits, error correction has become a viable route to build a true universal digital quantum computer. Even as we transition into the digital age of quantum simulation, certain classes of problems with additional physics constraints such as Fermionic statistics, gauge fields and lattice gauge theories still incur too large of an overhead to be encoded on these digital simulators. In this thesis, we use a highly degenerate twisted cavity to simulate the effect of a magnetic field on a two-dimensional system of interacting photons to enable realization of states of the quantum Hall effect. We design, build, and commission a new lens based cavity apparatus realizing a lowest Landau level for a mesoscopic number of modes. We demonstrate the integration of highly excited Rydberg atoms to mediate strong interactions and demonstrate photon blockade as well as mean field interactions. As a second application of cavities to quantum information leveraging our newfound comfort with intra-cavity optics, and experience with aberration modeling in resonators, we demonstrate a new class of small waist optical resonators enabled by lens-based cavities and then apply our understanding of optical aberrations in cavities to the development of a new class of cavity array. This Cavity Array Microscope (CAM) realizes a large number of cavities (up to currently 600) using only a fixed number of free space optics and is both scalable with constant overhead as well as compatible with Rydberg atoms. This platform provides a route to highly parallel quantum repeater operation or entanglement generation between atom arrays in the future.
Superconducting qubits are a leading platform for quantum computation, yet decoherence and scalability challenges continue to limit progress toward fault-tolerant systems. This review synthesizes research on architectures, noise sources, and error correction to clarify performance trade-offs and guide development. The transition from Transmon to Fluxonium has dramatically improved qubit performance, achieving millisecond-scale coherence times. However, this success reveals a fundamental limit of coherence now being primarily restricted by the physical properties of the materials, specifically dielectric losses occurring at the Josephson junction leads and within the surrounding materials. As overcoming these material limits becomes increasingly difficult, system-level engineering determines whether high-coherence qubits can scale.Scaling quantum systems is difficult because current cooling and control systems create too much heat and this forces a shift to integrated digital superconducting circuits and cryogenic light-based links. While these hardware challenges restrict scaling, experiments in error correction show that logical qubits can already outperform physical ones. For example, a distance-7 surface code improved logical qubit lifetime by 2.4×. Achieving practical fault tolerance, however, requires moving beyond simple error models. Future systems must combine techniques like Dynamical Decoupling and Machine Learning-based Optimal Control with dynamic classical control capable of handling complex, correlated faults such as Multi-Bit Burst Errors. Progress in materials, cryogenic system integration for control, and adaptive error management must advance together to realize scalable, high-fidelity quantum hardware.