Topological Engine Monitor: Persistent Homology-Based Fault Detection in Finite-Time Quantum Engines
Mira\c{c} Kerem Maden, Asghar Ullah, Baris Coskunuzer, \"Ozg\"ur E. M\"ustecapl{\i}o\u{g}lu

TL;DR
This paper introduces a topological data analysis method for non-invasively detecting faults in finite-time quantum engines, demonstrating robustness over traditional statistical approaches under various noise conditions.
Contribution
The authors develop a novel topological framework using persistent homology for diagnosing control failures in quantum engines, outperforming standard methods in noisy environments.
Findings
TDA-based approach remains robust under realistic noise profiles.
Persistent homology captures microscopic signatures of quantum friction.
Topological diagnostics outperform statistical baselines in fault detection.
Abstract
The reliable operation of finite-time quantum heat engines is fundamentally limited by control imperfections that induce nonadiabatic phase accumulation and quantum friction, degrading the stability of the thermodynamic cycle. Traditional monitoring relies on energetic observables such as instantaneous cycle work; however, under finite-time driving, these quantities exhibit strong fluctuations, obscuring reliable single-shot fault detection without extensive statistical averaging. Here, we apply a topological data analysis (TDA)-based approach to establish a non-invasive, purely geometric framework for diagnosing control failures in finite-time quantum Otto engines. We construct time-delay embeddings from weak measurements and map the dynamics into persistent homology diagrams. We define a scalar quality index based on Wasserstein and Bottleneck distances that tracks control degradation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
