Quick Navigation

Topics

Quantum Simulation

Fast quantum imaginary time evolution

arXiv
Authors: Kok Chuan Tan

Year

2020

Paper ID

20424

Status

Preprint

Abstract Read

~2 min

Abstract Words

96

Citations

N/A

Abstract

A fast implementation of the quantum imaginary time evolution (QITE) algorithm called Fast QITE is proposed. The algorithmic cost of QITE typically scales exponentially with the number of particles it nontrivially acts on in each Trotter step. In contrast, a Fast QITE implementation reduces this to only a linear scaling. It is shown that this speed up leads to a quantum advantage when sampling diagonal elements of a matrix exponential, which cannot be achieved using the standard implementation of the QITE algorithm. Finally the cost of implementing Fast QITE for finite temperature simulations is also discussed.

Why This Paper Matters

  • This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
  • It adds a 2020 reference point for readers tracking recent quantum research.
  • A fast implementation of the quantum imaginary time evolution (QITE) algorithm called Fast QITE is proposed.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #20424 #69041 Multi-modes Bessel-Gaussian-Orb... #69040 Collective Emission in LH2 Asse... #69038 Physically Constrained Ensemble... #69034 Hardware-aware Low-latency Quan...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.