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

Quantum Learnable Geometry and Lie-Algebraic Observable-Dependent Renormalization

Chavis Srichan, Isamu Ohnishi

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.2139/ssrn.6741998

Related papers

Quantum Learnable Geometry and Lie-Algebraic Observable-Dependent Renormalization(Rev.01)

Chavis Srichan, Isamu Ohnishi

•Jan 1, 2026•0 citations

Lie-Algebraic Observable-Dependent Renormalization for Model Reduction in Open Quantum Dynamics

Isamu Ohnishi

•Jan 1, 2026•0 citations

Lie-Algebraic Observable-Dependent Renormalization: A Unified Framework for Driven Open Quantum Systems and Stochastic Navier-Stokes Equations

Isamu Ohnishi

•Jan 1, 2026•0 citations

Geometry of quantum state manifolds generated by the Lie algebra operators

Andrij Romanovych Kuzmak

arXiv:1706.00250•Journal of Geometry and Physics•Jan 11, 2018•3 citations

Lie-Algebraic Observable-Dependent Renormalization of Continuous Multi-Scale Entanglement Renormalization (LA-cMERA): Exact Algebraic Emergence of Holographic Geometry from Quantum Entanglement

Isamu Ohnishi

•Jan 1, 2026•0 citations

From Reachability to Learnability: Geometric Design Principles for Quantum Neural Networks

Vishal S. Ngairangbam, Michael Spannowsky

Classical deep networks are effective because depth enables adaptive geometric deformation of data representations. In quantum neural networks (QNNs), however, depth or state reachability alone does not guarantee this feature-learning capability. We study this question in the pure-state setting by viewing encoded data as an embedded manifold in $\mathbb{C}P^{2^n-1}$ and analysing infinitesimal unitary actions through Lie-algebra directions. We introduce Classical-to-Lie-algebra (CLA) maps and the criterion of almost Complete Local Selectivity (aCLS), which combines directional completeness with data-dependent local selectivity. Within this framework, we show that data-independent trainable unitaries are complete but non-selective, i.e. learnable rigid reorientations, whereas pure data encodings are selective but non-tunable, i.e. fixed deformations. Hence, geometric flexibility requires a non-trivial joint dependence on data and trainable weights. We further show that accessing high-dimensional deformations of many-qubit state manifolds requires parametrised entangling directions; fixed entanglers such as CNOT alone do not provide adaptive geometric control. Numerical examples validate that aCLS-satisfying data re-uploading models outperform non-tunable schemes while requiring only a quarter of the gate operations. Thus, the resulting picture reframes QNN design from state reachability to controllable geometry of hidden quantum representations.

quant-pharXiv:2603.03071•Mar 4, 2026•0 citations
Classical deep networks are effective because depth enables adaptive geometric deformation of data representations. In quantum neural networks (QNNs), however, depth or state reachability alone does not guarantee this feature-learning capability. We study this question in the pure-state setting by viewing encoded data as an embedded manifold in CP2n−1\mathbb{C}P^{2^n-1}CP2n−1 and analysing infinitesimal unitary actions through Lie-algebra directions. We introduce Classical-to-Lie-algebra (CLA) maps and the criterion of almost Complete Local Selectivity (aCLS), which combines directional completeness with data-dependent local selectivity. Within this framework, we show that data-independent trainable unitaries are complete but non-selective, i.e. learnable rigid reorientations, whereas pure data encodings are selective but non-tunable, i.e. fixed deformations. Hence, geometric flexibility requires a non-trivial joint dependence on data and trainable weights. We further show that accessing high-dimensional deformations of many-qubit state manifolds requires parametrised entangling directions; fixed entanglers such as CNOT alone do not provide adaptive geometric control. Numerical examples validate that aCLS-satisfying data re-uploading models outperform non-tunable schemes while requiring only a quarter of the gate operations. Thus, the resulting picture reframes QNN design from state reachability to controllable geometry of hidden quantum representations.