Estimating Gibbs partition function with quantumClifford sampling
- URL: http://arxiv.org/abs/2109.10486v1
- Date: Wed, 22 Sep 2021 02:03:35 GMT
- Title: Estimating Gibbs partition function with quantumClifford sampling
- Authors: Yusen Wu and Jingbo Wang
- Abstract summary: We develop a hybrid quantum-classical algorithm to estimate the partition function.
Our algorithm requires only a shallow $mathcalO(1)$-depth quantum circuit.
Shallow-depth quantum circuits are considered vitally important for currently available NISQ (Noisy Intermediate-Scale Quantum) devices.
- Score: 6.656454497798153
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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.
Related papers
- One-Shot Min-Entropy Calculation And Its Application To Quantum Cryptography [21.823963925581868]
We develop a one-shot lower bound calculation technique for the min-entropy of a classical-quantum state.
It gives an alternative tight finite-data analysis for the well-known BB84 quantum key distribution protocol.
It provides a security proof for a novel source-independent continuous-variable quantum random number generation protocol.
arXiv Detail & Related papers (2024-06-21T15:11:26Z) - A Novel Quantum-Classical Hybrid Algorithm for Determining Eigenstate Energies in Quantum Systems [1.9714447272714082]
This paper presents a novel quantum algorithm, XZ24, for efficiently computing the eigen-energy spectra of arbitrary quantum systems.
XZ24 has three key advantages: It removes the need for eigenstate preparation, requiring only a reference state with non-negligible overlap.
It enables simultaneous computation of multiple eigen-energies, depending on the reference state.
arXiv Detail & Related papers (2024-06-01T04:31:43Z) - Calculating response functions of coupled oscillators using quantum phase estimation [40.31060267062305]
We study the problem of estimating frequency response functions of systems of coupled, classical harmonic oscillators using a quantum computer.
Our proposed quantum algorithm operates in the standard $s-sparse, oracle-based query access model.
We show that a simple adaptation of our algorithm solves the random glued-trees problem in time.
arXiv Detail & Related papers (2024-05-14T15:28:37Z) - A simple lower bound for the complexity of estimating partition functions on a quantum computer [0.20718016474717196]
We study the complexity of estimating the partition function $mathsfZ(beta)=sum_xinchi e-beta H(x)$ for a Gibbs distribution characterized by the Hamiltonian $H(x)$.
We provide a simple and natural lower bound for quantum algorithms that solve this task by relying on reflections through the coherent encoding of Gibbs states.
arXiv Detail & Related papers (2024-04-03T02:38:49Z) - Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries.
One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system.
We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
arXiv Detail & Related papers (2023-10-11T15:59:54Z) - Measuring the Loschmidt amplitude for finite-energy properties of the
Fermi-Hubbard model on an ion-trap quantum computer [27.84599956781646]
We study the operation of a quantum-classical time-series algorithm on a present-day quantum computer.
Specifically, we measure the Loschmidt amplitude for the Fermi-Hubbard model on a $16$-site ladder geometry (32 orbitals) on the Quantinuum H2-1 trapped-ion device.
We numerically analyze the influence of noise on the full operation of the quantum-classical algorithm by measuring expectation values of local observables at finite energies.
arXiv Detail & Related papers (2023-09-19T11:59:36Z) - Quantum algorithms for estimating quantum entropies [6.211541620389987]
We propose quantum algorithms to estimate the von Neumann and quantum $alpha$-R'enyi entropies of an fundamental quantum state.
We also show how to efficiently construct the quantum entropy circuits for quantum entropy estimation using single copies of the input state.
arXiv Detail & Related papers (2022-03-04T15:44:24Z) - Quantum State Preparation with Optimal Circuit Depth: Implementations
and Applications [10.436969366019015]
We show that any $Theta(n)$-depth circuit can be prepared with a $Theta(log(nd)) with $O(ndlog d)$ ancillary qubits.
We discuss applications of the results in different quantum computing tasks, such as Hamiltonian simulation, solving linear systems of equations, and realizing quantum random access memories.
arXiv Detail & Related papers (2022-01-27T13:16:30Z) - A quantum Poisson solver implementable on NISQ devices (improved
version) [23.69613801851615]
We propose a compact quantum algorithm for solving one-dimensional Poisson equation based on simple Ry rotation.
The solution error comes only from the finite difference approximation of the Poisson equation.
Our quantum Poisson solver (QPS) has gate-complexity of 3n in qubits and 4n3 in one- and two-qubit gates, where n is the logarithmic of the dimension of the linear system of equations.
arXiv Detail & Related papers (2020-05-01T07:38:07Z) - Quantum Gram-Schmidt Processes and Their Application to Efficient State
Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state.
Our protocol suits the case that the output state lies in the row space of the input matrix.
One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.