Skip to main content
Kent Academic Repository

Artificial Intelligence Approaches to Quantum Materials: Quantifying Entanglement

Tula, Tymoteusz (2025) Artificial Intelligence Approaches to Quantum Materials: Quantifying Entanglement. Doctor of Philosophy (PhD) thesis, University of Kent,. (doi:10.22024/UniKent/01.02.111211) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided) (KAR id:111211)

PDF
Language: English

Restricted to Repository staff only until August 2026.

Contact us about this publication
[thumbnail of 3tula2025phdfinal.pdf]
Official URL:
https://doi.org/10.22024/UniKent/01.02.111211

Abstract

Artificial intelligence has gained much interest over the last years - broadly, but also in the field of physics specifically. Here we present a numerical study of machine learning (ML) methods applied to data analysis for strongly correlated quantum systems. The main goal of this work is to establish a framework for entanglement learning: an application of neural networks (NNs) - a supervised ML technique - to detect the entanglement of many-body magnetic systems at finite temperatures. As a preliminary result, we applied an unsupervised ML technique called principal component analysis (PCA) to detect superconducting phase transitions in exotic magnetic materials from real-life muon spectroscopy data. We find that the PCA can identify phase transition points correctly, even when the data vary in a subtle manner, which proves to be difficult for more traditional methods. Moreover, the joint PCA of data from materials with vastly different magnetic properties and different kinds of phase transitions enhances rather than diminishes the performance of the method. In order to demonstrate that the entanglement can in principle be learned, we first examine to which extent the two-point correlators constrain entanglement measures. To this end, we conduct a study of the fitness landscape of neutron-scattering functions obtained from Heisenberg-like Hamiltonians. We discover that the fitness landscape shows a linear correlation as a function of distances between quantum states at zero temperature, and a sub-linear correlation for finite temperatures. This makes the scattering functions - or closely related two-point correlators and structure factors - perfect candidates as input for entanglement learning. We find that entanglement entropy can be correctly predicted by NNs from previously mentioned observables, even when trained on a fraction of the full data set, or when trained on data from a different system than the one for which the prediction is made. Specifically, when trained on observables from an anisotropic transverse-field XY model, in order to obtain an accurate prediction, we only require 3% (6%) of the data to train the network if using the dynamic two-point correlators (structure factors) for learning.

Item Type: Thesis (Doctor of Philosophy (PhD))
Thesis advisor: Quintanilla, Jorge
Thesis advisor: Möller, Gunnar
DOI/Identification number: 10.22024/UniKent/01.02.111211
Uncontrolled keywords: Condensed matter physics, Quantum entanglement, Artificial intelligence, Machine learning, Tensor networks, Principal component analysis, Convolutional neural networks, Muon spectroscopy, Magnetic Hamiltonians, Quantum state tomography, Neutron scattering functions
Subjects: Q Science
Institutional Unit: Schools > School of Engineering, Mathematics and Physics > Physics and Astronomy
Former Institutional Unit:
There are no former institutional units.
Funders: University of Kent (https://ror.org/00xkeyj56)
SWORD Depositor: System Moodle
Depositing User: System Moodle
Date Deposited: 09 Sep 2025 15:10 UTC
Last Modified: 10 Sep 2025 15:54 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/111211 (The current URI for this page, for reference purposes)

University of Kent Author Information

Tula, Tymoteusz.

Creator's ORCID:
CReDIT Contributor Roles:
  • Depositors only (login required):

Total unique views of this page since July 2020. For more details click on the image.