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

International Journal of Geometric Methods in Modern Physics

UNFOLDING THE QUANTUM ARNOLD TRANSFORMATION

Julio Guerrero, V. Aldaya, Francisco F. López-Ruiz, FRANCISCO COSSÍO

Published Mar 1, 2012• 9 citations
Publisher

Abstract

The recently proposed quantum Arnold transformation is revisited and extended and its relation with other methods is emphasized. Possible applications are also outlined.
DOI
10.1142/s0219887812600110

Related papers

Chained quantum arnold transformations

Francisco F. López-Ruiz, Julio Guerrero, V. Aldaya

arXiv:1109.1124•Journal of Russian Laser Research•Jul 1, 2011•9 citations

On the Lewis–Riesenfeld (Dodonov–Man’ko) invariant method

Julio Guerrero, Francisco F. López-Ruiz

We revise the Lewis–Riesenfeld invariant method for solving the quantum time-dependent harmonic oscillator in light of the quantum Arnold transformation previously introduced and its recent generalization to the quantum Arnold–Ermakov–Pinney transformation. We prove that both methods are equivalent and show the advantages of the quantum Arnold–Ermakov–Pinney transformation over the Lewis–Riesenfeld invariant method. We show that, in the quantum time-dependent and damped harmonic oscillator, the invariant proposed by Dodonov and Man’ko is more suitable, and provide some examples to illustrate it, focusing on the damped case.

arXiv:1503.01371•Physica Scripta•Jun 1, 2015•24 citations

Time-Dependent Conformal Transformations and the Propagator for Quadratic Systems

Qiliang Zhao, Pengming Zhang, P. A. Horváthy

The method proposed by Inomata and his collaborators allows us to transform a damped Caldirola–Kanai oscillator with a time-dependent frequency to one with a constant frequency and no friction by redefining the time variable, obtained by solving an Ermakov–Milne–Pinney equation. Their mapping “Eisenhart–Duval” lifts as a conformal transformation between two appropriate Bargmann spaces. The quantum propagator is calculated also by bringing the quadratic system to free form by another time-dependent Bargmann-conformal transformation, which generalizes the one introduced before by Niederer and is related to the mapping proposed by Arnold. Our approach allows us to extend the Maslov phase correction to an arbitrary time-dependent frequency. The method is illustrated by the Mathieu profile.

arXiv:2105.07374•Symmetry•Oct 3, 2021•5 citations

A quantum version of the inverse scattering transformation

F. Göhmann, V. E. Korepin

CRM proceedings & lecture notes•Mar 1, 2002•0 citations

QKAN: quantum Kolmogorov-Arnold networks with applications in machine learning and multivariate state preparation

Petr Ivashkov, Po‐Wei Huang, Kelvin Koor +2 more

We introduce quantum Kolmogorov-Arnold networks (QKAN), a quantum algorithmic framework inspired by the recently proposed Kolmogorov-Arnold Networks (KAN). QKAN inherits the compositional structure of KAN and is based on block-encodings, constructed recursively from a single layer using quantum singular value transformation. We demonstrate the algorithmic utility of QKAN in two applications. First, we introduce and analyze QKAN as a quantum learning model, treating the eigenvalues of block-encoded matrices as neurons and applying parametrized activation functions on the edges of the network. We show that QKAN is a wide-and-shallow neural architecture, where shallow depth is compensated by exponentially wide layers whenever efficient block-encodings of inputs are available. We further discuss how to parametrize and train QKAN using parametrized quantum circuits and quantum linear algebra subroutines. Second, we demonstrate that QKAN can serve as a multivariate quantum state-preparation protocol for functions with shallow compositional structure. We demonstrate this by efficiently preparing a multivariate Gaussian quantum state using a two-layer QKAN. Looking forward, we anticipate that QKAN's compositional and modular design will enable new applications in quantum machine learning and quantum state preparation.

arXiv:2410.04435•npj Quantum Information•Mar 11, 2026•4 citations

Quantum bäcklund transformations: Some ideas and examples

O. Ragnisco, Federico Zullo

arXiv:1112.3755•Theoretical and Mathematical Physics•Aug 1, 2012•2 citations
We revise the Lewis–Riesenfeld invariant method for solving the quantum time-dependent harmonic oscillator in light of the quantum Arnold transformation previously introduced and its recent generalization to the quantum Arnold–Ermakov–Pinney transformation. We prove that both methods are equivalent and show the advantages of the quantum Arnold–Ermakov–Pinney transformation over the Lewis–Riesenfeld invariant method. We show that, in the quantum time-dependent and damped harmonic oscillator, the invariant proposed by Dodonov and Man’ko is more suitable, and provide some examples to illustrate it, focusing on the damped case.
The method proposed by Inomata and his collaborators allows us to transform a damped Caldirola–Kanai oscillator with a time-dependent frequency to one with a constant frequency and no friction by redefining the time variable, obtained by solving an Ermakov–Milne–Pinney equation. Their mapping “Eisenhart–Duval” lifts as a conformal transformation between two appropriate Bargmann spaces. The quantum propagator is calculated also by bringing the quadratic system to free form by another time-dependent Bargmann-conformal transformation, which generalizes the one introduced before by Niederer and is related to the mapping proposed by Arnold. Our approach allows us to extend the Maslov phase correction to an arbitrary time-dependent frequency. The method is illustrated by the Mathieu profile.
We introduce quantum Kolmogorov-Arnold networks (QKAN), a quantum algorithmic framework inspired by the recently proposed Kolmogorov-Arnold Networks (KAN). QKAN inherits the compositional structure of KAN and is based on block-encodings, constructed recursively from a single layer using quantum singular value transformation. We demonstrate the algorithmic utility of QKAN in two applications. First, we introduce and analyze QKAN as a quantum learning model, treating the eigenvalues of block-encoded matrices as neurons and applying parametrized activation functions on the edges of the network. We show that QKAN is a wide-and-shallow neural architecture, where shallow depth is compensated by exponentially wide layers whenever efficient block-encodings of inputs are available. We further discuss how to parametrize and train QKAN using parametrized quantum circuits and quantum linear algebra subroutines. Second, we demonstrate that QKAN can serve as a multivariate quantum state-preparation protocol for functions with shallow compositional structure. We demonstrate this by efficiently preparing a multivariate Gaussian quantum state using a two-layer QKAN. Looking forward, we anticipate that QKAN's compositional and modular design will enable new applications in quantum machine learning and quantum state preparation.