Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice
OISHIK KAR IIIT Dharwad

OISHIK KAR IIIT Dharwad

Joined February 27, 2026

Karma 0

Overview
Last submissions
Datasets
Workspaces
Papers
Last comments
Last topics
Organizations

Photonic quantum reservoir computing on real financial surfaces: identifying the structural ceiling of near-random-walk data

Oishik Kar, Aditya Raj, Aswath Babu H

Abstract Quantum machine learning is increasingly proposed for financial time series, yet practitioners have no way to predict whether quantum reservoir computing (QRC) will outperform classical baselines on a given dataset before committing resources. We propose a pre-experimental screening framework, built on persistence R 2 and principal component analysis (PCA) variance decomposition, that makes this prediction possible. We validate the framework using a 10-mode Boson sampling circuit (252 features) on three market datasets (US Treasury yields, CBOE VIX, crude oil) and a diagnostic nonlinear control. On the market data, the screening tool correctly predicts a structural ceiling : because financial surfaces follow near-random-walk dynamics (persistence R 2 > 0.95 , 3 PCA components), QRC collapses to the performance of classical Ridge regression ( R 2 = 0.9797 vs 0.9798 on Treasuries, with persistence at 0.9793 ). On the nonlinear control, the framework correctly predicts that a nonlinear feature map will outperform linear Ridge. Running the actual Boson sampling QRC on this control confirms the prediction: the quantum circuit achieves R 2 = 0.816 ± 0.007 , cleanly outperforming classical Ridge ( R 2 = 0.77 ) on a dataset where persistence completely fails ( R 2 = − 1.64 ). The proposed screening test can be computed from the raw data alone, before any quantum circuit is built.

Physica Scripta•Oct 15, 2026•0 citations

When Does Interference Help Learning? Kernel Geometry as a Pre-Experimental Test for Photonic Reservoir Computing

Oishik Kar, Aswath Babu H

Multi-photon interference is the resource most native to photonic quantum machine learning, yet experiments on photonic reservoirs have reported advantages, null results, and train-only effects. These outcomes cannot be compared: each measures task-dependent accuracy on different tasks and platforms. Here we resolve the question task-independently through the kernel geometry of boson-sampling feature maps. Interference redistributes feature variance across roughly twice as many effective dimensions as distinguishable-particle statistics, generating a large geometric separation between the corresponding kernels. The separation grows superlinearly with indistinguishability, is linear in Hong--Ou--Mandel visibility at small visibility for two to four photons, and retains approximately 80% of its magnitude at the source quality of current quantum processors. Under experimental sampling budgets the separation is learnable on adversarially constructed tasks (accuracy advantage +0.22 plus or minus 0.05) and an order of magnitude smaller on natural tasks, gated by kernel--task alignment. The results reconcile the existing experimental record and supply a pre-experimental protocol: kernel geometry establishes that an interference-specific learning resource exists, and task alignment determines whether a given task can access it; both are computable before committing significant hardware resources.

quant-pharXiv:2610.11360•Oct 9, 2026•1 citation

Hybrid Photonic-Quantum Reservoir Computing For Time-Series Prediction

Oishik Kar, Aswath Babu H

Motivated by the perspective of advanced time-series prediction and exploitation of Quantum Reservoir Computing (QRC), we explored the design and implementation of a Hybrid Photonic-Quantum Reservoir Computing (HPQRC) paradigm. It brings together the high-speed parallelism of photonic systems with the quantum reservoir's capacity of modeling complex, nonlinear dynamics, and hence acts as a powerful tool for performing real-time prediction in resource resource-constrained environment with low latency. We have engineered a solution using this architecture to address issues like computational bottlenecks, energy inefficiency, and sensitivity to noise that are common in existing reservoir computing models. Our simulation results show that HPQRC attains much higher accuracy with lower computational time than both classical and quantum-only models. This model is robust when environments are noisy and scales well across large datasets, and therefore is suitable for application on diverse problems such as financial forecasting, industrial automation, and smart sensor networks. Our results substantiate that HPQRC performs significantly faster than traditional architectures and could be a viable and highly scalable platform for actual edge computing systems. Overall, HPQRC demonstrates significant advancements in time series modeling capabilities. In combination with enhanced predictive accuracy with reduced computational requirements, HPQRC establishes itself as an effective analytical tool for complex dynamic systems that require both precision and processing efficiency.

quant-pharXiv:2511.09218•Nov 13, 2025
Abstract Quantum machine learning is increasingly proposed for financial time series, yet practitioners have no way to predict whether quantum reservoir computing (QRC) will outperform classical baselines on a given dataset before committing resources. We propose a pre-experimental screening framework, built on persistence R 2 and principal component analysis (PCA) variance decomposition, that makes this prediction possible. We validate the framework using a 10-mode Boson sampling circuit (252 features) on three market datasets (US Treasury yields, CBOE VIX, crude oil) and a diagnostic nonlinear control. On the market data, the screening tool correctly predicts a structural ceiling : because financial surfaces follow near-random-walk dynamics (persistence R 2 > 0.95 , 3 PCA components), QRC collapses to the performance of classical Ridge regression ( R 2 = 0.9797 vs 0.9798 on Treasuries, with persistence at 0.9793 ). On the nonlinear control, the framework correctly predicts that a nonlinear feature map will outperform linear Ridge. Running the actual Boson sampling QRC on this control confirms the prediction: the quantum circuit achieves R 2 = 0.816 ± 0.007 , cleanly outperforming classical Ridge ( R 2 = 0.77 ) on a dataset where persistence completely fails ( R 2 = − 1.64 ). The proposed screening test can be computed from the raw data alone, before any quantum circuit is built.
Multi-photon interference is the resource most native to photonic quantum machine learning, yet experiments on photonic reservoirs have reported advantages, null results, and train-only effects. These outcomes cannot be compared: each measures task-dependent accuracy on different tasks and platforms. Here we resolve the question task-independently through the kernel geometry of boson-sampling feature maps. Interference redistributes feature variance across roughly twice as many effective dimensions as distinguishable-particle statistics, generating a large geometric separation between the corresponding kernels. The separation grows superlinearly with indistinguishability, is linear in Hong--Ou--Mandel visibility at small visibility for two to four photons, and retains approximately 80% of its magnitude at the source quality of current quantum processors. Under experimental sampling budgets the separation is learnable on adversarially constructed tasks (accuracy advantage +0.22 plus or minus 0.05) and an order of magnitude smaller on natural tasks, gated by kernel--task alignment. The results reconcile the existing experimental record and supply a pre-experimental protocol: kernel geometry establishes that an interference-specific learning resource exists, and task alignment determines whether a given task can access it; both are computable before committing significant hardware resources.
Motivated by the perspective of advanced time-series prediction and exploitation of Quantum Reservoir Computing (QRC), we explored the design and implementation of a Hybrid Photonic-Quantum Reservoir Computing (HPQRC) paradigm. It brings together the high-speed parallelism of photonic systems with the quantum reservoir's capacity of modeling complex, nonlinear dynamics, and hence acts as a powerful tool for performing real-time prediction in resource resource-constrained environment with low latency. We have engineered a solution using this architecture to address issues like computational bottlenecks, energy inefficiency, and sensitivity to noise that are common in existing reservoir computing models. Our simulation results show that HPQRC attains much higher accuracy with lower computational time than both classical and quantum-only models. This model is robust when environments are noisy and scales well across large datasets, and therefore is suitable for application on diverse problems such as financial forecasting, industrial automation, and smart sensor networks. Our results substantiate that HPQRC performs significantly faster than traditional architectures and could be a viable and highly scalable platform for actual edge computing systems. Overall, HPQRC demonstrates significant advancements in time series modeling capabilities. In combination with enhanced predictive accuracy with reduced computational requirements, HPQRC establishes itself as an effective analytical tool for complex dynamic systems that require both precision and processing efficiency.