Estimating Gibbs partition function with quantumClifford sampling

Abstract

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/\epsilon \sqrt{\Delta })$-depth quantum circuits~\cite{Arunachalam2020Gibbs, Ashley2015Gibbs}, where $\Delta$ is the minimum spectral gap of stochastic matrices and $\epsilon$ is the multiplicative error. Our algorithm requires only a shallow $\mathcal{O}(1)$-depth quantum circuit, repeated $\mathcal{O}(1/{\epsilon }^2)$ times, to provide a comparable $\epsilon$ approximation. Shallow-depth quantum circuits are considered vitally important for currently available NISQ (Noisy Intermediate-Scale Quantum) devices.

References in corpus (34)

• Barren plateaus in quantum neural network training landscapes
• Quantum Amplitude Amplification and Estimation
• Error mitigation for short-depth quantum circuits
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Extending the computational reach of a noisy superconducting quantum processor
• Hamiltonian Simulation by Qubitization
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Hartree-Fock on a superconducting qubit quantum computer
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Efficient variational quantum simulator incorporating active error minimisation
• Variational ansatz-based quantum simulation of imaginary time evolution
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Practical Quantum Error Mitigation for Near-Future Applications
• Hybrid quantum-classical algorithms and quantum error mitigation
• Robust determination of molecular spectra on a quantum processor
• Quantum advantage with shallow circuits
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• Quantum speedup of Monte Carlo methods
• Quantum Metropolis Sampling
• Strategies for solving the Fermi-Hubbard model on near-term quantum computers
• The SWAP test and the Hong-Ou-Mandel effect are equivalent
• A Quantum-Quantum Metropolis Algorithm
• Error Mitigation by Symmetry Verification on a Variational Quantum Eigensolver
• Efficient Quantum Walk on a Quantum Processor
• A Partial Derandomization of PhaseLift using Spherical Designs
• Quantum Speed-up for Approximating Partition Functions
• The Clifford group fails gracefully to be a unitary 4-design
• Combinatorial optimisation via highly efficient quantum walks
• Efficient quantum circuits for Szegedy quantum walks
• Quantum advantage for computations with limited space
• Experimental parity-time symmetry quantum walks on a directed graph
• Simpler (classical) and faster (quantum) algorithms for Gibbs partition functions

Cited by in corpus (3)

• Calculation of Gibbs partition function with imaginary time evolution on near-term quantum computers
• Orbital Expansion Variational Quantum Eigensolver: Enabling Efficient Simulation of Molecules with Shallow Quantum Circuit
• 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