The paper introduces a variational framework that combines a classical neural network with a parameterized quantum circuit to solve Lindblad master equations. It represents the density matrix via purification, guaranteeing physical properties, and evaluates gradients exactly using the parameter‑shift rule. The authors also derive an upper bound on the covering number of this compositional model, compare it to purely quantum neural networks, and provide numerical evidence supporting both accuracy and theoretical predictions about gradient concentration.
arXiv:2606. 14822v1 Announce Type: cross Abstract: Recent advances in Machine Learning have transformed numerous industrial sectors, yet classical paradigms face fundamental limitations: rapidly growing data volumes, rising computational costs, significant energy consumption, and the physical scaling limits of conventional hardware architectures.
arXiv:2605. 28690v2 Announce Type: replace-cross Abstract: Many applications in quantum simulation, quantum chemistry, and quantum machine learning require not a single quantum state but an ensemble of states characterizing the heterogeneity of a target system.
arXiv:2509. 14026v2 Announce Type: replace-cross Abstract: Variational quantum circuits (VQCs) are central to quantum machine learning, while recent progress in Kolmogorov-Arnold networks (KANs) highlights the power of learnable activation functions.
arXiv:2608. 00850v1 Announce Type: new Abstract: Physics-informed neural networks (PINNs) have emerged as a versatile approach for solving nonlinear partial differential equations (PDEs), yet achieving high accuracy efficiently using these techniques remains challenging for high-dimensional or multiscale systems.
arXiv:2503. 13647v2 Announce Type: replace-cross Abstract: In this work, a novel algorithm structured on Lie algebras for the approximate quantum state preparation problem is proposed, addressing a challenge of fundamental importance in many areas of quantum computing.
arXiv:2607. 05000v1 Announce Type: cross Abstract: Canonical quantization provides a systematic procedure for constructing quantum models from classical Hamiltonians.
arXiv:2606. 31536v1 Announce Type: new Abstract: As Quantum Machine Learning (QML) transitions toward practical implementation, the field faces a critical architectural bottleneck that challenges the fundamental assumptions of classical statistical learning theory.
arXiv:2609.06307v1 Announce Type: cross Abstract: We study variational quantum distribution learning through a hierarchy of Walsh--Fourier approximations on the Boolean cube. At each level, a selecte...
arXiv:2608. 01194v1 Announce Type: cross Abstract: Artificial intelligence has been transformed by deep neural networks, yet the search for new learning architectures continues.
The paper introduces HELIA, a Hardware‑Efficient and Dynamical Lie‑Algebra Supported Ansatz, and two hybrid training methods that combine classical‑enhanced gradient computation with the quantum Parameter‑Shift Rule. By distributing gradient estimation between classical and quantum hardware, the authors reduce quantum‑resource usage while improving accuracy in Variational Quantum Eigensolver (VQE) ground‑state estimation for 6‑ to 18‑qubit Hamiltonians and in quantum phase classification for up to 12 qubits. The methods achieve up to a 60 % reduction in logical quantum evaluations for VQE and a 2.8‑percentage‑point gain in peak test accuracy for classification, suggesting a promising path toward training larger‑qubit quantum models.
Hybrid Variational Quantum-Classical Framework with Adaptive Weighting and Efficiency Assessment introduces Sim‑HVQC, a hybrid deep quantum neural network that integrates an adaptive, parameter‑free SimAM weighting module with classical feature extraction to retain class‑discriminative information before encoding into a Variational Quantum Circuit. Unlike prior work limited to binary classification, this framework is trained and evaluated on multiple multi‑class datasets such as MNIST, KMNIST, Fashion‑MNIST, and EMNIST. The study highlights reproducibility, parameter efficiency, and interpretability through multi‑seed evaluation, parameter analysis, and latent/quantum feature inspection, with source code publicly available on GitHub.
QuanVI is a quantum-inspired algorithm for score-based variational inference that reformulates the optimization as a density-operator problem and uses a quantum tensor network parameterization with matrix product operators. By representing degenerate low-energy subspaces with maximally mixed states, it avoids the non-uniqueness of individual eigenvectors and compresses the density operator to prevent exponential parameter growth. Experiments demonstrate that QuanVI matches exact solutions in low dimensions and scales to high-dimensional synthetic and Bayesian posterior-approximation benchmarks, including challenging non‑Gaussian targets.