LIVEJoin the current RTAI Connect sessionJoin now

ResearchTrend.AI
A simple lower bound for the complexity of estimating partition functions on a quantum computer

A simple lower bound for the complexity of estimating partition functions on a quantum computer

Zherui Chen
Giacomo Nannicini
ArXivPDFHTML

Papers citing "A simple lower bound for the complexity of estimating partition functions on a quantum computer"

3 / 3 papers shown
Title
A Sublinear-Time Quantum Algorithm for Approximating Partition Functions
A Sublinear-Time Quantum Algorithm for Approximating Partition Functions
A. Cornelissen
Yassine Hamoudi
56
19
0
18 Jul 2022
Estimating Normalizing Constants for Log-Concave Distributions: Algorithms and Lower Bounds
Estimating Normalizing Constants for Log-Concave Distributions: Algorithms and Lower Bounds
Rong Ge
Holden Lee
Jianfeng Lu
47
22
0
08 Nov 2019
Approximation algorithms for the normalizing constant of Gibbs distributions
Approximation algorithms for the normalizing constant of Gibbs distributions
M. Huber
62
40
0
12 Jun 2012

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.