quant-phJun 18, 2026

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

Authors: Sai Sakunthala GuddantiAnil PrabhakarRia Rushin Joseph

Organizations: Centre for Q. Info, Comm. and Computing, IIT Madras, Chennai 600036, India · Department of Electrical Engineering, IIT Madras, Chennai 600036, India · School of Information Technology, Deakin University, Burwood, Victoria 3125, Australia

Abstract

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.

Explore similar work

Aug 7, 2026cs.PF

Classical \mathrm{SU}(2) Models Match or Exceed Shallow Variational Quantum Circuits on Vision Benchmarks

Quaternion-valued neural networks and variational quantum circuits (VQCs) both derive local transformations from SU(2)\mathrm{SU}(2) geometry, yet their performance on classical supervised learning remains poorly understood. We compare real-valued, quaternion-valued, and quantum classification heads on identical frozen features across MNIST, FashionMNIST, and CIFAR-10. CIFAR-10 uses a learned 16-dimensional bottleneck and frozen ImageNet-pretrained ResNet18 features to separate architecture from representation quality. Quaternion classifiers match or approach real-valued baselines while outperforming shallow VQCs. On MNIST and FashionMNIST, quaternion networks nearly equal real-valued MLPs, whereas product-state VQCs show lower accuracy and higher cost. On CIFAR-10, quaternion networks retain 94--97% of real-valued performance and remain stable under a 32-fold increase in dimensionality. Product-state circuits underperform quaternion classifiers, while entanglement gives modest grayscale gains but reverses under pretrained CNN features (9.25 pp degradation vs.\ product-state). Fubini--Study/QFI natural gradients improve geometric alignment but not short-horizon loss reduction vs.\ Adam. A Friedman test on five-seed MNIST detects model differences (χ2=12.796χ^2=12.796, p=0.0051p=0.0051, n=5n=5), with Wilcoxon tests yielding large effect sizes (d>5d>5) for QuatNet vs.\ quantum comparisons. For FashionMNIST and CIFAR-10, large effects (d>2.0d>2.0) are the primary statistic given n=3n=3. These results indicate that quaternion networks provide efficient, stable SU(2)\mathrm{SU}(2) alternatives to shallow VQCs on tasks lacking intrinsic quantum structure. Shared local SU(2)\mathrm{SU}(2) geometry and shallow entanglement are insufficient, within the regime studied, to confer practical quantum advantage. Conclusions are limited to shallow, measurement-limited circuits on such tasks.
Christopher Fulton, Irene Tsapara, Lawrence Fulton
Jun 11, 2026cond-mat.dis-nn

Low-variance estimators overcome the phase-gradient bottleneck in complex-valued neural quantum states

Complex neural quantum states are difficult to optimize when their wavefunction phase carries gauge, chiral, fermionic, or topological structure. We show that the major failure mode is not only ansatz expressivity, but the Monte Carlo estimator used to learn this phase. For separated amplitude-phase states, differentiating the local energy at fixed samples gives a different unbiased estimator of the same variational Monte Carlo phase force, without changing the objective. We further extend the construction to coupled two-head networks by keeping the amplitude-gradient contribution and applying the direct derivative only to the phase path. An adaptive minimum-variance mixture interpolates between standard and direct estimators during training. Across flux ladders, chiral chains, two-dimensional flux cylinders, an interacting fermion ladder, shared-network controls, and a fractional quantum Hall benchmark, the resulting estimators reduce phase-gradient variance, suppress seed failures, and often move multi-percent standard-gradient plateaus to sub-percent accuracy.
Yi-Ran Xue, Rui Wang, Baigeng Wang +1
Jun 2, 2026quant-ph

Scalable On-Hardware Training of Quantum Neural Networks and Application to Clinical Data Imputation

Training quantum neural networks (QNNs) on quantum hardware is currently bottlenecked by the cost of gradient estimation: standard parameter-shift methods require a number of circuit evaluations that grows quadratically with the number of trainable parameters, making hardware-based optimisation impractical beyond small system sizes. In this work, we introduce a training framework that reduces this cost to logarithmic in the number of qubits, making gradient-based QNN optimisation feasible on near-term hardware at increasing scales. Our framework combines three co-designed ingredients: (i) a structured, subspace-preserving Butterfly circuit architecture with O(nlogn)O(n \log n) parameters and logarithmic depth; (ii) a layer-wise training strategy that confines on-hardware optimisation to one small, well-structured layer at a time; and (iii) a parallelised parameter-shift rule that exploits the commuting structure within each Butterfly layer to extract all gradients in a constant number of circuit executions. Together these reduce the number of distinct circuit evaluations per optimisation step from O(n2)O(n^2) to O(logn)O(\log n). We validate the framework on clinical data imputation using the MIMIC-III electronic health record dataset, a demanding benchmark sensitive to optimisation instability and model variance. Hybrid classical-quantum models are trained directly on IonQ Forte Enterprise trapped-ion hardware at 16 qubits without performance degradation relative to ideal or noisy simulation and via tensor-network simulation at 32 qubits, with 32-qubit inference executed on hardware. The resulting models match or exceed strong classical neural baselines in downstream patient survival prediction while exhibiting reduced variance across runs, demonstrating that the proposed framework enables practical, scalable QNN training under realistic hardware constraints.
Natansh Mathur, Panagiotis Kl. Barkoutsos, Masako Yamada +2