Pith. sign in

REVIEW 2 cited by

Quantum-inspired activation functions and quantum Chebyshev-polynomial network

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.05901 v3 pith:LZM7WCN2 submitted 2024-04-08 quant-ph math-phmath.MPphysics.comp-ph

classification quant-phmath-phmath.MPphysics.comp-ph
keywords quantumactivationfunctionslearningnetworkquantum-inspiredclassicalmachine
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Quantum Variational Activation Functions Empower Kolmogorov-Arnold Networks

    quant-ph 2025-09 reject novelty 5.0 of 10

    QKANs show strong empirical performance on regression, vision, and language tasks, but the claimed exponential parameter reduction is not rigorously established.

  2. Degree-Optimized Cumulative Polynomial Kolmogorov-Arnold Networks

    cs.LG 2025-05 conditional novelty 5.0 of 10

    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.

Pith tools