We present a systematic study of von Neumann entropy estimation in multi-qutrit quantum systems using two complementary approaches: variational quantum algorithms (VQAs) and classical convolutional neural networks (CNNs), evaluated using an ideal (noise-free) quantum simulator. For systems up to three qutrits, we construct and evaluate 11 hardware-efficient SU(3)-inspired ansatzes. A parameter sweep shows that estimation accuracy is primarily determined by the number of trainable parameters, provided sufficient entanglement is present. Based on this study, we fix the parameter count to approximately 120 for subsequent experiments, observing that increasing entangling-gate counts beyond a threshold yields only marginal improvements. For larger systems (two to five qutrits), we use a CNN trained on measurement outcomes from tensor-product mutually unbiased bases. The model achieves accurate and stable predictions and exhibits a systematic improvement in performance with system size, with the highest errors for two-qutrit systems and the lowest for five-qutrit systems. Notably, using only 12.5% of the measurements required for full state tomography is sufficient to reach 90th-percentile absolute errors of approximately 0.13-0.16 nats for both four- and five-qutrit systems. The CNN model is also robust to shot noise and generalizes well to out-of-distribution states. Overall, within the simulated settings studied here, our results indicate a transition in practical methods: VQAs are effective for small systems, while CNN-based estimators offer improved scalability and robustness for larger qutrit systems.
We present a systematic study of von Neumann entropy estimation in multi-qutrit quantum systems using two complementary approaches: variational quantum algorithms (VQAs) and classical convolutional neural networks (CNNs), evaluated using an ideal (noise-free) quantum simulator. For systems up to three qutrits, we construct and evaluate 11 hardware-efficient SU(3)-inspired ansatzes. A parameter sweep shows that estimation accuracy is primarily determined by the number of trainable parameters, provided sufficient entanglement is present. Based on this study, we fix the parameter count to approximately 120 for subsequent experiments, observing that increasing entangling-gate counts beyond a threshold yields only marginal improvements. For larger systems (two to five qutrits), we use a CNN trained on measurement outcomes from tensor-product mutually unbiased bases. The model achieves accurate and stable predictions and exhibits a systematic improvement in performance with system size, with the highest errors for two-qutrit systems and the lowest for five-qutrit systems. Notably, using only 12.5% of the measurements required for full state tomography is sufficient to reach 90th-percentile absolute errors of approximately 0.13-0.16 nats for both four- and five-qutrit systems. The CNN model is also robust to shot noise and generalizes well to out-of-distribution states. Overall, within the simulated settings studied here, our results indicate a transition in practical methods: VQAs are effective for small systems, while CNN-based estimators offer improved scalability and robustness for larger qutrit systems.
Abstract We present a systematic comparative analysis of machine learning and traditional approaches for quantum entanglement characterization in bi-partite ququart systems. Quantifying entanglement traditionally requires full quantum state tomography, necessitating Nmub2D2Ncop measurements, where Nmub is the number of mutually unbiased bases, D is the subsystem dimensionality, and Ncop is the number of identical copies. For ququart systems with D=4, this translates to hundreds of distinct measurement settings, each requiring multiple copies (Ncop typically in thousands)—resulting in hundreds of thousands of total measurements in practice. Our research demonstrates that neural networks achieve comparable or superior accuracy with orders of magnitude fewer measurement settings. We evaluate three architectures—Multi-Layer Perceptron (MLP), Convolutional Neural Network (CNN), and Transformer—against Maximum Likelihood Estimation (MLE) and Bayesian methods across measurement counts ranging from 10 to 400. Neural approaches achieve up to 1650× faster computation times compared to traditional methods while maintaining competitive accuracy. At 100 measurements, the Transformer achieves Mean Squared Error (MSE) of 1.49×10−1, while MLE yields 2.04×10−1—over 10× higher error—despite taking 178 times longer. All neural methods in our study show error reduction scaling as approximately 1/N with increased measurements. While this observed scaling might be influenced by our specific architectures, it provides important practical guidance for experimental design. The Transformer architecture demonstrates exceptional sample efficiency, achieving with 100 measurements what traditional methods require 250-400 measurements to accomplish—a significant advantage for resource-constrained quantum experiments. This research provides a viable pathway for real-time entanglement characterization in higher-dimensional quantum systems where traditional methods become computationally prohibitive.
Abstract Modern day quantum simulators can prepare a wide variety of quantum states but the accurate estimation of observables from tomographic measurement data often poses a challenge. We tackle this problem by developing a quantum state tomography scheme which relies on approximating the probability distribution over the outcomes of an informationally complete measurement in a variational manifold represented by a convolutional neural network. We show an excellent representability of prototypical ground- and steady states with this ansatz using a number of variational parameters that scales polynomially in system size. This compressed representation allows us to reconstruct states with high classical fidelities outperforming standard methods such as maximum likelihood estimation. Furthermore, it achieves a reduction of the estimation error of observables by up to an order of magnitude compared to their direct estimation from experimental data.
Convolutional neural networks (CNNs) have been employed along with variational Monte Carlo methods for finding the ground state of quantum many-body spin systems with great success. However, it remains uncertain how CNNs, with a model complexity that scales at most linearly with the number of particles, solve the “curse of dimensionality” and efficiently represent wavefunctions in exponentially large Hilbert spaces. In this work, we use methodologies from information theory, group theory and machine learning, to elucidate how CNN captures relevant physics of quantum systems. We connect CNNs to a class of restricted maximum entropy (MaxEnt) and entangled plaquette correlator product state (EP-CPS) models that approximate symmetry constrained classical correlations between subsystems. For the final part of the puzzle, inspired by similar analyses for matrix product states and tensor networks, we show that the CNNs rely on the spectrum of each subsystem's entanglement Hamiltonians as captured by the size of the convolutional filter. All put together, these allow CNNs to simulate exponential quantum wave functions using a model that scales at most linear in system size as well as provide clues into when CNNs might fail to simulate Hamiltonians. We incorporate our insights into a new training algorithm and demonstrate its improved efficiency, accuracy, and robustness. Finally, we use regression analysis to show how the CNNs solutions can be used to identify salient physical features of the system that are the most relevant to an efficient approximation. Our integrated approach can be extended to similarly analyzing other neural network architectures and quantum spin systems.
The remarkable generalization capabilities of overparameterized neural networks remain one of the most profound mysteries in modern machine learning. Despite having sufficient capacity to simply memorize training data, these networks consistently achieve superior performance on unseen test examples. Traditional analyses focusing on weight distributions, loss landscapes, and optimization dynamics have provided partial insights but fail to capture the complex correlational structure that emerges between neurons during learning. This paper introduces a comprehensive quantum information framework for analyzing neural network representations, treating hidden layer activations as quantum states and characterizing them through density matrices, von Neumann entropy, purity, and related quantum information metrics. Through systematic experiments on synthetic classification tasks and algorithmic reasoning problems spanning over 3000 cumulative training epochs and 5000 Wang-Landau sampling iterations, we demonstrate that these quantum metrics reveal structure completely invisible to classical analysis. Our results show that stochastic gradient descent systematically reduces von Neumann entropy while increasing purity as networks learn, transitioning from highly mixed quantum states with entropy approximately 1.42 and purity approximately 0.29 to purer configurations with entropy approximately 1.19 and purity approximately 0.37 that achieve superior test accuracy of 99.5%. Using Wang-Landau sampling to explore the equilibrium entropy landscape, we discover that neural networks naturally favor high-entropy states with entropy approximately 1.42 and moderate accuracy of 62.0%, and that optimization actively purifies the quantum state to achieve task performance. On modular arithmetic tasks exhibiting the grokking phenomenon, we observe that von Neumann entropy increases dramatically from 1.55 to 3.29, representing a 112% increase, during an extended 2000-epoch memorization phase before any improvement in generalization, while purity decreases correspondingly from 0.444 to 0.042, a 90.5% decrease, approaching the maximally mixed limit of 0.01. This entropy accumulation phase appears necessary for eventual generalization, with the network building quantum correlations at a rate of approximately 0.00097 nats per epoch during the plateau. Weight entropy, in contrast, shows minimal change of only 11% increase over the same period. Correlation analysis reveals that von Neumann entropy and purity are almost perfectly anticorrelated with a correlation coefficient of 1 -0.99, while weight entropy shows weak correlation with quantum metrics with absolute correlation coefficients less than 0.3. The effective rank of the density matrix stabilizes near 2.7 to 3.0 for the 6-neuron classifier, indicating that the network effectively uses approximately three independent activation modes. These findings establish quantum information metrics as powerful tools for understanding neural network learning dynamics, provide the first quantitative evidence for the entropy accumulation interpretation of grokking, and suggest that neural networks undergo a quantum-inspired phase transition during learning. We discuss implications for generalization theory, optimization algorithm design, and the statistical physics of deep learning, and outline a comprehensive research agenda for extending these methods to larger architectures and more complex tasks.
The remarkable generalization capabilities of overparameterized neural networks remain one of the most profound mysteries in modern machine learning. Despite having sufficient capacity to simply memorize training data, these networks consistently achieve superior performance on unseen test examples. Traditional analyses focusing on weight distributions, loss landscapes, and optimization dynamics have provided partial insights but fail to capture the complex correlational structure that emerges between neurons during learning. This paper introduces a comprehensive quantum information framework for analyzing neural network representations, treating hidden layer activations as quantum states and characterizing them through density matrices, von Neumann entropy, purity, and related quantum information metrics. Through systematic experiments on synthetic classification tasks and algorithmic reasoning problems spanning over 3000 cumulative training epochs and 5000 Wang-Landau sampling iterations, we demonstrate that these quantum metrics reveal structure completely invisible to classical analysis. Our results show that stochastic gradient descent systematically reduces von Neumann entropy while increasing purity as networks learn, transitioning from highly mixed quantum states with entropy approximately 1.42 and purity approximately 0.29 to purer configurations with entropy approximately 1.19 and purity approximately 0.37 that achieve superior test accuracy of 99.5%. Using Wang-Landau sampling to explore the equilibrium entropy landscape, we discover that neural networks naturally favor high-entropy states with entropy approximately 1.42 and moderate accuracy of 62.0%, and that optimization actively purifies the quantum state to achieve task performance. On modular arithmetic tasks exhibiting the grokking phenomenon, we observe that von Neumann entropy increases dramatically from 1.55 to 3.29, representing a 112% increase, during an extended 2000-epoch memorization phase before any improvement in generalization, while purity decreases correspondingly from 0.444 to 0.042, a 90.5% decrease, approaching the maximally mixed limit of 0.01. This entropy accumulation phase appears necessary for eventual generalization, with the network building quantum correlations at a rate of approximately 0.00097 nats per epoch during the plateau. Weight entropy, in contrast, shows minimal change of only 11% increase over the same period. Correlation analysis reveals that von Neumann entropy and purity are almost perfectly anticorrelated with a correlation coefficient of 1-0.99, while weight entropy shows weak correlation with quantum metrics with absolute correlation coefficients less than 0.3. The effective rank of the density matrix stabilizes near 2.7 to 3.0 for the 6-neuron classifier, indicating that the network effectively uses approximately three independent activation modes. These findings establish quantum information metrics as powerful tools for understanding neural network learning dynamics, provide the first quantitative evidence for the entropy accumulation interpretation of grokking, and suggest that neural networks undergo a quantum-inspired phase transition during learning. We discuss implications for generalization theory, optimization algorithm design, and the statistical physics of deep learning, and outline a comprehensive research agenda for extending these methods to larger architectures and more complex tasks.
Quantum entanglement detection is one of the fundamental tasks in quantum information science. Conventional methods for quantum state tomography exhibit limitations in scalability as the number of qubits increases, leading to exponential growth in the number of unknown parameters and required measurements. Consequently, the accuracy enhancement achieved by these methods is constrained. In response to this challenge, we developed a tailored convolutional neural network (CNN) model capable of effectively detecting entanglement in two-qubit quantum states, achieving an accuracy exceeding 97.5%. Notably, even in the presence of noise, this model retains its robust performance, displaying resilience against a tolerable level of noise contamination. Furthermore, the inherent generalization power of CNNs allows our model, which was initially trained on a specific spectrum of quantum states, to extend its applicability to wider states, positioning it as an outstanding tool for the further application of machine learning in the field of quantum computing, opening up new pathways for solving entanglement detection problems in quantum information.