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

arXiv:2606.11814

Sparsified Kolmogorov-Arnold Networks for Interpretable Quantum State Tomography

Xinge Wu, Huaxin Wang, Jiajun Liu, Ruiqing He, Jiandong Shang, Hengliang Guo, Qiang Chen

quant-phcs.AIcs.LGSubmitted Jun 10, 2026• Announced Jun 11, 2026• 0 citations
arXivHTMLPDF

Abstract

Machine-learning approaches to quantum state tomography can achieve high reconstruction fidelity, but the physical structure used by the trained model often remains implicit. Here we ask whether a sparsified Kolmogorov-Arnold Network (KAN) can be used not only as a regressor, but also as an inspectable reconstruction rule whose internal organization can be checked against known Pauli structure. We study a controlled three-qubit GHZ-family benchmark in which all 63 non-identity Pauli expectation values are used to reconstruct three GHZ-subspace variables: the population imbalance $z$, the real off-diagonal component $c$, and the imaginary off-diagonal component $s$. Under finite-shot sampling and depolarizing noise, external ablation identifies the extended 12-channel GHZ-relevant Pauli set from the 63 measurements, with exact top-12 recovery across the tested shot counts and depolarizing-noise strengths. These support patterns remain stable across multi-seed random-initialization and noise-level analyses, and collapse under random-label controls. The dominant pruned input-hidden-output pathways organize Z-type population observables and X/Y off-diagonal observables in a pattern consistent with the analytic GHZ Pauli grouping, and sparse formula recovery recovers the canonical signed Pauli relations. The contribution of the KAN is therefore pathway-level structural interpretability within a neural reconstruction model, rather than superior sparse regression. Together with negative controls, these probes provide a consistency chain for auditing learned reconstruction rules against known physical structure.

Related papers

QRCKAN: Kolmogorov–Arnold Readouts for Quantum Reservoir Computing of Chaotic Dynamics

Brianna Jones, Harshita Dua, Harini Muthurengan +1 more

Quantum reservoir computing (QRC) offers a train-light approach to temporal learning by keeping the quantum dynamics fixed and training only a classical readout. Most QRC studies use linear readouts, potentially leaving nonlinear structure in measured reservoir states under-exploited. Inspired by recent reservoir-computing Kolmogorov–Arnold networks (RCKAN), we study Kolmogorov–Arnold Network (KAN)-style spline readouts for stateful QRC. Our QRCKAN architecture combines a refreshed-input, persistent-memory density-matrix reservoir with correlation observables, a shallow spline KAN readout, an optional current-state skip, and a residual formulation that adds a validation-weighted nonlinear correction to ridge regression. We summarize five seeded runs on Lorenz-63 and Mackey–Glass against matched linear QRC, stateless quantum feature maps, no-QRC controls, echo-state networks (ESNs), lag-based regressors, LSTM, and Transformer baselines. On Lorenz-63, residual QRCKAN reduces mean one-step NRMSE by 51.6% relative to QRC+Linear+Skip (0.000820 vs. 0.001696) and raises mean valid prediction time (VPT) from 102 to 218 steps. On Mackey–Glass, QRCKAN reduces mean one-step NRMSE by 78.2% and rollout NRMSE by 81.0%, while increasing mean VPT from 118 to 262 steps. Matched no-skip QRC–QFF comparisons and matched no-QRC controls support contributions from temporal state and reservoir features under the tested configurations. Because seed 0 informed architecture selection and is included in these summaries, all intervals and tests are exploratory rather than independent confirmatory inference. Strong ESNs remain superior in one-step accuracy. We claim an exploratory nonlinear-readout improvement within simulated QRC, not a general quantum advantage.

Proceedings of the AAAI Symposium Series•Nov 6, 2026•0 citations

Quantum Kolmogorov--Arnold networks are classically reproducible at their attained accuracy, and a discrete-logarithm encoding need not be: a measurement-based map of where quantum advantage can live

Hikaru Wakaura

Abstract Quantum machine-learning models are useful only if classical computers cannot cheaply imitate them. We test this directly for quantum Kolmogorov--Arnold networks (QKANs)---neural networks whose tunable ``activation functions'' are small quantum circuits---by asking whether each model can be contracted as an efficient tensor network (TN). Our task-aware yardstick is the bond dimension a classical surrogate needs to copy the model's output at the accuracy the model itself reaches. We find a clear ladder. The amplitude-encoded Chebyshev QKAN uses only logarithmically many qubits and is exactly classical. The variational QKAN, built from all-to-all controlled rotations, looks hard at random settings but generalizes only weakly once trained (held-out $R^2\!\le\!0.27$) and is copied at that attained accuracy by a low-bond-dimension surrogate ($n\!\le\!10$); at fixed strict tolerance the required bond dimension grows near-exponentially. Depolarizing noise erases it (purity collapse) near $p\!\approx\!0.03$--$0.05$ at the sizes we reach. Every generic attempt to force hardness---a global measurement or an interaction-based (IQP) feature map---instead destroys trainability through exponentially small gradients (a ``barren plateau''). The escape is a discrete-logarithm feature map: its kernel variance is flat from $4$ to $14$ qubits while a generic IQP kernel concentrates exponentially, and a support-vector machine with it learns a classically hard concept to $\ge99\%$ accuracy while generic and classical kernels stay at chance; wired into the KAN architecture, it fits discrete-log targets to $R^2\!\approx\!1$. Hardness placed in number theory stays classically hard, shot-efficient, and learnable. The work provides a measurement-based reproducibility criterion and a design rule: seek advantage in structured, provably hard encodings rather than in deep entanglement.

•Oct 20, 2026•0 citations

Quantum steering detection of two-qubit states via Kolmogorov–Arnold networks with measurement and feature reduction

Zhangzhang Wu, Yanliang Zhang

Abstract Quantum steering is an important form of nonclassical correlation and plays a central role in one-sided device-independent quantum information processing. However, efficiently determining whether an arbitrary two-qubit state is steerable remains challenging, since semidefinite-programming-based certification generally depends on the choice of measurement settings and can become computationally demanding. In this work, we propose an interpretable quantum steering detection scheme based on Kolmogorov–Arnold Networks (KANs). The training labels are generated through semidefinite programming for randomly sampled two-qubit density matrices. Several physically motivated feature representations are constructed to investigate the influence of measurement and feature reduction. Owing to their learnable univariate edge functions and symbolic formula extraction capability, KANs provide not only accurate classification but also a more transparent representation of the learned steering decision boundary. Numerical experiments show that the proposed KAN-based classifiers can distinguish states with SDP-detected steering from states for which no witness is found under the sampled measurements. In particular, canonical-correlation features provide an effective representation for learning the steering boundary, and further feature compression can still retain competitive detection performance. These results indicate that KANs offer a promising, efficient, and interpretable machine-learning approach for finite-measurement steering detection of arbitrary two-qubit states.

Laser Physics Letters•Sep 1, 2026•0 citations

Trained quantum Kolmogorov--Arnold networks can dequantize, and a discrete-logarithm encoding need not: a measurement-based map of where quantum advantage can live

Hikaru Wakaura

Abstract Quantum machine-learning models are only useful if a classical computer cannot cheaply imitate them. We test this directly for quantum Kolmogorov–Arnold networks (QKANs)—neural networks whose tunable “activation functions” are small quantum circuits—by asking whether each model can be contracted as an effcient tensor network (TN), the standard tool for classical quantum simulation. We make the test practical with a task-aware yardstick: the bond dimension a classical surrogate needs to copy the model’s output at the accuracy the model itself reaches. We find a clear ladder. The amplitude-encoded Chebyshev QKAN uses only logarithmically many qubits and is exactly classical. The variational QKAN, built from all-to-all controlled rotations, looks hard at random settings but, once trained to genuinely learn a smooth task (R2 = 0.30–0.62), is copied by a constant-bond-dimension surrogate at the sizes (n ≤ 10) we test. Noise pushes it toward classicality near p ≈ 0.03–0.05, echoing noisy random circuits. Every generic attempt to force hardness—a global measurement, a deeper entangler, or an interaction-based (IQP) feature map—instead destroys trainability through exponentially small gradients (a “barren plateau”). The escape is a discrete-logarithm feature map: its kernel variance is flat (0.07±0.01) from 4 to 14 qubits while a generic IQP kernel decays as 2 −n , and a support-vector machine with it learns a classically hard concept to ≥ 99% accuracy while generic and classical kernels stay at chance—hardness placed in number theory stays both classically hard and shot-effciently learnable. The work provides a concrete, measurement-based criterion for when a quantum model is reproducible by a low-bond- dimension surrogate, and a design rule: seek advantage in structured, provably hard encodings rather than in deep entanglement.

•Jul 1, 2026•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•28 citations

QuKAN: A Quantum Circuit Born Machine Approach to Quantum Kolmogorov Arnold Networks

Yannick Werner, Akash Malemath, Mengxi Liu +4 more

Kolmogorov Arnold Networks (KANs), built upon the Kolmogorov Arnold representation theorem (KAR), have demonstrated promising capabilities in expressing complex functions with fewer neurons. This is achieved by implementing learnable parameters on the edges instead of on the nodes, unlike traditional networks such as Multi-Layer Perceptrons (MLPs). However, KANs potential in quantum machine learning has not yet been well explored. In this work, we present an implementation of these KAN architectures in both hybrid and fully quantum forms using a Quantum Circuit Born Machine (QCBM). We adapt the KAN transfer using pre-trained residual functions, thereby exploiting the representational power of parametrized quantum circuits. In the hybrid model we combine classical KAN components with quantum subroutines, while the fully quantum version the entire architecture of the residual function is translated to a quantum model. We demonstrate the feasibility, interpretability and performance of the proposed Quantum KAN (QuKAN) architecture.

arXiv:2506.22340•Scientific Reports•Oct 9, 2025•5 citations
Machine-learning approaches to quantum state tomography can achieve high reconstruction fidelity, but the physical structure used by the trained model often remains implicit. Here we ask whether a sparsified Kolmogorov-Arnold Network (KAN) can be used not only as a regressor, but also as an inspectable reconstruction rule whose internal organization can be checked against known Pauli structure. We study a controlled three-qubit GHZ-family benchmark in which all 63 non-identity Pauli expectation values are used to reconstruct three GHZ-subspace variables: the population imbalance zzz, the real off-diagonal component ccc, and the imaginary off-diagonal component sss. Under finite-shot sampling and depolarizing noise, external ablation identifies the extended 12-channel GHZ-relevant Pauli set from the 63 measurements, with exact top-12 recovery across the tested shot counts and depolarizing-noise strengths. These support patterns remain stable across multi-seed random-initialization and noise-level analyses, and collapse under random-label controls. The dominant pruned input-hidden-output pathways organize Z-type population observables and X/Y off-diagonal observables in a pattern consistent with the analytic GHZ Pauli grouping, and sparse formula recovery recovers the canonical signed Pauli relations. The contribution of the KAN is therefore pathway-level structural interpretability within a neural reconstruction model, rather than superior sparse regression. Together with negative controls, these probes provide a consistency chain for auditing learned reconstruction rules against known physical structure.
Quantum reservoir computing (QRC) offers a train-light approach to temporal learning by keeping the quantum dynamics fixed and training only a classical readout. Most QRC studies use linear readouts, potentially leaving nonlinear structure in measured reservoir states under-exploited. Inspired by recent reservoir-computing Kolmogorov–Arnold networks (RCKAN), we study Kolmogorov–Arnold Network (KAN)-style spline readouts for stateful QRC. Our QRCKAN architecture combines a refreshed-input, persistent-memory density-matrix reservoir with correlation observables, a shallow spline KAN readout, an optional current-state skip, and a residual formulation that adds a validation-weighted nonlinear correction to ridge regression. We summarize five seeded runs on Lorenz-63 and Mackey–Glass against matched linear QRC, stateless quantum feature maps, no-QRC controls, echo-state networks (ESNs), lag-based regressors, LSTM, and Transformer baselines. On Lorenz-63, residual QRCKAN reduces mean one-step NRMSE by 51.6% relative to QRC+Linear+Skip (0.000820 vs. 0.001696) and raises mean valid prediction time (VPT) from 102 to 218 steps. On Mackey–Glass, QRCKAN reduces mean one-step NRMSE by 78.2% and rollout NRMSE by 81.0%, while increasing mean VPT from 118 to 262 steps. Matched no-skip QRC–QFF comparisons and matched no-QRC controls support contributions from temporal state and reservoir features under the tested configurations. Because seed 0 informed architecture selection and is included in these summaries, all intervals and tests are exploratory rather than independent confirmatory inference. Strong ESNs remain superior in one-step accuracy. We claim an exploratory nonlinear-readout improvement within simulated QRC, not a general quantum advantage.
Abstract Quantum machine-learning models are useful only if classical computers cannot cheaply imitate them. We test this directly for quantum Kolmogorov--Arnold networks (QKANs)---neural networks whose tunable ``activation functions'' are small quantum circuits---by asking whether each model can be contracted as an efficient tensor network (TN). Our task-aware yardstick is the bond dimension a classical surrogate needs to copy the model's output at the accuracy the model itself reaches. We find a clear ladder. The amplitude-encoded Chebyshev QKAN uses only logarithmically many qubits and is exactly classical. The variational QKAN, built from all-to-all controlled rotations, looks hard at random settings but generalizes only weakly once trained (held-out R2 ⁣≤ ⁣0.27R^2\!\le\!0.27R2≤0.27) and is copied at that attained accuracy by a low-bond-dimension surrogate (n ⁣≤ ⁣10n\!\le\!10n≤10); at fixed strict tolerance the required bond dimension grows near-exponentially. Depolarizing noise erases it (purity collapse) near p ⁣≈ ⁣0.03p\!\approx\!0.03p≈0.03--0.050.050.05 at the sizes we reach. Every generic attempt to force hardness---a global measurement or an interaction-based (IQP) feature map---instead destroys trainability through exponentially small gradients (a ``barren plateau''). The escape is a discrete-logarithm feature map: its kernel variance is flat from 444 to 141414 qubits while a generic IQP kernel concentrates exponentially, and a support-vector machine with it learns a classically hard concept to ≥99%\ge99\%≥99% accuracy while generic and classical kernels stay at chance; wired into the KAN architecture, it fits discrete-log targets to R2 ⁣≈ ⁣1R^2\!\approx\!1R2≈1. Hardness placed in number theory stays classically hard, shot-efficient, and learnable. The work provides a measurement-based reproducibility criterion and a design rule: seek advantage in structured, provably hard encodings rather than in deep entanglement.
Abstract Quantum steering is an important form of nonclassical correlation and plays a central role in one-sided device-independent quantum information processing. However, efficiently determining whether an arbitrary two-qubit state is steerable remains challenging, since semidefinite-programming-based certification generally depends on the choice of measurement settings and can become computationally demanding. In this work, we propose an interpretable quantum steering detection scheme based on Kolmogorov–Arnold Networks (KANs). The training labels are generated through semidefinite programming for randomly sampled two-qubit density matrices. Several physically motivated feature representations are constructed to investigate the influence of measurement and feature reduction. Owing to their learnable univariate edge functions and symbolic formula extraction capability, KANs provide not only accurate classification but also a more transparent representation of the learned steering decision boundary. Numerical experiments show that the proposed KAN-based classifiers can distinguish states with SDP-detected steering from states for which no witness is found under the sampled measurements. In particular, canonical-correlation features provide an effective representation for learning the steering boundary, and further feature compression can still retain competitive detection performance. These results indicate that KANs offer a promising, efficient, and interpretable machine-learning approach for finite-measurement steering detection of arbitrary two-qubit states.
Abstract Quantum machine-learning models are only useful if a classical computer cannot cheaply imitate them. We test this directly for quantum Kolmogorov–Arnold networks (QKANs)—neural networks whose tunable “activation functions” are small quantum circuits—by asking whether each model can be contracted as an effcient tensor network (TN), the standard tool for classical quantum simulation. We make the test practical with a task-aware yardstick: the bond dimension a classical surrogate needs to copy the model’s output at the accuracy the model itself reaches. We find a clear ladder. The amplitude-encoded Chebyshev QKAN uses only logarithmically many qubits and is exactly classical. The variational QKAN, built from all-to-all controlled rotations, looks hard at random settings but, once trained to genuinely learn a smooth task (R2 = 0.30–0.62), is copied by a constant-bond-dimension surrogate at the sizes (n ≤ 10) we test. Noise pushes it toward classicality near p ≈ 0.03–0.05, echoing noisy random circuits. Every generic attempt to force hardness—a global measurement, a deeper entangler, or an interaction-based (IQP) feature map—instead destroys trainability through exponentially small gradients (a “barren plateau”). The escape is a discrete-logarithm feature map: its kernel variance is flat (0.07±0.01) from 4 to 14 qubits while a generic IQP kernel decays as 2 −n , and a support-vector machine with it learns a classically hard concept to ≥ 99% accuracy while generic and classical kernels stay at chance—hardness placed in number theory stays both classically hard and shot-effciently learnable. The work provides a concrete, measurement-based criterion for when a quantum model is reproducible by a low-bond- dimension surrogate, and a design rule: seek advantage in structured, provably hard encodings rather than in deep entanglement.
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.
Kolmogorov Arnold Networks (KANs), built upon the Kolmogorov Arnold representation theorem (KAR), have demonstrated promising capabilities in expressing complex functions with fewer neurons. This is achieved by implementing learnable parameters on the edges instead of on the nodes, unlike traditional networks such as Multi-Layer Perceptrons (MLPs). However, KANs potential in quantum machine learning has not yet been well explored. In this work, we present an implementation of these KAN architectures in both hybrid and fully quantum forms using a Quantum Circuit Born Machine (QCBM). We adapt the KAN transfer using pre-trained residual functions, thereby exploiting the representational power of parametrized quantum circuits. In the hybrid model we combine classical KAN components with quantum subroutines, while the fully quantum version the entire architecture of the residual function is translated to a quantum model. We demonstrate the feasibility, interpretability and performance of the proposed Quantum KAN (QuKAN) architecture.