Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Capturing dynamics with noisy quantum computers

D.S. Dechant

Published Mar 26, 2026• 0 citations
Publisher

Abstract

Quantum computing represents a fundamentally new computational paradigm, capable of addressing problems that are intractable for classical computers. Despite the promise, current quantum devices are small, noisy, unreliable, and costly, making theoretical analysis and classical simulations essential for understanding their capabilities and limitations. A key focus of quantum computing is modeling dynamics (how the state of a system evolves over time), which can be described mathematically through differential equations or time series. In this thesis, we investigate the application of quantum computing to capturing such dynamics from several complementary perspectives. First, we show that by rescaling input data appropriately and incorporating derivative information into training, quantum models can achieve stronger and more accurate approximations, allowing them to capture the dynamical behavior of systems. Second, we analyze quantum algorithms for solving differential equations for errors arising from both classical numerical methods and quantum shot noise, enabling precise estimates of computational resources. Third, we introduce a quantum state tomography approach that mitigates shot noise in the reconstruction of quantum states from measurement data by incorporating physical constraints through semidefinite programming. Finally, we show that quantum generative models, such as quantum generative adversarial networks, can generate synthetic time series that accurately capture both the statistical distributions and temporal correlations of real-world financial data; tasks that are difficult for classical models to achieve. Overall, these results highlight both the opportunities and limitations of noisy quantum computers in modeling and simulating complex dynamical systems.

DOI
10.60602/1887-4290771

Related papers

Scalable Quantum Algorithms for Noisy Quantum Computers

Julien Gacon

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.

arXiv:2403.00940•Jan 1, 2024•7 citations

Fundamental Physics at the Frontier of Noisy Quantum Computation

Nikita A. Zemlevskiy

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.

quant-pharXiv:2609.28825•Sep 25, 2026•0 citations

Synthetic data generation on noisy quantum computers

Michael Krebsbach

Generative machine learning aims to model probability distributions from sample data. Quantum computers are widely believed to efficiently sample from certain probability distributions that are intractable for classical computers, making quantum circuits promising candidates for generative machine learning. This dissertation investigates quantum generative machine learning models, with a particular focus on Synthetic Data Generation (SDG) and on the Quantum Circuit Born Machine, an algorithm that can be implemented on current quantum hardware. The first part of this dissertation studies SDG algorithms in noiseless simulations. Most of these algorithms rely on an implicit design choice that has not previously been examined: the binary encoding that maps bitstring samples generated by a quantum circuit to real-valued data points. We show that the training performance depends on this choice and analyze the interplay between data structure, circuit ansatz, and encoding. For continuous target distributions, the reflected binary Gray code is particularly effective because it maps similar data points to similar bitstrings and thus preserves the structure of the data. This provides a useful inductive bias that leads, on average, to faster convergence and better synthetic data. We further investigate extensions of SDG algorithms. Contrary to previous findings, we show that quantum models can also learn conditional probability distributions with quality comparable to that of independently trained models. We develop two sample-efficient strategies that enable conditional models to perform classification without additional training. This yields a unified model with both generative and discriminative capabilities. The second part of this dissertation addresses the implementation of such models on real quantum hardware. While current devices can train small-scale models with reasonable resource, larger-scale implementations remain limited by noise. Understanding and modeling this noise is therefore essential for progress. First, we develop a physically motivated noise model for superconducting transmon systems based on Hamiltonian simulation. We show that frequency collisions between energy levels of neighboring transmons can induce crosstalk and may drive the system out of the computational subspace. This model provides a basis for understanding hardware-level error mechanisms and for developing taylored mitigation or correction strategies. Second, we investigate two-qubit error using Long-Sequence Quantum Process Tomography (LS-QPT), assuming well-characterized single-qubit gates. Compared with standard Quantum Process Tomography, LS-QPT reduces the measurement cost by amplifying noise through germ circuits. We show that germ circuits that ideally implement the identity operation amplify a larger subspace of noise processes than other types of germ circuits. We also show that the precision of LS-QPT is fundamentally limited by unlearnable degrees of freedom in the noise model that cannot be amplified. Despite this limitation, the LS-QPT method reduces the total circuit depth required for process tomography by an order of magnitude.

•Jan 1, 2026•0 citations

Digital Quantum Simulation of Many-Body Systems: Making the Most of Intermediate-Scale, Noisy Quantum Computers

Miessen, Alexander

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.

arXiv:2508.21504•Aug 29, 2025•1 citation

Enabling large-scale digital quantum simulations with superconducting qubits

Laurin E. Fischer

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.

quant-pharXiv:2602.04719•Feb 5, 2026•1 citation

Controlling quantum systems for quantum information processing

Kevin C Young

For several decades it has been appreciated that quantum computers hold incredible promise to perform calculations intractable to classical computation. However, this promise has be slow to realize. Dozens of quantum systems are currently being investigated for use in quantum information processing - none of which have yet demonstrated algorithms involving more than a handful of qubits and it remains unclear which, if any, of these systems will ultimately compose a scalable, robust quantum information processing architecture. In this thesis we employ analytical, optimal and algebraic control techniques to evaluate various quantum systems for their potential use in quantum information processing. In doing so, we have additionally identified several novel characterization procedures capable of probing both the coherent and incoherent dynamics of quantum systems. The first part of this thesis discusses work motivated by attempts to utilize donor qubits in silicon as quantum bits. We first propose a measurement of the state of a single donor electron spin using two-dimensional electron gas of a field-effect transistor and electrically detected magnetic resonance. We analyze the potential sensitivity of this measurement and show that it is a quantum nondemolition measurement of an electron-encoded state. We then present the first of two novel qubit characterization procedures. We consider the problem of rapidly characterizing a large number of similarly prepared qubits using techniques from optimal experiment design. All qubits are assumed to evolve according to the same physical processes, though the Hamiltonian parameters may vary from device to device - an inevitability in solid state qubits. We use the Cram\\'er-Rao bound on the variance of a point estimator to construct the optimal series of experiments to estimate these free parameters, and present a complete analysis of the optimal experimental configuration. Though applied to dipole- and exchange-coupled qubits, this technique is widely applicable to other systems. The second part of the thesis discusses the role that control can play in measuring and mitigating noise in qubit systems. Our first result describes a method for quickly simulating the effects of arbitrary markovian noise on qubit systems through the use of a numerically optimized, multi-state Markovian fluctuator. This ability to rapidly simulate the noisy qubit evolution allows us to compute control sequences capable of maximally decoupling the qubit from the noise source. We then introduce the second characterization procedure of the these, showing that a single measurable and controllable qubit may act as a spectrometer of dephasing noise. We show that the formalism of dynamical decoupling can be used to estimate the short-time correlation function of the noise source, while long time correlations may be estimated by a very simple series of free evolution experiments. This technique is applicable to the wide range of physical implementations which suffer from dephasing noise.The final part of this thesis demonstrates that trapped neutral atoms may be utilized for the robust simulation of complex systems exhibiting a topological phase. We present a method to simulate the toric code Hamiltonian stroboscopically, and demonstrate that our technique preserves the ground state degeneracy . Furthermore, we introduce a dissipative mechanism allowing for thermalization of the system to a finite temperature or direct cooling to the ground state manifold.

•Jan 1, 2010•0 citations
Quantum computing represents a fundamentally new computational paradigm, capable of addressing problems that are intractable for classical computers. Despite the promise, current quantum devices are small, noisy, unreliable, and costly, making theoretical analysis and classical simulations essential for understanding their capabilities and limitations. A key focus of quantum computing is modeling dynamics (how the state of a system evolves over time), which can be described mathematically through differential equations or time series. In this thesis, we investigate the application of quantum computing to capturing such dynamics from several complementary perspectives. First, we show that by rescaling input data appropriately and incorporating derivative information into training, quantum models can achieve stronger and more accurate approximations, allowing them to capture the dynamical behavior of systems. Second, we analyze quantum algorithms for solving differential equations for errors arising from both classical numerical methods and quantum shot noise, enabling precise estimates of computational resources. Third, we introduce a quantum state tomography approach that mitigates shot noise in the reconstruction of quantum states from measurement data by incorporating physical constraints through semidefinite programming. Finally, we show that quantum generative models, such as quantum generative adversarial networks, can generate synthetic time series that accurately capture both the statistical distributions and temporal correlations of real-world financial data; tasks that are difficult for classical models to achieve. Overall, these results highlight both the opportunities and limitations of noisy quantum computers in modeling and simulating complex dynamical systems.
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 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.
Generative machine learning aims to model probability distributions from sample data. Quantum computers are widely believed to efficiently sample from certain probability distributions that are intractable for classical computers, making quantum circuits promising candidates for generative machine learning. This dissertation investigates quantum generative machine learning models, with a particular focus on Synthetic Data Generation (SDG) and on the Quantum Circuit Born Machine, an algorithm that can be implemented on current quantum hardware. The first part of this dissertation studies SDG algorithms in noiseless simulations. Most of these algorithms rely on an implicit design choice that has not previously been examined: the binary encoding that maps bitstring samples generated by a quantum circuit to real-valued data points. We show that the training performance depends on this choice and analyze the interplay between data structure, circuit ansatz, and encoding. For continuous target distributions, the reflected binary Gray code is particularly effective because it maps similar data points to similar bitstrings and thus preserves the structure of the data. This provides a useful inductive bias that leads, on average, to faster convergence and better synthetic data. We further investigate extensions of SDG algorithms. Contrary to previous findings, we show that quantum models can also learn conditional probability distributions with quality comparable to that of independently trained models. We develop two sample-efficient strategies that enable conditional models to perform classification without additional training. This yields a unified model with both generative and discriminative capabilities. The second part of this dissertation addresses the implementation of such models on real quantum hardware. While current devices can train small-scale models with reasonable resource, larger-scale implementations remain limited by noise. Understanding and modeling this noise is therefore essential for progress. First, we develop a physically motivated noise model for superconducting transmon systems based on Hamiltonian simulation. We show that frequency collisions between energy levels of neighboring transmons can induce crosstalk and may drive the system out of the computational subspace. This model provides a basis for understanding hardware-level error mechanisms and for developing taylored mitigation or correction strategies. Second, we investigate two-qubit error using Long-Sequence Quantum Process Tomography (LS-QPT), assuming well-characterized single-qubit gates. Compared with standard Quantum Process Tomography, LS-QPT reduces the measurement cost by amplifying noise through germ circuits. We show that germ circuits that ideally implement the identity operation amplify a larger subspace of noise processes than other types of germ circuits. We also show that the precision of LS-QPT is fundamentally limited by unlearnable degrees of freedom in the noise model that cannot be amplified. Despite this limitation, the LS-QPT method reduces the total circuit depth required for process tomography by an order of magnitude.
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.
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.
For several decades it has been appreciated that quantum computers hold incredible promise to perform calculations intractable to classical computation. However, this promise has be slow to realize. Dozens of quantum systems are currently being investigated for use in quantum information processing - none of which have yet demonstrated algorithms involving more than a handful of qubits and it remains unclear which, if any, of these systems will ultimately compose a scalable, robust quantum information processing architecture. In this thesis we employ analytical, optimal and algebraic control techniques to evaluate various quantum systems for their potential use in quantum information processing. In doing so, we have additionally identified several novel characterization procedures capable of probing both the coherent and incoherent dynamics of quantum systems. The first part of this thesis discusses work motivated by attempts to utilize donor qubits in silicon as quantum bits. We first propose a measurement of the state of a single donor electron spin using two-dimensional electron gas of a field-effect transistor and electrically detected magnetic resonance. We analyze the potential sensitivity of this measurement and show that it is a quantum nondemolition measurement of an electron-encoded state. We then present the first of two novel qubit characterization procedures. We consider the problem of rapidly characterizing a large number of similarly prepared qubits using techniques from optimal experiment design. All qubits are assumed to evolve according to the same physical processes, though the Hamiltonian parameters may vary from device to device - an inevitability in solid state qubits. We use the Cram\\'er-Rao bound on the variance of a point estimator to construct the optimal series of experiments to estimate these free parameters, and present a complete analysis of the optimal experimental configuration. Though applied to dipole- and exchange-coupled qubits, this technique is widely applicable to other systems. The second part of the thesis discusses the role that control can play in measuring and mitigating noise in qubit systems. Our first result describes a method for quickly simulating the effects of arbitrary markovian noise on qubit systems through the use of a numerically optimized, multi-state Markovian fluctuator. This ability to rapidly simulate the noisy qubit evolution allows us to compute control sequences capable of maximally decoupling the qubit from the noise source. We then introduce the second characterization procedure of the these, showing that a single measurable and controllable qubit may act as a spectrometer of dephasing noise. We show that the formalism of dynamical decoupling can be used to estimate the short-time correlation function of the noise source, while long time correlations may be estimated by a very simple series of free evolution experiments. This technique is applicable to the wide range of physical implementations which suffer from dephasing noise.The final part of this thesis demonstrates that trapped neutral atoms may be utilized for the robust simulation of complex systems exhibiting a topological phase. We present a method to simulate the toric code Hamiltonian stroboscopically, and demonstrate that our technique preserves the ground state degeneracy . Furthermore, we introduce a dissipative mechanism allowing for thermalization of the system to a finite temperature or direct cooling to the ground state manifold.