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. 2207.08643
  4. Cited By
A Sublinear-Time Quantum Algorithm for Approximating Partition Functions

A Sublinear-Time Quantum Algorithm for Approximating Partition Functions

18 July 2022
A. Cornelissen
Yassine Hamoudi
ArXivPDFHTML

Papers citing "A Sublinear-Time Quantum Algorithm for Approximating Partition Functions"

5 / 5 papers shown
Title
Quantum Algorithm for Sparse Online Learning with Truncated Gradient
  Descent
Quantum Algorithm for Sparse Online Learning with Truncated Gradient Descent
Debbie Lim
Yixian Qiu
P. Rebentrost
Qisheng Wang
28
0
0
06 Nov 2024
Quantum Algorithms and Lower Bounds for Finite-Sum Optimization
Quantum Algorithms and Lower Bounds for Finite-Sum Optimization
Yexin Zhang
Chenyi Zhang
Cong Fang
Liwei Wang
Tongyang Li
37
2
0
05 Jun 2024
Quantum Non-Identical Mean Estimation: Efficient Algorithms and
  Fundamental Limits
Quantum Non-Identical Mean Estimation: Efficient Algorithms and Fundamental Limits
Jiachen Hu
Tongyang Li
Xinzhao Wang
Yecheng Xue
Chenyi Zhang
Han Zhong
26
0
0
21 May 2024
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
16
0
0
03 Apr 2024
Stochastic Quantum Sampling for Non-Logconcave Distributions and
  Estimating Partition Functions
Stochastic Quantum Sampling for Non-Logconcave Distributions and Estimating Partition Functions
Guneykan Ozgul
Xiantao Li
Mehrdad Mahdavi
Chunhao Wang
24
4
0
17 Oct 2023
1