arXiv:2610.02636v1 Announce Type: cross
Abstract: Quantum Fourier sampling may help audit the spectral learnability of delay-based physical unclonable functions (PUFs). We ask whether that promise su...
By Owen Friedewald, Ali Shiri Sichani, Chi-Ren Shyu
arXiv:2607. 24714v1 Announce Type: cross Abstract: Trapped-ion quantum computers rely on shuttling compilers, which cast an input algorithm into a sequence of ion-qubit movements within a given architecture.
By Fabian Kreppel, Reza Salkhordeh, Ferdinand Schmidt-Kaler, Andr\'e Brinkmann
arXiv:2607. 25865v1 Announce Type: cross Abstract: Quantum error correction (QEC) is indispensable for scalable fault-tolerant quantum computing.
By Ge Yan, Shanchuan Li, Pengyue Ma, Qixin Zhang, Pingchuan Ma, Jianping Wang, Min-Hsiu Hsieh, Yuxuan Du
The paper investigates the role of quantum computing in network‑security classification through two experiments. First, it evaluates near‑term quantum‑kernel support vector machines on datasets such as KDD Cup 1999, CICIDS2017, and BoT‑IoT, finding that quantum kernels can match or sometimes improve classical baselines, though classical RBF kernels often remain stronger. Second, it explores long‑term memory efficiency using quantum oracle sketching (QOS), showing that quantum methods can achieve comparable accuracy with a smaller effective memory footprint than explicit storage, suggesting a potential advantage in memory‑efficient data access for streaming classification tasks.
By Yuqing Li, Poonam Bala Nehru, Yunpeng Zhang, Danindu Gammanpilage, Xin Jin, Zeguan Wu, Junyu Liu
The study evaluates quantum machine learning (QML) models for network intrusion detection against well-tuned classical baselines across four standard datasets, using a leakage-controlled protocol and noise simulation. It introduces a quantum-attribution audit to determine whether any performance gains are truly due to quantum effects. While most tuned classical models match or surpass QML, two quantum approaches— a quantum-kernel SVM and a small hybrid circuit—show statistically significant advantages on specific metrics and tasks.
By Syeda Anshrah Gillani, Mirza Samad Ahmed Baig, Shahid Munir Shah, Asher Ali, Hamzah Siddiqui
The paper demonstrates that by choosing unit‑quaternion coordinates, encrypted updates for variational quantum circuits become bilinear, allowing depth‑one homomorphic federated learning without bootstrapping. This coordinate choice reduces encrypted rotation updates to a single multiplicative level and federated averaging to zero levels, eliminating the previously prohibitive cost of one round per gate. Experiments across two cryptographic backends and up to 20 clients show negligible aggregation error and no measurable loss in utility, with hardware validation on a 156‑qubit processor achieving near‑optimal fidelity.
By Marcel Mordarski, Nathan Mani, Arshad Patel, William Knottenbelt, Roberto Bondesan