Robust and Efficient Quantum Reservoir Computing with Discrete Time Crystal
Not on the map. Why?
Abstract (arXiv)
The rapid development of machine learning and quantum computing has placed quantum machine learning at the forefront of research. However, existing quantum machine learning algorithms based on quantum variational algorithms face challenges in trainability and noise robustness. In order to address these challenges, we introduce a gradient-free, noise-robust quantum reservoir computing algorithm that harnesses discrete time crystal dynamics as a reservoir. We first calibrate the memory, nonlinear, and information scrambling capacities of the quantum reservoir, revealing their correlation with dynamical phases and non-equilibrium phase transitions. We then apply the algorithm to the binary classification task and establish a comparative quantum kernel advantage. For ten-class classification, both noisy simulations and experimental results on superconducting quantum processors match ideal simulations, demonstrating the enhanced accuracy with increasing system size and confirming the topological noise robustness. Our work presents the first experimental demonstration of quantum reservoir computing for image classification based on digital quantum simulation. It establishes the correlation between quantum many-body non-equilibrium phase transitions and quantum machine learning performance, providing new design principles for quantum reservoir computing and broader quantum machine learning algorithms in the NISQ era.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 5 of its 64 references that are in the map. First posted on arXiv 21 Aug 2025.
Builds on
5 of 64 references.
References · 5
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020Power of data in quantum machine learningcited by 338
- 2020Robust data encodings for quantum classifierscited by 91
- 2021Towards understanding the power of quantum kernels in the NISQ eracited by 43
Built on by
Citing papers per year: 2026: 2.
2 papers.