Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2307.13511 · Physical review. E

Estimating entanglement entropy via variational quantum circuits with classical neural networks

Sangyun Lee, Hyukjoon Kwon, Jae Sung Lee

Published Apr 8, 2024• 6 citations
arXivHTMLPDF

Abstract

Entropy plays a crucial role in both physics and information science, encompassing classical and quantum domains. In this paper, we present the quantum neural entropy estimator (QNEE), an approach that combines classical neural network (NN) with variational quantum circuits to estimate the von Neumann and Rényi entropies of a quantum state. QNEE provides accurate estimates of entropy while also yielding the eigenvalues and eigenstates of the input density matrix. Leveraging the capabilities of classical NN, QNEE can classify different phases of quantum systems that accompany the changes of entanglement entropy. Our numerical simulation demonstrates the effectiveness of QNEE by applying it to the 1D XXZ Heisenberg model. In particular, QNEE exhibits high sensitivity in estimating entanglement entropy near the phase transition point. We expect that QNEE will serve as a valuable tool for quantum entropy estimation and phase classification.

DOI
10.1103/physreve.109.044117

Related papers

Quantum neural estimation of entropies

Ziv Goldfeld, Dhrumil Patel, Sreejith Sreekumar +1 more

Entropy measures quantify the amount of information and correlation present in a quantum system. In practice, when the quantum state is unknown and only copies thereof are available, one must resort to the estimation of such entropy measures. Here we propose a variational quantum algorithm for estimating the von Neumann and R\'enyi entropies, as well as the measured relative entropy and measured R\'enyi relative entropy. Our approach first parametrizes a variational formula for the measure of interest by a quantum circuit and a classical neural network and then optimizes the resulting objective over parameter space. Numerical simulations of our quantum algorithm are provided, using a noiseless quantum simulator. The algorithm provides accurate estimates of the various entropy measures for the examples tested, which renders it a promising approach for usage in downstream tasks.

arXiv:2307.01171•Physical Review A•Mar 25, 2024•16 citations

The expressivity of classical and quantum neural networks on entanglement entropy

Chih-Hung Wu, Ching-Che Yen

Abstract Analytically continuing the von Neumann entropy from Rényi entropies is a challenging task in quantum field theory. While the n -th Rényi entropy can be computed using the replica method in the path integral representation of quantum field theory, the analytic continuation can only be achieved for some simple systems on a case-by-case basis. In this work, we propose a general framework to tackle this problem using classical and quantum neural networks with supervised learning. We begin by studying several examples with known von Neumann entropy, where the input data is generated by representing $${\text {Tr}}\rho _A^n$$ Tr ρ A n with a generating function. We adopt KerasTuner to determine the optimal network architecture and hyperparameters with limited data. In addition, we frame a similar problem in terms of quantum machine learning models, where the expressivity of the quantum models for the entanglement entropy as a partial Fourier series is established. Our proposed methods can accurately predict the von Neumann and Rényi entropies numerically, highlighting the potential of deep learning techniques for solving problems in quantum information theory.

arXiv:2305.00997•The European Physical Journal C•Feb 26, 2024•4 citations

Calculating Rényi entropies with neural autoregressive quantum states

Zhaoyou Wang, Emily J. Davis

Entanglement entropy is an essential metric for characterizing quantum many-body systems, but its numerical evaluation for neural network representations of quantum states has so far been inefficient and demonstrated only for the restricted Boltzmann machine architecture. Here we estimate generalized R\'enyi entropies of autoregressive neural quantum states with up to $N=256$ spins using quantum Monte Carlo methods. A naive ``direct sampling'' approach performs well for low-order R\'enyi entropies but fails for larger orders when benchmarked on a one-dimensional Heisenberg model. We therefore propose an improved ``conditional sampling'' method exploiting the autoregressive structure of the network ansatz, which outperforms direct sampling and facilitates calculations of higher-order R\'enyi entropies in both one- and two-dimensional Heisenberg models. Access to higher-order R\'enyi entropies allows for an approximation of the von Neumann entropy as well as extraction of the single-copy entanglement. Both methods elucidate the potential of neural network quantum states in quantum Monte Carlo studies of entanglement entropy for many-body systems.

arXiv:2003.01358•Physical Review A•Dec 16, 2020•18 citations

Entropy Estimation in Multi-Qutrit Systems via Variational and Classical Neural Networks

Sai Sakunthala Guddanti, Anil Prabhakar, Ria Rushin Joseph

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.

quant-pharXiv:2606.20504•Jun 19, 2026•0 citations

Performance Guarantees for Quantum Neural Estimation of Entropies

Sreejith Sreekumar, Ziv Goldfeld, Mark M. Wilde

Estimating quantum entropies and divergences is an important problem in quantum physics, information theory, and machine learning. Quantum neural estimators (QNEs), which utilize a hybrid classical-quantum architecture, have recently emerged as an appealing computational framework for estimating these measures. Such estimators combine classical neural networks with parametrized quantum circuits, and their deployment typically entails tedious tuning of hyperparameters controlling the sample size, network architecture, and circuit topology. This work initiates the study of formal guarantees for QNEs of measured (Rényi) relative entropies in the form of non-asymptotic error risk bounds. We further establish exponential tail bounds showing that the error is sub-Gaussian and thus sharply concentrates about the ground truth value. For an appropriate sub-class of density operator pairs on a space of dimension $d$ with bounded Thompson metric, our theory establishes a copy complexity of $O(|Θ(\mathcal{U})|d/ε^2)$ for QNE with a quantum circuit parameter set $Θ(\mathcal{U})$, which has minimax optimal dependence on the accuracy $ε$. Additionally, if the density operator pairs are permutation invariant, we improve the dimension dependence above to $O(|Θ(\mathcal{U})|\mathrm{polylog}(d)/ε^2)$. Our theory aims to facilitate principled implementation of QNEs for measured relative entropies and guide hyperparameter tuning in practice.

quant-pharXiv:2511.19289•Quantum•Nov 25, 2025•0 citations

Estimating quantum mutual information through a quantum neural network

Myeongjin Shin, Junseo Lee, Kabgyun Jeong

Abstract We propose a method of quantum machine learning called quantum mutual information neural estimation (QMINE) for estimating von Neumann entropy and quantum mutual information, which are fundamental properties in quantum information theory. The QMINE proposed here basically utilizes a technique of quantum neural networks (QNNs), to minimize a loss function that determines the von Neumann entropy, and thus quantum mutual information, which is believed more powerful to process quantum datasets than conventional neural networks due to quantum superposition and entanglement. To create a precise loss function, we propose a quantum Donsker-Varadhan representation (QDVR), which is a quantum analog of the classical Donsker-Varadhan representation. By exploiting a parameter shift rule on parameterized quantum circuits, we can efficiently implement and optimize the QNN and estimate the quantum entropies using the QMINE technique. Furthermore, numerical observations support our predictions of QDVR and demonstrate the good performance of QMINE.

arXiv:2306.14566•Quantum Information Processing•Feb 9, 2024•17 citations
Entropy plays a crucial role in both physics and information science, encompassing classical and quantum domains. In this paper, we present the quantum neural entropy estimator (QNEE), an approach that combines classical neural network (NN) with variational quantum circuits to estimate the von Neumann and Rényi entropies of a quantum state. QNEE provides accurate estimates of entropy while also yielding the eigenvalues and eigenstates of the input density matrix. Leveraging the capabilities of classical NN, QNEE can classify different phases of quantum systems that accompany the changes of entanglement entropy. Our numerical simulation demonstrates the effectiveness of QNEE by applying it to the 1D XXZ Heisenberg model. In particular, QNEE exhibits high sensitivity in estimating entanglement entropy near the phase transition point. We expect that QNEE will serve as a valuable tool for quantum entropy estimation and phase classification.
Entropy measures quantify the amount of information and correlation present in a quantum system. In practice, when the quantum state is unknown and only copies thereof are available, one must resort to the estimation of such entropy measures. Here we propose a variational quantum algorithm for estimating the von Neumann and R\'enyi entropies, as well as the measured relative entropy and measured R\'enyi relative entropy. Our approach first parametrizes a variational formula for the measure of interest by a quantum circuit and a classical neural network and then optimizes the resulting objective over parameter space. Numerical simulations of our quantum algorithm are provided, using a noiseless quantum simulator. The algorithm provides accurate estimates of the various entropy measures for the examples tested, which renders it a promising approach for usage in downstream tasks.
Abstract Analytically continuing the von Neumann entropy from Rényi entropies is a challenging task in quantum field theory. While the n -th Rényi entropy can be computed using the replica method in the path integral representation of quantum field theory, the analytic continuation can only be achieved for some simple systems on a case-by-case basis. In this work, we propose a general framework to tackle this problem using classical and quantum neural networks with supervised learning. We begin by studying several examples with known von Neumann entropy, where the input data is generated by representing TrρAn{\text {Tr}}\rho _A^nTrρAn​ Tr ρ A n with a generating function. We adopt KerasTuner to determine the optimal network architecture and hyperparameters with limited data. In addition, we frame a similar problem in terms of quantum machine learning models, where the expressivity of the quantum models for the entanglement entropy as a partial Fourier series is established. Our proposed methods can accurately predict the von Neumann and Rényi entropies numerically, highlighting the potential of deep learning techniques for solving problems in quantum information theory.
Entanglement entropy is an essential metric for characterizing quantum many-body systems, but its numerical evaluation for neural network representations of quantum states has so far been inefficient and demonstrated only for the restricted Boltzmann machine architecture. Here we estimate generalized R\'enyi entropies of autoregressive neural quantum states with up to N=256N=256N=256 spins using quantum Monte Carlo methods. A naive ``direct sampling'' approach performs well for low-order R\'enyi entropies but fails for larger orders when benchmarked on a one-dimensional Heisenberg model. We therefore propose an improved ``conditional sampling'' method exploiting the autoregressive structure of the network ansatz, which outperforms direct sampling and facilitates calculations of higher-order R\'enyi entropies in both one- and two-dimensional Heisenberg models. Access to higher-order R\'enyi entropies allows for an approximation of the von Neumann entropy as well as extraction of the single-copy entanglement. Both methods elucidate the potential of neural network quantum states in quantum Monte Carlo studies of entanglement entropy for many-body 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.
Estimating quantum entropies and divergences is an important problem in quantum physics, information theory, and machine learning. Quantum neural estimators (QNEs), which utilize a hybrid classical-quantum architecture, have recently emerged as an appealing computational framework for estimating these measures. Such estimators combine classical neural networks with parametrized quantum circuits, and their deployment typically entails tedious tuning of hyperparameters controlling the sample size, network architecture, and circuit topology. This work initiates the study of formal guarantees for QNEs of measured (Rényi) relative entropies in the form of non-asymptotic error risk bounds. We further establish exponential tail bounds showing that the error is sub-Gaussian and thus sharply concentrates about the ground truth value. For an appropriate sub-class of density operator pairs on a space of dimension ddd with bounded Thompson metric, our theory establishes a copy complexity of O(∣Θ(U)∣d/ε2)O(|Θ(\mathcal{U})|d/ε^2)O(∣Θ(U)∣d/ε2) for QNE with a quantum circuit parameter set Θ(U)Θ(\mathcal{U})Θ(U), which has minimax optimal dependence on the accuracy εεε. Additionally, if the density operator pairs are permutation invariant, we improve the dimension dependence above to O(∣Θ(U)∣polylog(d)/ε2)O(|Θ(\mathcal{U})|\mathrm{polylog}(d)/ε^2)O(∣Θ(U)∣polylog(d)/ε2). Our theory aims to facilitate principled implementation of QNEs for measured relative entropies and guide hyperparameter tuning in practice.
Abstract We propose a method of quantum machine learning called quantum mutual information neural estimation (QMINE) for estimating von Neumann entropy and quantum mutual information, which are fundamental properties in quantum information theory. The QMINE proposed here basically utilizes a technique of quantum neural networks (QNNs), to minimize a loss function that determines the von Neumann entropy, and thus quantum mutual information, which is believed more powerful to process quantum datasets than conventional neural networks due to quantum superposition and entanglement. To create a precise loss function, we propose a quantum Donsker-Varadhan representation (QDVR), which is a quantum analog of the classical Donsker-Varadhan representation. By exploiting a parameter shift rule on parameterized quantum circuits, we can efficiently implement and optimize the QNN and estimate the quantum entropies using the QMINE technique. Furthermore, numerical observations support our predictions of QDVR and demonstrate the good performance of QMINE.