ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2404.02414
  4. Cited By
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

3 April 2024
Zherui Chen
Giacomo Nannicini
ArXivPDFHTML

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 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
Approximation algorithms for the normalizing constant of Gibbs distributions
M. Huber
48
40
0
12 Jun 2012
1