arXiv subjects

Mateusz Krawczyk

Publications and source records attributed to Mateusz Krawczyk.

6 recordsLinked to original sources

arXiv2026

Learning Hamiltonians for solid-state quantum simulators

We introduce a generalizable framework for identifying effective Hamiltonians directly from experimental data in solid-state quantum systems. Our unsupervised autoencoder-based approach incorporates the governing physics (here, the S-matrix formalism) directly into the decoder, enabling physically meaningful Hamiltonian inference without labeled Hamiltonian parameters. Through numerical experiments on a triple quantum dot chain, we demonstrate automated characterization of programmable solid-state simulators from transport measurements. The model accurately infers Hamiltonian parameters and generalizes beyond the training domain, while exhibiting finite capacity as the parameter space becomes increasingly broad or diverse. We further demonstrate robustness to noisy measurements and show that the model can be successfully trained on transport data generated outside the Hamiltonian family assumed by the physics decoder, while still identifying meaningful effective parameters.

cond-mat.mes-hall↗

arXiv2026

AI-enhanced tuning of quantum dot Hamiltonians toward Majorana modes

We propose a neural network-based model capable of learning the broad landscape of working regimes in quantum dot simulators, and using this knowledge to autotune these devices - based on transport measurements - toward obtaining Majorana modes in the structure. The model is trained in an unsupervised manner on synthetic data in the form of conductance maps, using a physics-informed loss that incorporates key properties of Majorana zero modes. We show that, with appropriate training, a deep vision-transformer network can efficiently memorize relation between Hamiltonian parameters and structures on conductance maps and use it to propose parameters update for a quantum dot chain that drive the system toward topological phase. Starting from a broad range of initial detunings in parameter space, a single update step is sufficient to generate nontrivial zero modes. Moreover, by enabling an iterative tuning procedure - where the system acquires updated conductance maps at each step - we demonstrate that the method can address a much larger region of the parameter space.

cond-mat.mes-hall↗

arXiv2025

Learning quantum tomography from incomplete measurements

We revisit quantum tomography in an informationally incomplete scenario and propose improved state reconstruction methods using deep neural networks. In the first approach, the trained network predicts an optimal linear or quadratic reconstructor with coefficients depending only on the collection of (already taken) measurement operators. This effectively refines the undercomplete tomographic reconstructor based on pseudoinverse operation. The second, based on an LSTM recurrent network performs state reconstruction sequentially. It can also optimize the measurement sequence, which suggests a no-free-lunch theorem for tomography: by narrowing the state space, we gain the possibility of more efficient tomography by learning the optimal sequence of measurements. Numerical experiments for a 2-qubit system show that both methods outperform standard maximum likelihood estimation and also scale to larger 3- and 4-qubit systems. Our results demonstrate that neural networks can effectively learn the underlying geometry of multi-qubit states and use it for their reconstruction.

quant-ph↗

arXiv2025

Learning entanglement from tomography data: contradictory measurement importance for neural networks and random forests

We study the effectiveness of two distinct machine learning techniques, neural networks and random forests, in the quantification of entanglement from two-qubit tomography data. Although we predictably find that neural networks yield better accuracy, we also find that the way that the two methods reach their prediction is starkly different. This is seen by the measurements which arthe most important for the classification. Neural networks follow the intuitive prediction that measurements containing information about non-local coherences are most important for entanglement, but random forests signify the dominance of information contained in occupation measurements. This is because occupation measurements are necessary for the extraction of data about all other density matrix elements from the remaining measurements. The same discrepancy does not occur when the models are used to learn entanglement directly from the elements of the density matrix, so it is the result of the scattering of information and interdependence of measurement data. As a result, the models behave differently when noise is introduced to various measurements, which can be harnessed to obtain more reliable information about entanglement from noisy tomography data.

quant-ph↗

arXiv2024

Identification of quantum entanglement with Siamese convolutional neural networks and semi-supervised learning

Quantum entanglement is a fundamental property commonly used in various quantum information protocols and algorithms. Nonetheless, the problem of identifying entanglement has still not reached a general solution for systems larger than $2\times3$. In this study, we use deep convolutional NNs, a type of supervised machine learning, to identify quantum entanglement for any bipartition in a 3-qubit system. We demonstrate that training the model on synthetically generated datasets of random density matrices excluding challenging positive-under-partial-transposition entangled states (PPTES), which cannot be identified (and correctly labeled) in general, leads to good model accuracy even for PPTES states, that were outside the training data. Our aim is to enhance the model's generalization on PPTES. By applying entanglement-preserving symmetry operations through a triple Siamese network trained in a semi-supervised manner, we improve the model's accuracy and ability to recognize PPTES. Moreover, by constructing an ensemble of Siamese models, even better generalization is observed, in analogy with the idea of finding separate types of entanglement witnesses for different classes of states.

quant-ph↗

arXiv2024

Data-driven criteria for quantum correlations

We build a machine learning model to detect correlations in a three-qubit system using a neural network trained in an unsupervised manner on randomly generated states. The network is forced to recognize separable states, and correlated states are detected as anomalies. Quite surprisingly, we find that the proposed detector performs much better at distinguishing a weaker form of quantum correlations, namely, the quantum discord, than entanglement. In fact, it has a tendency to grossly overestimate the set of entangled states even at the optimal threshold for entanglement detection, while it underestimates the set of discordant states to a much lesser extent. In order to illustrate the nature of states classified as quantum-correlated, we construct a diagram containing various types of states -- entangled, as well as separable, both discordant and non-discordant. We find that the near-zero value of the recognition loss reproduces the shape of the non-discordant separable states with high accuracy, especially considering the non-trivial shape of this set on the diagram. The network architecture is designed carefully: it preserves separability, and its output is equivariant with respect to qubit permutations. We show that the choice of architecture is important to get the highest detection accuracy, much better than for a baseline model that just utilizes a partial trace operation.

quant-ph↗