# Estimating Gibbs partition function with quantumClifford sampling

@inproceedings{Wu2021EstimatingGP, title={Estimating Gibbs partition function with quantumClifford sampling}, author={Yusen Wu and Jingbo B. Wang}, year={2021} }

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… Expand

#### Figures and Tables from this paper

#### One Citation

Probabilistic imaginary-time evolution by using forward and backward real-time evolution with a single ancilla: first-quantized eigensolver of quantum chemistry for ground states

- Physics
- 2021

Imaginary-time evolution (ITE) on a quantum computer is a promising formalism for obtaining the ground state of a quantum system. As a kind of it, the probabilistic ITE (PITE) takes advantage of… Expand

#### References

SHOWING 1-10 OF 39 REFERENCES

Quantum algorithm for approximating partition functions

- Physics
- 2009

We achieve a quantum speed-up of fully polynomial randomized approximation schemes (FPRAS) for estimating partition functions that combine simulated annealing with the Monte-Carlo Markov Chain method… Expand

Simpler (Classical) and Faster (Quantum) Algorithms for Gibbs Partition Functions

- Physics, Mathematics
- 2021 IEEE International Conference on Quantum Computing and Engineering (QCE)
- 2021

We give classical and quantum algorithms for approximating partition functions of classical Hamiltonians at a given temperature. Specifically, we modify the classical algorithm of Štefankovič,… Expand

A quantum–quantum Metropolis algorithm

- Physics, Mathematics
- Proceedings of the National Academy of Sciences
- 2012

This work presents a quantum algorithm which fully generalizes the classical Metropolis algorithm to the quantum domain, and offers a quantum speedup relative to the classical counterpart. Expand

Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution

- Mathematics, Physics
- Nature Physics
- 2019

The accurate computation of Hamiltonian ground, excited and thermal states on quantum computers stands to impact many problems in the physical and computer sciences, from quantum simulation to… Expand

Quantum Metropolis sampling

- Physics, Medicine
- Nature
- 2011

This paper demonstrates how to implement a quantum version of the Metropolis algorithm, a method that has basically acquired a monopoly on the simulation of interacting particles and permits sampling directly from the eigenstates of the Hamiltonian, and thus avoids the sign problem present in classical simulations. Expand

Optimal Hamiltonian Simulation by Quantum Signal Processing.

- Mathematics, Medicine
- Physical review letters
- 2017

It is argued that physical intuition can lead to optimal simulation methods by showing that a focus on simple single-qubit rotations elegantly furnishes an optimal algorithm for Hamiltonian simulation, a universal problem that encapsulates all the power of quantum computation. Expand

Efficient quantum circuits for Szegedy quantum walks

- Computer Science, Physics
- 2016

This paper presents a general scheme to construct efficient quantum circuits for Szegedy quantum walks that correspond to classical Markov chains possessing transformational symmetry in the columns of the transition matrix, and proves that this scheme can be applied toMarkov chains formed by a tensor product. Expand

Efficient quantum walk on a quantum processor

- Computer Science, Medicine
- Nature communications
- 2016

This work presents explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs that indicate a family of tasks that could ultimately demonstrate quantum supremacy over classical computers. Expand

Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics

- Computer Science, Mathematics
- STOC
- 2019

A new “Quantum singular value transformation” algorithm is developed that can directly harness the advantages of exponential dimensionality by applying polynomial transformations to the singular values of a block of a unitary operator. Expand

Quantum advantage with shallow circuits

- Mathematics, Medicine
- Science
- 2018

It is shown that parallel quantum algorithms running in a constant time period are strictly more powerful than their classical counterparts; they are provably better at solving certain linear algebra problems associated with binary quadratic forms. Expand