Pith. sign in

Quantum-inspired activation functions and quantum Chebyshev-polynomial network

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Driven by the significant advantages offered by quantum computing, research in quantum machine learning has increased in recent years. While quantum speed-up has been demonstrated in some applications of quantum machine learning, a comprehensive understanding of its underlying mechanisms for improved performance remains elusive. Our study address this problem by investigating the functional expressibility of quantum circuits integrated within a convolutional neural network (CNN). Through numerical experiments on the MNIST, Fashion MNIST, and Letter datasets, our hybrid quantum-classical CNN model demonstrates superior feature selection capabilities and substantially reduces the required training steps compared to classical CNNs. Notably, we observe similar performance improvements when incorporating three other quantum-inspired activation functions in classical neural networks, indicating the benefits of adopting quantum-inspired activation functions. Additionally, we developed a hybrid quantum Chebyshev-polynomial network (QCPN) based on the properties of quantum activation functions. We demonstrate that a three-layer QCPN can approximate any continuous function, a feat not achievable by a standard three-layer classical neural network. Our findings suggest that quantum-inspired activation functions can reduce model depth while maintaining high learning capability, making them a promising approach for optimizing large-scale machine-learning models. We also outline future research directions for leveraging quantum advantages in machine learning, aiming to unlock further potential in this rapidly evolving field.

fields

cs.LG 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Degree-Optimized Cumulative Polynomial Kolmogorov-Arnold Networks

cs.LG · 2025-05-21 · conditional · novelty 5.0

CP-KAN reformulates polynomial degree selection in Chebyshev-based Kolmogorov-Arnold networks as a QUBO optimization problem and shows competitive regression performance with fewer parameters on several benchmarks.

citing papers explorer

Showing 1 of 1 citing paper.

  • Degree-Optimized Cumulative Polynomial Kolmogorov-Arnold Networks cs.LG · 2025-05-21 · conditional · none · ref 15 · internal anchor

    CP-KAN reformulates polynomial degree selection in Chebyshev-based Kolmogorov-Arnold networks as a QUBO optimization problem and shows competitive regression performance with fewer parameters on several benchmarks.