Computational Work Extraction: The Complexity of Catalysts

@misc{arora2026computational,
  title = {{Computational Work Extraction: The Complexity of Catalysts}},
  author = {Atul Singh Arora and Shantanav Chakraborty and Alexandru Cojocaru and Sreyas Saminathan and Uttam Singh},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.40323},
  eprint = {2609.40323},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.40323},
}

TY  - UNPB
TI  - Computational Work Extraction: The Complexity of Catalysts
AU  - Atul Singh Arora
AU  - Shantanav Chakraborty
AU  - Alexandru Cojocaru
AU  - Sreyas Saminathan
AU  - Uttam Singh
PY  - 2026
DA  - 2026/09/30
PB  - arXiv
DO  - 10.48550/arxiv.2609.40323
UR  - https://arxiv.org/abs/2609.40323
AB  - We prove maximal separations: n-qubit systems can have Θ(n) ergotropy, while every efficient process extracts negligible work, even for Hamiltonians consisting of single-qubit terms. We establish an unconditional existential separation and give an explicit construction in the random oracle model. Assuming the existence of quantum-secure pseudorandom functions, this separation extends to the plain model. This work uncovers an important connection between ergotropy and the complexity of catalytic computation---computation where auxiliary qubits must be finally restored to their initial state. Relative to a random oracle, we establish relational and decision problems that: (i) can be solved efficiently with λ catalysts; but (ii) cannot be solved by any algorithm with cλ catalysts, for any c<1. We show this by proving query lower bounds for quantum-space bounded algorithms. As a consequence, for computational ergotropy, catalysts prove to be surprisingly powerful---there is a family of Hamiltonians and states for which catalysts enable efficient extraction of the full Θ(n) ergotropy, while every efficient non-catalytic process extracts negligible work. Furthermore, catalysts also allow us to introduce and instantiate the notion of pseudoergotropy---analogous to pseudorandomness. On the other hand, we show catalysts do not change (information-theoretic) ergotropy. Finally, our work also sheds light on the classical aspect of the problem. First, most of our constructions rely on classical states and Hamiltonians and therefore imply analogous results for classical ergotropy. Second, we show that certain proof of quantumness protocols can be used to generically separate classical and quantum catalytic ergotropy.
ER  -