Tootfinder

Computational complexity of the homology problem with orientable filtration: MA-completeness
Ryu Hayakawa, Casper Gyurik, Mahtab Yaghubi Rad, Vedran Dunjko
https://arxiv.org/abs/2510.07014

Computational complexity of the homology problem with orientable filtration: MA-completeness
We show the existence of an MA-complete homology problem for a certain subclass of simplicial complexes. The problem is defined through a new concept of orientability of simplicial complexes that we call a "uniform orientable filtration", which is related to sign-problem freeness in homology. The containment in MA is achieved through the design of new, higher-order random walks on simplicial complexes associated with the filtration. For the MA-hardness, we design a new gadget with which we can …

Crosslisted article(s) found for math.AT. https://arxiv.org/list/math.AT/new
[1/1]:
- Computational complexity of the homology problem with orientable filtration: MA-completeness
Ryu Hayakawa, Casper Gyurik, Mahtab Yaghubi Rad, Vedran Dunjko

From quantum feature maps to quantum reservoir computing: perspectives and applications
Casper Gyurik, Filip Wudarski, Evan Philip, Antonio Sannia, Hossein Sadeghi, Oleksandr Kyriienko, Davide Venturelli, Antonio A. Gentile
https://arxiv.org/abs/2510.01797

From quantum feature maps to quantum reservoir computing: perspectives and applications
We explore the interplay between two emerging paradigms: reservoir computing and quantum computing. We observe how quantum systems featuring beyond-classical correlations and vast computational spaces can serve as non-trivial, experimentally viable reservoirs for typical tasks in machine learning. With a focus on neutral atom quantum processing units, we describe and exemplify a novel quantum reservoir computing (QRC) workflow. We conclude exploratively discussing the main challenges ahead, whi…