Quantum MeanFlow (QMF) is a new quantum generative sampling method that enables single‑step sample generation by learning an average velocity field over a time interval, unlike the multi‑step quantum flow matching (QFM) which requires sequential integration of an ordinary differential equation. Using parameterized quantum circuits, the authors benchmark QMF and QFM on the MNIST dataset, finding that QMF produces lower image quality than multi‑step QFM but outperforms single‑step QFM at every shot count. Both models were executed on IBM quantum computers, and best‑of‑N rejection sampling mitigates device noise without circuit modification, demonstrating QMF’s practicality for efficient single‑step quantum generative sampling.
By Ashish Joshi, Eshaan Mistry, Takahiko Koyama
arXiv:2602. 22241v2 Announce Type: replace-cross Abstract: This work presents a formulation to express and optimize stochastic neural networks as quantum circuits in gate-based quantum computing.
By Bodo Rosenhahn, Tobias J. Osborne, Christoph Hirche
arXiv:2605. 12713v3 Announce Type: replace-cross Abstract: In the field of quantum reservoir computing (QRC), many different computational models and architectures have been proposed.
By Erik L. Connerty, Ethan N. Evans
The paper introduces a hybrid quantum–classical regression framework that uses a lightweight classical embedding as a learnable geometric preconditioner to improve the conditioning of a downstream variational quantum circuit. It further incorporates a curriculum optimization protocol that gradually increases circuit depth and switches from SPSA-based exploration to Adam-based fine‑tuning. Experiments on PDE‑informed and standard regression datasets show that this approach consistently outperforms pure QNN baselines, yielding more stable convergence and reduced structured errors, especially in data‑limited regimes.
By Qingyu Meng, Yangshuai Wang
arXiv:2608. 00850v1 Announce Type: new Abstract: Physics-informed neural networks (PINNs) have emerged as a versatile approach for solving nonlinear partial differential equations (PDEs), yet achieving high accuracy efficiently using these techniques remains challenging for high-dimensional or multiscale systems.
By Fabio Pereira dos Santos, Renato Portugal, J\'ulio de Castro Vargas Fernandes, Lucas Timotheo Sanches
arXiv:2604. 15645v2 Announce Type: replace Abstract: We present QPINNACLE, an open-source computational framework for physics-informed neural networks (PINNs) that integrates modern training strategies, multi-GPU acceleration, and hybrid quantum-classical architectures within a unified modular workflow.
By Ziv Chen, Hemanth Chandravamsi, Shimon Pisnoy, Aaron Goldgewert, Gal Shaviner, Boris Shragner, Steven H. Frankel
arXiv:2605. 06734v2 Announce Type: replace-cross Abstract: Fast Weight Programmers (FWPs) encode temporal dependencies through dynamically updated parameters rather than recurrent hidden states.
By Kuo-Chung Peng, Samuel Yen-Chi Chen, Jiun-Cheng Jiang, Chen-Yu Liu, En-Jui Kuo, Yun-Yuan Wang, Prayag Tiwari, Andrea Ceschini, Chi-Sheng Chen, Yu-Chao Hsu, Chun-Hua Lin, Tai-Yue Li, Antonello Rosato, Massimo Panella, Simon See, Saif Al-Kuwari, Kuan-Cheng Chen, Nan-Yow Chen, Hsi-Sheng Goan
arXiv:2604. 06135v2 Announce Type: replace-cross Abstract: Efficient data loading remains a bottleneck for near-term quantum machine learning.
By Basil Kyriacou, Viktoria Patapovich, Maniraman Periyasamy, Alexey Melnikov
arXiv:2608. 01194v1 Announce Type: cross Abstract: Artificial intelligence has been transformed by deep neural networks, yet the search for new learning architectures continues.
By L\'eo Monbroussou, Maniraman Periyasamy, Viacheslav Kuzmin, Pavel Sekatski, Viktoria Patapovich, Asel Sagingalieva, Alexey Melnikov
The paper reports a large‑scale systematic comparison of 1,368 quantum neural network (QNN) configurations for forecasting the GBP/USD spot exchange rate. By varying encoding methods, ansatz designs, qubit counts, layer depths, and cost functions, the study finds that gate selection and arrangement are more critical than parameter count, and that entanglement is a system‑level property. The top QNN achieves an R² of 0.985, surpassing a classical BiLSTM, while tests on the IQM Emerald device show gate errors and decoherence as major obstacles, with gate choice and circuit depth determining noise resilience.
By Jack Waller, Xing Liang, Dimitrios Makris, Rajagopal Nilavalan
arXiv:2605. 27410v2 Announce Type: replace-cross Abstract: Variational Quantum Algorithms (VQAs) are a leading approach to exploiting near-term quantum hardware, leveraging parameterized quantum circuits and classical optimization to achieve advantage.
By Tung Dao, Son N. Tran, Huynh Thi Thanh Binh
arXiv:2606. 03517v1 Announce Type: cross Abstract: Training quantum neural networks (QNNs) on quantum hardware is currently bottlenecked by the cost of gradient estimation: standard parameter-shift methods require a number of circuit evaluations that grows quadratically with the number of trainable parameters, making hardware-based optimisation impractical beyond small system sizes.
By Natansh Mathur, Panagiotis Kl. Barkoutsos, Masako Yamada, Martin Roetteler, Iordanis Kerenidis