Optimal Algorithmic Cooling of Spins
Yuval Elias, Jos\'e M. Fernandez, Tal Mor, Yossi Weinstein

TL;DR
This paper introduces new exhaustive algorithmic cooling algorithms for spins, including the all-bonacci method, aiming to optimize cooling in quantum computing applications for improved molecular identification.
Contribution
It presents novel exhaustive cooling algorithms, notably the all-bonacci, achieving maximal cooling in the context of quantum spin systems.
Findings
All-bonacci algorithm reaches maximal cooling.
New algorithms outperform previous methods.
Potential applications in molecular identification.
Abstract
Algorithmic Cooling (AC) of Spins is potentially the first near-future application of quantum computing devices. Straightforward quantum algorithms combined with novel entropy manipulations can result in a method to improve the identification of molecules. We introduce here several new exhaustive cooling algorithms, such as the Tribonacci and k-bonacci algorithms. In particular, we present the ``all-bonacci'' algorithm, which appears to reach the maximal degree of cooling obtainable by the optimal AC approach.
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.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum many-body systems
