REVIEW 1 cited by
Estimating the Number of States via the Rodeo Algorithm for Quantum Computation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Estimating the Number of States via the Rodeo Algorithm for Quantum Computation
read the original abstract
In the realm of statistical physics, the number of states in which a system can be realized with a given energy is a key concept that bridges the microscopic and macroscopic descriptions of physical systems. For quantum systems, many approaches rely on the solution of the Schr\"odinger equation. In this work, we demonstrate how the recently developed rodeo algorithm can be utilized to determine the number of states associated with all energy levels without any prior knowledge of the eigenstates. Quantum computers, with their innate ability to address the intricacies of quantum systems, make this approach particularly promising for the study of the thermodynamics of those systems. To illustrate the procedure's effectiveness, we apply it to compute the number of states of the 1D transverse-field Ising model and, consequently, its specific heat, proving the reliability of the method presented here.
Forward citations
Cited by 1 Pith paper
-
A Kernel-Based Density of States Estimator for Quantum Computing
Haar-averaged Rodeo responses equal the density of states convolved with a kernel fixed by the evolution-time distribution, yielding a single-ancilla quantum DoS estimator.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.