Answers are grounded in this paper and cite their sources.
Estimating quantum partition functions is a critical task in a variety of fields. However, the problem is classically intractable in general due to the exponential scaling of the Hamiltonian dimension N in the number of particles. This paper introduces a quantum algorithm for estimating the partition function Z_β of a generic Hamiltonian H up to multiplicative error based on a quantum coin toss. The coin is defined by the probability of applying the quantum imaginary-time evolution propagator f_β[H]=e^-β H/2 at inverse temperature β to the maximally mixed state, realized by a block-encoding of f_β[H] into a unitary quantum circuit followed by a post-selection measurement. Our algorithm does not use costly subroutines such as quantum phase estimation or amplitude amplification; and the binary nature of the coin allows us to invoke tools from Bernoulli-process analysis to prove a runtime scaling as O(N/Z_β), quadratically better than previous general-purpose algorithms using similar quantum resources. Moreover, since the coin is defined by a single observable, the method lends itself well to quantum error mitigation. We test the resulting coin-estimation protocol in practice with a proof-of-concept 9-qubit experiment using variationally compiled block-encodings. Our findings offer an interesting alternative for quantum partition function estimation relevant to early-fault quantum hardware.
No takes yet. Share an insight, caveat, or question.
Silva et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: