arXiv subjects

Daiki Sasaki

Publications and source records attributed to Daiki Sasaki.

3 recordsLinked to original sources

arXiv2026

Quantum Sensing of Non-Repeatable Events Enhanced by In-Sensor Quantum Reservoir Computing

High-density nitrogen-vacancy (NV) ensembles in diamond enable sensitive magnetometry. Many quantum-sensing protocols rely on reproducible target fields, allowing repeated measurements under different sensing conditions. In dynamical decoupling (DD) magnetometry, sweeping the interval between $\pi$ pulses across repeated measurements enables estimation of the frequency and amplitude of an unknown alternating field. For non-repeatable events, however, the same field waveform cannot be reproduced for measurements under different settings. Here we propose NV-based in-sensor quantum reservoir computing (NV-QRC) for sensing such events. Field-driven many-body dynamics and simultaneous fluorescence readout from multiple spatial regions provide a classical classifier with multiple features from a single event. For binary phase classification, we benchmark NV-QRC against DD magnetometry using a single pulse sequence fixed in advance. We show that NV-QRC can retain class-dependent information in regimes where the fixed-DD protocol fails to capture it. These results identify non-repeatable-event sensing as a promising application of quantum reservoir computing.

quant-ph↗

arXiv2026

Tree Tensor Network Reservoir Computing: Hierarchical Ensemble with Invariant Phase Boundaries

We propose Tree Tensor Network Reservoir Computing (TTN-RC), a quantum-inspired reservoir computing framework for time-series prediction that uses the hierarchical structure of Tree Tensor Networks as a random reservoir. To control the exponential concentration or divergence of TTN outputs, we introduce a hierarchical ensemble method that partitions a fixed-size reservoir into multiple independent sub-reservoirs. In the tested NARMA benchmarks, TTN-RC achieves competitive or improved performance compared with conventional Echo State Networks, especially for tasks requiring higher-order nonlinear processing and longer contextual dependence. We also derive an expected contraction rate based on the reservoir Jacobian and develop a mean-field description of the reservoir-state statistics. These analyses identify an asymptotic stability boundary at $\sigma_{T}=\sqrt{2}$ in the large per-tree-size limit, where several theoretical indicators converge. Our results provide a design principle for tensor-network-based reservoir computing and clarify how hierarchical reservoir topology controls stability and nonlinear information processing.

quant-ph↗

arXiv2025

Hamiltonian-Driven Architectures for Non-Markovian Quantum Reservoir Computing

We propose a Hamiltonian-level framework for non-Markovian quantum reservoir computing directly tailored for analog hardware implementations. By dividing the reservoir into a system block and an environment block and evolving their joint state under a unified Hamiltonian, our architecture naturally embeds memory backflow by harnessing entanglement-induced information backflow with tunable coupling strengths. Numerical benchmarks on short-term memory tasks demonstrate that operating in non-Markovian regimes yields significantly slower memory decay compared to the Markovian limit. Further analyzing the echo-state property (ESP), showing that the non-Markovian quantum reservoir evolves from two different initial states, they do not converge to the same trajectory even after a long time, strongly suggesting that the ESP is effectively violated. Our work provides the first demonstration in quantum reservoir computing that strong non-Markovianity can fundamentally violate the ESP, such that conventional linear-regression readouts fail to deliver stable training and inference. Finally, we experimentally showed that, with an appropriate time-evolution step size, the non-Markovian reservoir exhibits superior performance on higher-order nonlinear autoregressive moving-average(NARMA) tasks.

quant-ph↗