Skip to content

Author

Morteza Saberikamarposhti

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Oct 2026

Does quantum kernel alignment transfer across network intrusion datasets? Cross-dataset consistency, direct transfer and high performance computing cost of entanglement-based feature maps

This study measures two distinct notions of transferability for quantum support vector machines (QSVMs) across InSDN, CICIDS2017 and CIC-DDoS2019: cross-dataset consistency of kernel alignment (KA), and direct transfer of an InSDN-trained kernel classifier to the other two datasets without any target-side fitting.

Morteza Saberikamarposhti, Paria Rezaei, Ahmad Sahban Rafsanjani · 0 citations
Preprint Sep 2026

Quantum Meta-Complexity Is All You Need: Characterizing One-Way Puzzles via Time-Bounded Kolmogorov Complexity

The polynomial-time coding theorem is isolated as the single load-bearing open conjecture of the time-bounded meta-complexity program, it is proved that it implies the full polynomial-time characterization, and why the classical derandomization proof resists quantization is analyzed.

Morteza Saberikamarposhti · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.