Kernel-Function Based Quantum Algorithms for Finite Temperature Quantum
Simulation
- URL: http://arxiv.org/abs/2202.01170v2
- Date: Tue, 30 Aug 2022 16:06:53 GMT
- Title: Kernel-Function Based Quantum Algorithms for Finite Temperature Quantum
Simulation
- Authors: Hai Wang, Jue Nan, Tao Zhang, Xingze Qiu, Wenlan Chen, and Xiaopeng Li
- Abstract summary: We present a quantum kernel function (QKFE) algorithm for solving thermodynamic properties of quantum many-body systems.
As compared to its classical counterpart, namely the kernel method (KPM), QKFE has an exponential advantage in the cost of both time and memory.
We demonstrate its efficiency with applications to one and two-dimensional quantum spin models, and a fermionic lattice.
- Score: 5.188498150496968
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Computing finite temperature properties of a quantum many-body system is key
to describing a broad range of correlated quantum many-body physics from
quantum chemistry and condensed matter to thermal quantum field theories.
Quantum computing with rapid developments in recent years has a huge potential
to impact the computation of quantum thermodynamics. To fulfill the potential
impacts, it is crucial to design quantum algorithms that utilize the
computation power of the quantum computing devices. Here we present a quantum
kernel function expansion (QKFE) algorithm for solving thermodynamic properties
of quantum many-body systems. In this quantum algorithm, the many-body density
of states is approximated by a kernel-Fourier expansion, whose expansion
moments are obtained by random state sampling and quantum interferometric
measurements. As compared to its classical counterpart, namely the kernel
polynomial method (KPM), QKFE has an exponential advantage in the cost of both
time and memory. In computing low temperature properties, QKFE becomes
inefficient, as similar to classical KPM. To resolve this difficulty, we
further construct a thermal ensemble and approaches the low temperature regime
step-by-step. For quantum Hamiltonians, whose ground states are preparable with
polynomial quantum circuits, THEI has an overall polynomial complexity. We
demonstrate its efficiency with applications to one and two-dimensional quantum
spin models, and a fermionic lattice. With our analysis on the realization with
digital and analogue quantum devices, we expect the quantum algorithm is
accessible to current quantum technology.
Related papers
- Quantum decoherence from complex saddle points [0.0]
Quantum decoherence is the effect that bridges quantum physics to classical physics.
We present some first-principle calculations in the Caldeira-Leggett model.
We also discuss how to extend our work to general models by Monte Carlo calculations.
arXiv Detail & Related papers (2024-08-29T15:35:25Z) - Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
We explore the applicability of quantum-data learning to practical problems in high-energy physics.
We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states.
The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
arXiv Detail & Related papers (2023-06-29T18:00:01Z) - Calculating the many-body density of states on a digital quantum
computer [58.720142291102135]
We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer.
We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
arXiv Detail & Related papers (2023-03-23T17:46:28Z) - Quantum Computing Quantum Monte Carlo [8.69884453265578]
We propose a hybrid quantum-classical algorithm that integrates quantum computing and quantum Monte Carlo.
Our work paves the way to solving practical problems with intermediatescale and early-fault tolerant quantum computers.
arXiv Detail & Related papers (2022-06-21T14:26:24Z) - Exploring Finite Temperature Properties of Materials with Quantum
Computers [0.0]
Canonical thermal pure quantum (TPQ) states provide a promising path to estimating thermal properties of quantum materials.
We present an algorithm for preparing canonical TPQ states on quantum computers.
arXiv Detail & Related papers (2021-09-03T16:55:04Z) - Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems.
Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
arXiv Detail & Related papers (2021-08-30T23:50:05Z) - Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems.
We propose an algorithm to implement imaginary time propagation on a quantum computer.
arXiv Detail & Related papers (2021-02-24T12:48:00Z) - Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit.
Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z) - Quantum simulation of open quantum systems in heavy-ion collisions [0.0]
We present a framework to simulate the dynamics of hard probes such as heavy quarks or jets in a hot, strongly-coupled quark-gluon plasma (QGP) on a quantum computer.
Our work demonstrates the feasibility of simulating open quantum systems on current and near-term quantum devices.
arXiv Detail & Related papers (2020-10-07T18:00:02Z) - Electronic structure with direct diagonalization on a D-Wave quantum
annealer [62.997667081978825]
This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer.
We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
arXiv Detail & Related papers (2020-09-02T22:46:47Z) - Simulating quantum chemistry in the seniority-zero space on qubit-based
quantum computers [0.0]
We combine the so-called seniority-zero, or paired-electron, approximation of computational quantum chemistry with techniques for simulating molecular chemistry on gate-based quantum computers.
We show that using the freed-up quantum resources for increasing the basis set can lead to more accurate results and reductions in the necessary number of quantum computing runs.
arXiv Detail & Related papers (2020-01-31T19:44:37Z)
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.