Thermodynamic recycling of algorithmic failure branches enables information erasure with heat dissipation below the Landauer limit on a quantum processor.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Geometric complexity of physical maps is bounded below by execution error, forcing divergent resources for zero-error state resets in both classical and quantum settings.
citing papers explorer
-
Thermodynamic Recycling of Algorithmic Failure Branches: Quantum-Computer Demonstration with Quantum Error Correction
Thermodynamic recycling of algorithmic failure branches enables information erasure with heat dissipation below the Landauer limit on a quantum processor.
-
Geometric complexity in thermodynamics
Geometric complexity of physical maps is bounded below by execution error, forcing divergent resources for zero-error state resets in both classical and quantum settings.