Thermodynamic Recycling in Quantum Computing: Demonstration Using the Harrow-Hassidim-Lloyd Algorithm and Information Erasure

• URL: http://arxiv.org/abs/2601.07522v1
• Date: Mon, 12 Jan 2026 13:25:08 GMT
• Title: Thermodynamic Recycling in Quantum Computing: Demonstration Using the Harrow-Hassidim-Lloyd Algorithm and Information Erasure
• Authors: Nobumasa Ishida, Yoshihiko Hasegawa,
• Abstract summary: We propose a framework that reuses failure branches as thermodynamic resources.<n>By coupling this bath to a target system prior to relaxation, useful thermodynamic tasks can be performed.<n>We demonstrate the framework by implementing the Harrow-Hassidim-Lloyd algorithm on IBM's superconducting quantum processor.
• Score: 0.3867363075280543
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Branch selection, including postselection, is a standard method for implementing nonunitary transformations in quantum algorithms. Conventionally, states associated with unsuccessful branches are discarded and treated as useless. Here we propose a generic framework that reuses these failure branches as thermodynamic resources. The central element is an athermal bath that is naturally generated during the reset of a failure branch. By coupling this bath to a target system prior to relaxation, useful thermodynamic tasks can be performed, enabling performance beyond conventional thermodynamic limits. As an application, we analyze information erasure and derive the resulting gain analytically. We further demonstrate the framework by implementing the Harrow-Hassidim-Lloyd algorithm on IBM's superconducting quantum processor. Despite substantial noise and errors in current hardware, our method achieves erasure with heat dissipation below the Landauer limit. These results establish a practical connection between quantum computing and quantum thermodynamics and suggest a route toward reducing thermodynamic costs in future large-scale quantum computers.

Related papers

• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• Thermodynamic significance of QUBO encoding on quantum annealers [0.0]
  We study a Job Shop Scheduling instance using a two- parameter family of encodings controlled by penalty weights.<n>We find that the same encoding transitions that govern computational hardness also reorganize dissipation.<n>Our results establish QUBO penalties as thermodynamic control knobs and motivate thermodynamics-aware encoding strategies for noisy intermediate-scale quantum annealers.
  arXiv  Detail & Related papers  (2026-01-07T21:18:54Z)
• Solving the 3D Heat Equation with VQA via Remeshing-Based Warm Starts [0.0]
  Variational Quantum Algorithms (VQAs) have emerged as a leading candidate for near-term applications.<n>In this work, we investigate the use of VQAs to solve PDEs arising in stationary heat transfer.<n>This work provides a practical methodology for applying VQAs to PDEs, offering insight into the capabilities and limitations of current quantum hardware.
  arXiv  Detail & Related papers  (2025-10-17T13:34:42Z)
• Efficient Quantum Gibbs Sampling with Local Circuits [0.2796197251957244]
  We show a way to implement breakthrough algorithms based on the simulation of well-designed dissipative processes.<n>We rigorously prove that the approximations we use have little effect on rapid mixing at high temperatures.<n>Results provide the first provably efficient quantum thermalization protocol implementable on near-term quantum devices.
  arXiv  Detail & Related papers  (2025-06-04T18:00:02Z)
• Physics-Informed Neural Networks for an optimal counterdiabatic quantum computation [32.73124984242397]
  We introduce a novel methodology that leverages the strength of Physics-Informed Neural Networks (PINNs) to address the counterdiabatic (CD) protocol in the optimization of quantum circuits comprised of systems with $N_Q$ qubits. The main applications of this methodology have been the $mathrmH_2$ and $mathrmLiH$ molecules, represented by a 2-qubit and 4-qubit systems employing the STO-3G basis.
  arXiv  Detail & Related papers  (2023-09-08T16:55:39Z)
• Quantum Thermal State Preparation [39.91303506884272]
  We introduce simple continuous-time quantum Gibbs samplers for simulating quantum master equations. We construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states. Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time.
  arXiv  Detail & Related papers  (2023-03-31T17:29:56Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Preparing thermal states on noiseless and noisy programmable quantum processors [0.0]
  We provide two quantum algorithms with provable guarantees to prepare thermal states on near-term quantum computers. The first algorithm is inspired by the natural thermalization process where the ancilla qubits act as the infinite thermal bath. The second algorithm works for any system and in general runs in exponential time.
  arXiv  Detail & Related papers  (2021-12-29T18:06:36Z)
• On estimating the entropy of shallow circuit outputs [49.1574468325115]
  Estimating the entropy of probability distributions and quantum states is a fundamental task in information processing. We show that entropy estimation for distributions or states produced by either log-depth circuits or constant-depth circuits with gates of bounded fan-in and unbounded fan-out is at least as hard as the Learning with Errors problem.
  arXiv  Detail & Related papers  (2020-02-27T15:32:08Z)
• Simulation of Thermal Relaxation in Spin Chemistry Systems on a Quantum Computer Using Inherent Qubit Decoherence [53.20999552522241]
  We seek to take advantage of qubit decoherence as a resource in simulating the behavior of real world quantum systems. We present three methods for implementing the thermal relaxation. We find excellent agreement between our results, experimental data, and the theoretical prediction.
  arXiv  Detail & Related papers  (2020-01-03T11:48:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.