Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2404.02414
Cited By
A simple lower bound for the complexity of estimating partition functions on a quantum computer
3 April 2024
Zherui Chen
Giacomo Nannicini
Re-assign community
ArXiv
PDF
HTML
Papers citing
"A simple lower bound for the complexity of estimating partition functions on a quantum computer"
2 / 2 papers shown
Title
A Sublinear-Time Quantum Algorithm for Approximating Partition Functions
A. Cornelissen
Yassine Hamoudi
39
19
0
18 Jul 2022
Approximation algorithms for the normalizing constant of Gibbs distributions
M. Huber
48
40
0
12 Jun 2012
1