Partition function estimation with a quantum coin toss

Abstract 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_\beta$ 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_\beta[H]=e^{-\beta H/{2}}$ at inverse temperature $\beta$ to the maximally mixed state, realized by a block-encoding of $f_\beta[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 $\mathcal{O}(N/{Z_\beta})$, 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.

Authors

Institutions

Publication Details

Journal
Quantum Science and Technology
Published
2026-11-16
DOI
https://doi.org/10.1088/2058-9565/aec28f
Citations
2
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
1.07
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Partition function estimation with a quantum coin toss

Leandro Aolita, Thais de Lima Silva
2 citations
Quantum Science and Technology
Quantum Computing Algorithms and Architecture
1.07
article

Partition function estimation with a quantum coin toss

Leandro Aolita, Thais de Lima Silva
article en
2 citations

Abstract

Abstract 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_\beta$ 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_\beta[H]=e^{-\beta H/{2}}$ at inverse temperature $\beta$ to the maximally mixed state, realized by a block-encoding of $f_\beta[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 $\mathcal{O}(N/{Z_\beta})$, 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.

Quantum Science and Technology
Technology Innovation Institute (AE)
Openalex Percentile: Top 22%
Quantum Computing Algorithms and Architecture
1.07
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon