Related papers: A Polynomial Time Quantum Algorithm for Exponentia…
Quantum computing holds great promise to accelerate scientific computations in fluid dynamics and other classical physical systems. While various quantum algorithms have been proposed for linear flows, developing quantum algorithms for…
The connection of Taylor maps and polynomial neural networks (PNN) to solve ordinary differential equations (ODEs) numerically is considered. Having the system of ODEs, it is possible to calculate weights of PNN that simulates the dynamics…
Neural Ordinary Differential Equations (ODEs) are elegant reinterpretations of deep networks where continuous time can replace the discrete notion of depth, ODE solvers perform forward propagation, and the adjoint method enables efficient,…
Machine learning algorithms perform well on identifying patterns in many different datasets due to their versatility. However, as one increases the size of the dataset, the computation time for training and using these statistical models…
The efficient validation of quantum devices is critical for emerging technological applications. In a wide class of use-cases the precise engineering of a Hamiltonian is required both for the implementation of gate-based quantum information…
Current universal quantum computers have a limited number of noisy qubits. Because of this, it is difficult to use them to solve large-scale complex optimization problems. In this paper we tackle this issue by proposing a quantum…
In this thesis, we investigate whether quantum algorithms can be used in the field of machine learning for both long and near term quantum computers. We will first recall the fundamentals of machine learning and quantum computing and then…
Nonautonomous linear ordinary differential equations of the form $\dot{v}(t) = A(t)\, v(t)$, where $A(t)$ is non-skew-symmetric, are often used to describe nonunitary dynamics in a variety of fields that range from open quantum system…
State-of-the-art noisy intermediate-scale quantum devices (NISQ), although imperfect, enable computational tasks that are manifestly beyond the capabilities of modern classical supercomputers. However, present quantum computations are…
We consider quantum computational models defined via a Lie-algebraic theory. In these models, specified initial states are acted on by Lie-algebraic quantum gates and the expectation values of Lie algebra elements are measured at the end.…
Recent advances in solving ordinary differential equations (ODEs) with neural networks have been remarkable. Neural networks excel at serving as trial functions and approximating solutions within functional spaces, aided by gradient…
We show a general method allowing the solution calculation, in the form of a power series, for a very large class of nonlinear Ordinary Differential Equations (ODEs), namely the real analytic $\sigma\pi$-ODEs (and, more in general, the real…
Simulating Hamiltonian dynamics is one of the most fundamental and significant tasks for characterising quantum materials. Recently, a series of quantum algorithms employing block-encoding of Hamiltonians have succeeded in providing…
In recent years there has been a considerable drive towards data-driven analysis, discovery and control of dynamical systems. To this end, operator theoretic methods, namely, Koopman operator methods have gained a lot of interest. In…
Quantum computing uses the physical principles of very small systems to develop computing platforms which can solve problems that are intractable on conventional supercomputers. There are challenges not only in building the required…
Simulating nonlinear classical dynamics on a quantum computer is an inherently challenging task due to the linear operator formulation of quantum mechanics. In this work, we provide a systematic approach to alleviate this difficulty by…
Simulating noninteracting fermion systems is a common task in computational many-body physics. In absence of translational symmetries, modeling free fermions on $N$ modes usually requires poly$(N)$ computational resources. While often…
Koopman analysis provides a general framework from which to analyze a nonlinear dynamical system in terms of a linear operator acting on an infinite-dimensional observable space. This theoretical framework provides a rigorous underpinning…
The challenge of finding exact and finite-dimensional Koopman embeddings of nonlinear systems has been largely circumvented by employing data-driven techniques to learn models of different complexities (e.g., linear, bilinear, input…
We define an observable-space framework of Quantum Koopman Algorithms (QKAs) for simulating the dynamics of both linear quantum and nonlinear classical systems, based on approximately closed sets of observables and efficient coherent…