Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 3
Encontrada(s) 1 página(s)

DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Pseudospectral method for solving PDEs using matrix product states

  • Gidi, Jorge
  • García-Molina, Paula
  • Tagliacozzo, Luca
  • García-Ripoll, Juan José
22 pages, 12 figures, 6 tables, This research focuses on solving time-dependent partial differential equations (PDEs), in particular the time-dependent Schrödinger equation, using matrix product states (MPS). We propose an extension of Hermite Distributed Approximating Functionals (HDAF) to MPS, a highly accurate pseudospectral method for approximating functions of derivatives. Integrating HDAF into an MPS finite precision algebra, we test four types of quantum-inspired algorithms for time evolution: explicit Runge-Kutta methods, Crank-Nicolson method, explicitly restarted Arnoldi iteration and split-step. The benchmark problem is the expansion of a particle in a quantum quench, characterized by a rapid increase in space requirements, where HDAF surpasses traditional finite difference methods in accuracy with a comparable cost. Moreover, the efficient HDAF approximation to the free propagator avoids the need for Fourier transforms in split-step methods, significantly enhancing their performance with an improved balance in cost and accuracy. Both approaches exhibit similar error scaling and run times compared to FFT vector methods; however, MPS offer an exponential advantage in memory, overcoming vector limitations to enable larger discretizations and expansions. Finally, the MPS HDAF split-step method successfully reproduces the physical behavior of a particle expansion in a double-well potential, demonstrating viability for actual research scenarios., This work has been supported by Spanish Projects No. PID2021-127968NB-I00 and No. PDC2022-133486-I00, funded by MCIN/AEI/10.13039/501100011033 and by the European Union “NextGenerationEU”/PRTR”1. This work was also supported by the Ministry for Digital Transformation and of Civil Service of the Spanish Government through the QUANTUM ENIA project call - Quantum Spain project, and by the European Union through the Recovery, Transformation and Resilience Plan - NextGenerationEU within the framework of the Digital Spain 2026 Agenda. PGM acknowledges the funding by “FSE invierte en tu futuro” through an FPU Grant FPU19/03590 and by MCIN/AEI/10.13039/501100011033. JJGR and PGM acknowledge support from CSIC Interdisciplinary Thematic Platform (PTI) Quantum Technologies (PTIQTEP+). JG was supported by the Chilean National Agency for Research and Development (ANID-Chile), program “Doctorado Nacional 2020”, scholarship No. 21202616. The authors also gratefully acknowledge the Scientific Computing Area (AIC), SGAI-CSIC, for their assistance while using the DRAGO Supercomputer to perform the simulations., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Problem hardness of diluted Ising models: Population annealing versus simulated annealing

  • Martínez-García, Fernando
  • Porras, Diego
10 pages, 10 figures, 1 table, Population annealing is a variant of the simulated annealing algorithm that improves the quality of the thermalization process in systems with rough free-energy landscapes by introducing a resampling process. We consider the diluted Sherrington-Kirkpatrick Ising model using population annealing to study its efficiency in finding solutions to combinatorial optimization problems. From this study, we find an easy-hard-easy transition in the model hardness as the problem instances become more diluted and associate this behavior to the clusterization and connectivity of the underlying Erdős-Rényi graphs. We calculate the efficiency of obtaining minimum energy configurations and find that population annealing outperforms simulated annealing for the cases close to this hardness peak while reaching similar efficiencies in the easy limits. Finally, it is known that population annealing can be used to define an adaptive inverse temperature annealing schedule. We compare this adaptive method to a linear schedule and find that the adaptive method achieves improved efficiencies while being robust against final temperature miscalibrations., This project has been supported by Spanish Projects No. PID2021-127968NB-I00 and No. PDC2022-133486- I00, funded by MCIN/AEI/10.13039/501100011033, by the European Union “NextGenerationEU”/PRTR-1, and CSIC Interdisciplinary Thematic Platform (PTI) Quantum Technologies (PTI-QTEP). D.P. acknowledges support by the Ministry for Digital Transformation and of Civil Service of the Spanish Government through the QUANTUM ENIA project call - Quantum Spain project and by the European Union through the Recovery, Transformation and Resilience Plan - NextGenerationEU within the framework of the Digital Spain 2026 Agenda. We acknowledge both the Scientific Computing Area (AIC), SGAI-CSIC, for their assistance while using the DRAGO Supercomputer and Centro de Supercomputación de Galicia (CESGA) who provided access to the supercomputer FinisTerrae for performing the simulations., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Optimised feature subset selection via simulated annealing

  • Martínez-García, Fernando
  • Rubio-García, A.
  • Fernández-Lorenzo, S.
  • García-Ripoll, Juan José
  • Porras, Diego
10 pages, 2 figures, 1 table, We introduce a novel algorithm for ℓ 0-norm feature selection that formulates the task as a combinatorial optimisation problem solved through Simulated Annealing (SA) to optimise the Fisher Discriminant Ratio (FDR), which serves as a computationally efficient proxy for model quality in classification tasks. The resulting SA-FDR algorithm is evaluated on multiple publicly available datasets with up to hundreds of thousands of samples and hundreds of features, consistently achieving high predictive accuracy while selecting more compact feature subsets than other commonly used algorithms such as recursive feature elimination or Lasso. This ability to recover informative yet minimal sets of features stems from its capacity to capture inter-feature dependencies often missed by greedy optimisation approaches. Therefore, SA-FDR constitutes a flexible and effective approach for designing models in high-dimensional settings, particularly when model sparsity, interpretability, and performance are crucial., This project has been supported by Spanish Project No. PDC2022-133486-I00, funded by MCIN/AEI/10.13039/501100011033 and by the European Union ‘NextGenerationEU’/PRTR’1; and CSIC Interdisciplinary Thematic Platform (PTI) Quantum Technologies (PTI-QTEP)., Peer reviewed