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

Exact Algebraic Reduction of Quantum Neural Circuits: Observable-Dependent Renormalization and Curvature-Based Reliability Control

Isamu Ohnishi, Chavis Srichan

Published Nov 1, 2026• 0 citations
Publisher

Abstract

This conference presentation introduces an algebraic framework for the exact reduction of quantum neural circuits through observable-dependent renormalization and geometric reliability control. The proposed approach addresses fundamental challenges in quantum machine learning, including circuit complexity, fragmented mathematical representations, training stability, and the reliability of generative models. The framework represents parameterized quantum circuits as quantum dynamical semigroups and constructs an observable-dependent symmetry subalgebra using dynamical Lie algebra closure. This construction enables the derivation of reduced effective models that preserve designated observables exactly while maintaining complete positivity and trace preservation. The presentation further investigates the geometric structure of reduced quantum models through quantum Fisher information, Berry curvature, and context-dependent attention metrics. Geometric regularization is proposed to improve training stability and address barren plateaus, while curvature-based reliability monitoring provides a mathematical approach to detecting deviations of generated outputs from learned data manifolds. The proposed methodology offers potential applications in resource-efficient quantum machine learning, hybrid quantum-classical computing, model robustness, and AI reliability. Future research directions include hardware-aware algebraic reduction, continuous-variable quantum systems, and curvature-based monitoring for trustworthy artificial intelligence.

DOI
10.5281/zenodo.23852920

Related papers

LieTrunc-QNN: Lie Algebra Truncation and Quantum Expressivity Phase Transition from LiePrune to Provably Stable Quantum Neural Networks

Haijian Shao, Dalong A. Zhao, Xing Deng +2 more

Quantum Machine Learning (QML) is fundamentally limited by two challenges: barren plateaus (exponentially vanishing gradients) and the fragility of parameterized quantum circuits under noise. Despite extensive empirical studies, a unified theoretical framework remains lacking. We introduce LieTrunc-QNN, an algebraic-geometric framework that characterizes trainability via Lie-generated dynamics. Parameterized quantum circuits are modeled as Lie subalgebras of u(2^n), whose action induces a Riemannian manifold of reachable quantum states. Expressivity is reinterpreted as intrinsic manifold dimension and geometry. We establish a geometric capacity-plateau principle: increasing effective dimension leads to exponential gradient suppression due to concentration of measure. By restricting to structured Lie subalgebras (LieTrunc), the manifold is contracted, preventing concentration and preserving non-degenerate gradients. We prove two main results: (1) a trainability lower bound for LieTrunc-QNN, and (2) that the Fubini-Study metric rank is bounded by the algebraic span of generators, showing expressivity is governed by structure rather than parameter count. Compact Lie subalgebras also provide inherent robustness to perturbations. Importantly, we establish a polynomial trainability regime where gradient variance decays polynomially instead of exponentially. Experiments (n=2-6) validate the theory: LieTrunc-QNN maintains stable gradients and high effective dimension, while random truncation leads to metric rank collapse. At n=6, full metric rank is preserved (rank=16). Results support a scaling law between gradient variance and effective dimension. This work provides a unified geometric framework for QNN design, linking Lie algebra, manifold geometry, and optimization.

arXiv:2604.02697•Apr 3, 2026•0 citations

LiePrune: Lie Group and Quantum Geometric Dual Representation for One-Shot Structured Pruning of Quantum Neural Networks

Haijian Shao, Bowen Yang, Wei Liu +2 more

Quantum neural networks (QNNs) and parameterized quantum circuits (PQCs) are key building blocks for near-term quantum machine learning. However, their scalability is constrained by excessive parameters, barren plateaus, and hardware limitations. We propose LiePrune, the first mathematically grounded one-shot structured pruning framework for QNNs that leverages Lie group structure and quantum geometric information. Each gate is jointly represented in a Lie group--Lie algebra dual space and a quantum geometric feature space, enabling principled redundancy detection and aggressive compression. Experiments on quantum classification (MNIST, FashionMNIST), quantum generative modeling (Bars-and-Stripes), and quantum chemistry (LiH VQE) show that LiePrune achieves over $10\times$ compression with negligible or even improved task performance, while providing provable guarantees on redundancy detection, functional approximation, and computational complexity.

quant-pharXiv:2512.09469•Dec 11, 2025•2 citations

Geometric Optimization on Lie Groups: A Lie-Theoretic Explanation of Barren Plateau Mitigation for Variational Quantum Algorithms

Zhehao Yi, Rahul Bhadani

Barren plateaus, which means the training gradients become extremely small, pose a major challenge in optimizing parameterized quantum circuits, often making the learning process impractically slow or stall. This work shows why using neural networks to generate quantum circuit parameters helps overcome this difficulty. We introduce a geometric viewpoint that describes how the parameters produced by neural networks evolve during training. Our analysis shows that these parameters follow smooth and efficient paths that avoid the flat regions in the training that cause barren plateaus. This provides a computational explanation for the improved trainability observed in recent neural network-assisted quantum learning methods. Overall, our findings bridge ideas from quantum machine learning and computational optimization, offering new insight into the structure of quantum models and guiding future approaches for designing more trainable quantum circuits or parameter initialization.

quant-pharXiv:2512.02078•Dec 2, 2025•1 citation

Geometric Quantum Physics Informed Neural Network

Wai-Hong Tam, Reza Safari, Hiromichi Matsuyama

Quantum physics-informed neural networks (QPINNs) have recently emerged as a promising framework for the solution of partial differential equations (PDEs), with several studies reporting improved convergence and accuracy relative to classical physics-informed neural networks (PINNs) at reduced training cost. Motivated by these advances, we introduce geometric quantum physics-informed neural networks (GQPINNs), a symmetry-aware extension of QPINNs in which the geometric structure of the underlying PDE is incorporated directly into the quantum-circuit ansatz. Building on the framework of geometric quantum machine learning, we construct parametrized circuits that encode finite-group and compact Lie-group symmetries as inductive biases through problem-specific equivariant generator sets . Using a twirling-based construction, we derive symmetry-preserving gates that ensure that the model predictions respect the symmetries of the governing equation whenever the boundary and initial data are symmetry compatible. We benchmark GQPINNs against standard QPINNs and symmetry-adapted classical PINN baselines under matched training protocols across a representative set of linear and nonlinear PDEs. Across these benchmarks, GQPINNs achieve improved solution accuracy, as quantified by lower mean absolute error, while requiring substantially fewer trainable parameters. These results identify symmetry-aware quantum-circuit design as an effective route toward improved efficiency and generalization in quantum PDE solvers and provide a systematic framework for incorporating geometric inductive biases into quantum-enhanced scientific machine learning.

quant-pharXiv:2605.02352•May 5, 2026•2 citations

AI-Guided Quantum Compiler Design Using Superalgebraic Symmetries

Murali Krishna Pasupuleti

Abstract: The evolution of quantum computing depends not only on advancements in hardware but also on breakthroughs in compiler design that can translate high-level quantum algorithms into efficient, executable circuits. This research introduces a novel approach to quantum compiler design that leverages AI guidance in tandem with superalgebraic symmetries to optimize gate synthesis, resource usage, and noise resilience. By embedding superalgebraic representations—mathematical structures that unify bosonic and fermionic transformations—into the compilation pipeline, and training AI models to recognize optimal symmetry-preserving transformations, we construct a quantum compiler that is adaptive, structure-aware, and scalable. This framework enhances circuit depth minimization, gate reduction, and fidelity preservation in real-time quantum compilation workflows. Keywords: Quantum Compiler, Superalgebras, Artificial Intelligence, Gate Optimization, Quantum Circuits, Symmetry-Preserving Transformations, Qubit Mapping, Quantum Machine Learning

International Journal of Academic and Industrial Research Innovations(IJAIRI)•Apr 8, 2025•0 citations

Adaptive Quantum Learning Architectures with Superalgebraic Entangled Layers

Murali Krishna Pasupuleti

This paper introduces a novel quantum machine learning framework that integrates adaptive learning capabilities with superalgebraically structured entangled layers. Leveraging the mathematical formalism of Lie superalgebras—specifically osp(1∣2) and sl(2∣1)—the proposed architecture encodes quantum states in graded Hilbert spaces and governs their evolution via symmetry-preserving supercharges. The entangled layers dynamically adapt to task-specific feedback through a hybrid quantum-classical training protocol that ensures algebraic consistency and quantum coherence. Symbolic computation and quantum simulation tools are employed to validate the fidelity and symmetry of entanglement evolution. The system is benchmarked on tasks such as symbolic reasoning, quantum phase classification, and structured regression, outperforming baseline models in interpretability, stability, and generalization. This research lays the foundation for scalable, physically grounded quantum AI systems capable of learning through algebraic alignment with fundamental symmetries. Keywords: quantum machine learning, adaptive learning, entanglement, superalgebra, osp(1∣2), graded Hilbert space, quantum AI, symmetry-preserving learning, Lie superalgebras, supercharges, hybrid quantum-classical architecture, interpretable QML, symbolic reasoning, quantum circuits

International Journal of Academic and Industrial Research Innovations(IJAIRI)•Apr 11, 2025•0 citations
This conference presentation introduces an algebraic framework for the exact reduction of quantum neural circuits through observable-dependent renormalization and geometric reliability control. The proposed approach addresses fundamental challenges in quantum machine learning, including circuit complexity, fragmented mathematical representations, training stability, and the reliability of generative models. The framework represents parameterized quantum circuits as quantum dynamical semigroups and constructs an observable-dependent symmetry subalgebra using dynamical Lie algebra closure. This construction enables the derivation of reduced effective models that preserve designated observables exactly while maintaining complete positivity and trace preservation. The presentation further investigates the geometric structure of reduced quantum models through quantum Fisher information, Berry curvature, and context-dependent attention metrics. Geometric regularization is proposed to improve training stability and address barren plateaus, while curvature-based reliability monitoring provides a mathematical approach to detecting deviations of generated outputs from learned data manifolds. The proposed methodology offers potential applications in resource-efficient quantum machine learning, hybrid quantum-classical computing, model robustness, and AI reliability. Future research directions include hardware-aware algebraic reduction, continuous-variable quantum systems, and curvature-based monitoring for trustworthy artificial intelligence.
Quantum Machine Learning (QML) is fundamentally limited by two challenges: barren plateaus (exponentially vanishing gradients) and the fragility of parameterized quantum circuits under noise. Despite extensive empirical studies, a unified theoretical framework remains lacking. We introduce LieTrunc-QNN, an algebraic-geometric framework that characterizes trainability via Lie-generated dynamics. Parameterized quantum circuits are modeled as Lie subalgebras of u(2^n), whose action induces a Riemannian manifold of reachable quantum states. Expressivity is reinterpreted as intrinsic manifold dimension and geometry. We establish a geometric capacity-plateau principle: increasing effective dimension leads to exponential gradient suppression due to concentration of measure. By restricting to structured Lie subalgebras (LieTrunc), the manifold is contracted, preventing concentration and preserving non-degenerate gradients. We prove two main results: (1) a trainability lower bound for LieTrunc-QNN, and (2) that the Fubini-Study metric rank is bounded by the algebraic span of generators, showing expressivity is governed by structure rather than parameter count. Compact Lie subalgebras also provide inherent robustness to perturbations. Importantly, we establish a polynomial trainability regime where gradient variance decays polynomially instead of exponentially. Experiments (n=2-6) validate the theory: LieTrunc-QNN maintains stable gradients and high effective dimension, while random truncation leads to metric rank collapse. At n=6, full metric rank is preserved (rank=16). Results support a scaling law between gradient variance and effective dimension. This work provides a unified geometric framework for QNN design, linking Lie algebra, manifold geometry, and optimization.
Quantum neural networks (QNNs) and parameterized quantum circuits (PQCs) are key building blocks for near-term quantum machine learning. However, their scalability is constrained by excessive parameters, barren plateaus, and hardware limitations. We propose LiePrune, the first mathematically grounded one-shot structured pruning framework for QNNs that leverages Lie group structure and quantum geometric information. Each gate is jointly represented in a Lie group--Lie algebra dual space and a quantum geometric feature space, enabling principled redundancy detection and aggressive compression. Experiments on quantum classification (MNIST, FashionMNIST), quantum generative modeling (Bars-and-Stripes), and quantum chemistry (LiH VQE) show that LiePrune achieves over 10×10\times10× compression with negligible or even improved task performance, while providing provable guarantees on redundancy detection, functional approximation, and computational complexity.
Barren plateaus, which means the training gradients become extremely small, pose a major challenge in optimizing parameterized quantum circuits, often making the learning process impractically slow or stall. This work shows why using neural networks to generate quantum circuit parameters helps overcome this difficulty. We introduce a geometric viewpoint that describes how the parameters produced by neural networks evolve during training. Our analysis shows that these parameters follow smooth and efficient paths that avoid the flat regions in the training that cause barren plateaus. This provides a computational explanation for the improved trainability observed in recent neural network-assisted quantum learning methods. Overall, our findings bridge ideas from quantum machine learning and computational optimization, offering new insight into the structure of quantum models and guiding future approaches for designing more trainable quantum circuits or parameter initialization.
Quantum physics-informed neural networks (QPINNs) have recently emerged as a promising framework for the solution of partial differential equations (PDEs), with several studies reporting improved convergence and accuracy relative to classical physics-informed neural networks (PINNs) at reduced training cost. Motivated by these advances, we introduce geometric quantum physics-informed neural networks (GQPINNs), a symmetry-aware extension of QPINNs in which the geometric structure of the underlying PDE is incorporated directly into the quantum-circuit ansatz. Building on the framework of geometric quantum machine learning, we construct parametrized circuits that encode finite-group and compact Lie-group symmetries as inductive biases through problem-specific equivariant generator sets . Using a twirling-based construction, we derive symmetry-preserving gates that ensure that the model predictions respect the symmetries of the governing equation whenever the boundary and initial data are symmetry compatible. We benchmark GQPINNs against standard QPINNs and symmetry-adapted classical PINN baselines under matched training protocols across a representative set of linear and nonlinear PDEs. Across these benchmarks, GQPINNs achieve improved solution accuracy, as quantified by lower mean absolute error, while requiring substantially fewer trainable parameters. These results identify symmetry-aware quantum-circuit design as an effective route toward improved efficiency and generalization in quantum PDE solvers and provide a systematic framework for incorporating geometric inductive biases into quantum-enhanced scientific machine learning.
Abstract: The evolution of quantum computing depends not only on advancements in hardware but also on breakthroughs in compiler design that can translate high-level quantum algorithms into efficient, executable circuits. This research introduces a novel approach to quantum compiler design that leverages AI guidance in tandem with superalgebraic symmetries to optimize gate synthesis, resource usage, and noise resilience. By embedding superalgebraic representations—mathematical structures that unify bosonic and fermionic transformations—into the compilation pipeline, and training AI models to recognize optimal symmetry-preserving transformations, we construct a quantum compiler that is adaptive, structure-aware, and scalable. This framework enhances circuit depth minimization, gate reduction, and fidelity preservation in real-time quantum compilation workflows. Keywords: Quantum Compiler, Superalgebras, Artificial Intelligence, Gate Optimization, Quantum Circuits, Symmetry-Preserving Transformations, Qubit Mapping, Quantum Machine Learning
This paper introduces a novel quantum machine learning framework that integrates adaptive learning capabilities with superalgebraically structured entangled layers. Leveraging the mathematical formalism of Lie superalgebras—specifically osp(1∣2) and sl(2∣1)—the proposed architecture encodes quantum states in graded Hilbert spaces and governs their evolution via symmetry-preserving supercharges. The entangled layers dynamically adapt to task-specific feedback through a hybrid quantum-classical training protocol that ensures algebraic consistency and quantum coherence. Symbolic computation and quantum simulation tools are employed to validate the fidelity and symmetry of entanglement evolution. The system is benchmarked on tasks such as symbolic reasoning, quantum phase classification, and structured regression, outperforming baseline models in interpretability, stability, and generalization. This research lays the foundation for scalable, physically grounded quantum AI systems capable of learning through algebraic alignment with fundamental symmetries. Keywords: quantum machine learning, adaptive learning, entanglement, superalgebra, osp(1∣2), graded Hilbert space, quantum AI, symmetry-preserving learning, Lie superalgebras, supercharges, hybrid quantum-classical architecture, interpretable QML, symbolic reasoning, quantum circuits