Finite-Bandwidth Protection of a Three-Level Quantum Heat Engine Against Parasitic Heat Leaks

Abstract:Finite-bandwidth reservoir engineering can suppress unwanted transitions in a quantum thermal machine, but a physical filter also introduces a finite response time. We study this competition in a continuous three-level heat engine whose hot environment couples parasitically to the cold transition. The corresponding three-state rate network is solved exactly, showing that the parasitic transition produces a hot-to-cold thermodynamic short circuit and yielding a closed threshold for the loss of positive-power operation. We then retain a damped auxiliary mode explicitly as a physical spectral filter. Its Lorentzian response suppresses the detuned parasitic transition, whereas excessive narrowing limits the useful energy throughput. Independent local-GKSL and nonsecular Bloch--Redfield calculations both recover the no-leak Markovian engine in the weak-coupling limit and predict a finite maximum-power bandwidth, although its precise location is model dependent. A frequency-resolved Lorentzian-rate reduction, by contrast, has no interior optimum. The resulting design principle is that spectral selectivity can protect the useful thermodynamic cycle, but a real filter cannot be narrowed without a dynamical throughput cost.

arXiv:2609.40038 [quant-ph]

(or arXiv:2609.40038v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.40038 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

https://doi.org/10.3390/e28101081 Focus to learn more DOI(s) linking to related resources

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.