Quantum computing and quantum-inspired numerical methods. Application to problems in condensed matter physics and other fields

Speaker: Paula García Molina
Affiliation: IFF - CSIC
Date: Tuesday, 21 January 2025 at 14:00
Location: Seminar Room, Serrano 121 (CFMAC)

Partial differential equations (PDEs) are relevant for solving real-world problems across many areas. However, their solution may be challenging, especially for large-dimensional or high-resolution problems with high memory demands. This thesis develops new quantum and quantum-inspired numerical analysis methods for solving PDEs with potential memory and time savings while maintaining high accuracy. First, we resort to quantum computing, which benefits from exponential encoding advantages and speedups in key operations. Due to the lack of error correction of existing quantum computers, we propose a variational quantum algorithm to solve Hamiltonian PDEs, combining a classical and a quantum computer to exploit the properties of the quantum register. However, the noise sources and limited number of measurements of current quantum devices restrict the scalability of this approach. The high efficiency of the quantum register function encoding motivates its use in developing quantum-inspired algorithms. The second part of the thesis focuses on creating a matrix product state (MPS) finite precision algebra and applying it to quantum-inspired numerical analysis. More concretely, we develop MPS methods to solve static and time-dependent PDEs, motivated by the solution of problems of physical interest: the study of superconducting circuits and the expansion of a particle’s wavefunction in the context of levitodynamics. Using a two-dimensional squeezed harmonic oscillator of up to $2^{30}$ points as a benchmark, MPS methods for Hamiltonian PDEs show exponential memory advantage compared to vector implementations and asymptotic advantage in time while achieving a low error in the solution approximation. Similarly, the time evolution MPS techniques demonstrate exponential memory compression and comparable accuracy and cost to standard vector methods. We conclude that the MPS framework constitutes a memory-efficient and accurate tool for solving PDEs. These findings present new opportunities for applying quantum-inspired algorithms to a wider range of PDEs and numerical analysis problems, opening exciting avenues for future research and applications.