arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2109.10486quant-ph
收藏

用quantumClifford抽样估计Gibbs配分函数

Estimating Gibbs partition function with quantumClifford sampling

Yusen Wu, Jingbo Wang

摘要:

配分函数是统计力学中的一个基本量,它的精确计算是任何量子系统和现象统计分析的关键组成部分。然而,对于相互作用的多体量子系统,它的计算通常涉及对指数数量的项求和,因此可能很快变得难以处理。准确有效地估计相应体系哈密顿量的配分函数成为解决量子多体问题的关键。在本文中,我们开发了一个混合量子经典算法估计的配分函数,利用一种新的Clifford采样技术。注意,先前关于配分函数的量子估计的工作需要$\mathcal{O}(1/ε\sqrtΔ)$ -深度量子电路~ \cite{Arunachalam2020Gibbs, Ashley2015Gibbs},其中$Δ$是随机矩阵的最小谱间隙,并且$ε$是乘法误差。我们的算法只需要一个浅的$\mathcal{O}(1)$深度的量子电路,重复$\mathcal{O}(1/ε^2)$次,以提供一个可比较的$ε$近似.浅深度量子电路被认为是目前可用的NISQ(噪声中间尺度量子)设备至关重要。

英文摘要:

The partition function is an essential quantity in statistical mechanics, and its accurate computation is a key component of any statistical analysis of quantum system and phenomenon. However, for interacting many-body quantum systems, its calculation generally involves summing over an exponential number of terms and can thus quickly grow to be intractable. Accurately and efficiently estimating the partition function of its corresponding system Hamiltonian then becomes the key in solving quantum many-body problems. In this paper we develop a hybrid quantum-classical algorithm to estimate the partition function, utilising a novel Clifford sampling technique. Note that previous works on quantum estimation of partition functions require $\mathcal{O}(1/ε\sqrtΔ)$-depth quantum circuits~\cite{Arunachalam2020Gibbs, Ashley2015Gibbs}, where $Δ$ is the minimum spectral gap of stochastic matrices and $ε$ is the multiplicative error. Our algorithm requires only a shallow $\mathcal{O}(1)$-depth quantum circuit, repeated $\mathcal{O}(1/ε^2)$ times, to provide a comparable $ε$ approximation. Shallow-depth quantum circuits are considered vitally important for currently available NISQ (Noisy Intermediate-Scale Quantum) devices.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑