Pulse-level parameterization of quantum Fourier models replaces single gate angles with multiple independent sub-angles, relaxing monomial couplings and improving gradient descent performance on Fourier series tasks.
Data re-uploading for a universal quantum classifier
8 Pith papers cite this work, alongside 540 external citations. Polarity classification is still indexing.
years
2026 8verdicts
UNVERDICTED 8representative citing papers
Local tensor-train surrogates approximate quantum machine learning models via Taylor polynomials and tensor networks, delivering polynomial parameter scaling and explicit generalization bounds controlled by patch radius.
Independent quantum signal injection into graph DEQs yields higher test accuracy and fewer solver iterations than state-dependent or backbone-dependent injection and classical equilibrium models on NCI1, PROTEINS, and MUTAG benchmarks.
Hybrid agent with variational quantum circuits for feature extraction in hierarchical RL outperforms classical baselines with 66% parameter savings, but quantum value estimation degrades results.
QuanForge introduces statistical mutation killing and nine post-training mutation operators for QNNs to distinguish test suites and localize vulnerable circuit regions.
A compact 2-qubit QNN approximates Black-Scholes-Merton option prices with usable accuracy when executed on multiple commercial NISQ quantum processors.
QPINN combines quantum feature mapping via Nyström method with physics-informed constraints to achieve 99.46% average SOH estimation accuracy on a 310k-sample multi-chemistry battery dataset, outperforming baselines by up to 65% in MAPE.
Quantum advantage in hadronic tomography should be evaluated selectively for CFFs, GPDs, TMDs, and GTMDs because their light-front and real-time correlation functions create ill-posed inverse problems that quantum algorithms may address at algorithmic, computational, and inference levels.
citing papers explorer
-
Beyond Gates: Pulse Level Quantum Fourier Models
Pulse-level parameterization of quantum Fourier models replaces single gate angles with multiple independent sub-angles, relaxing monomial couplings and improving gradient descent performance on Fourier series tasks.
-
Local tensor-train surrogates for quantum learning models
Local tensor-train surrogates approximate quantum machine learning models via Taylor polynomials and tensor networks, delivering polynomial parameter scaling and explicit generalization bounds controlled by patch radius.
-
Quantum Injection Pathways for Implicit Graph Neural Networks
Independent quantum signal injection into graph DEQs yields higher test accuracy and fewer solver iterations than state-dependent or backbone-dependent injection and classical equilibrium models on NCI1, PROTEINS, and MUTAG benchmarks.
-
Quantum Hierarchical Reinforcement Learning via Variational Quantum Circuits
Hybrid agent with variational quantum circuits for feature extraction in hierarchical RL outperforms classical baselines with 66% parameter savings, but quantum value estimation degrades results.
-
QuanForge: A Mutation Testing Framework for Quantum Neural Networks
QuanForge introduces statistical mutation killing and nine post-training mutation operators for QNNs to distinguish test suites and localize vulnerable circuit regions.
-
Option Pricing on Noisy Intermediate-Scale Quantum Computers: A Quantum Neural Network Approach
A compact 2-qubit QNN approximates Black-Scholes-Merton option prices with usable accuracy when executed on multiple commercial NISQ quantum processors.
-
Battery health prognosis using Physics-informed neural network with Quantum Feature mapping
QPINN combines quantum feature mapping via Nyström method with physics-informed constraints to achieve 99.46% average SOH estimation accuracy on a 310k-sample multi-chemistry battery dataset, outperforming baselines by up to 65% in MAPE.
-
Toward selective quantum advantage in hadronic tomography:explicit cases from Compton form factors, GPDs, TMDs, and GTMDs
Quantum advantage in hadronic tomography should be evaluated selectively for CFFs, GPDs, TMDs, and GTMDs because their light-front and real-time correlation functions create ill-posed inverse problems that quantum algorithms may address at algorithmic, computational, and inference levels.