REVIEW 2 cited by
Variational Quantum Simulations of Finite-Temperature Dynamical Properties via Thermofield Dynamics
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Variational Quantum Simulations of Finite-Temperature Dynamical Properties via Thermofield Dynamics
read the original abstract
The recent advancement of quantum computer hardware offers the potential to simulate quantum many-body systems beyond the capability of its classical counterparts. However, most current works focus on simulating the ground-state properties or pure-state quantum dynamics of quantum systems. Finite-temperature physics are much less explored, and existing literature mainly consider equilibrium properties. Here we present a variational quantum simulation protocol based on the thermofield dynamics formalism to simulate the dynamical and non-equilibrium finite-temperature properties of quantum systems with near-term quantum computers. Compared to previous approaches in computing the equilibrium dynamical properties, our approach does not require the computationally expensive initial state sampling. More importantly, our approach is capable of simulating non-equilibrium phenomena which have not been previously explored with quantum computers. Numerical simulations of molecular absorption spectrum and spin quenched dynamics affirm the capability of our method.
Forward citations
Cited by 2 Pith papers
-
Dynamical structure factor with a pumping approach on a trapped-ion quantum computer
A pumping approach for computing dynamical structure factors on quantum computers directly targets specific frequencies by time-evolving with an oscillating perturbation, demonstrated on 20-qubit trapped-ion hardware.
-
Non-unitary extension of Grover's search algorithm
A non-unitary extension of Grover's algorithm achieves O(sqrt(N)) query complexity matching the optimal bound by using a single large rotation via block encoding and Chebyshev approximation, at the cost of one additio...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.