Partition-function estimation: Quantum and quantum-inspired algorithms

Andrew Jackson, Theodoros Kapourniotis, and Animesh Datta
Phys. Rev. A 107, 012421 – Published 20 January 2023

Abstract

We present two algorithms, one quantum and one classical, for estimating partition functions of quantum spin Hamiltonians. The first is a DQC1 (deterministic quantum computation with one clean qubit) algorithm. The second, for real temperatures, achieves performance comparable to a state-of-the-art DQC1 algorithm [A. N. Chowdhury, R. D. Somma, and Y. Subaşi, Phys. Rev. A 103, 032422 (2021)]. Both our algorithms take as input the Hamiltonian decomposed as a linear combination Pauli operators. We show this decomposition to be DQC1-hard for a given Hamiltonian, providing insight into the hardness of estimating partition functions.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
1 More
  • Received 13 August 2022
  • Accepted 2 December 2022

DOI:https://doi.org/10.1103/PhysRevA.107.012421

©2023 American Physical Society

Physics Subject Headings (PhySH)

Quantum Information, Science & TechnologyCondensed Matter, Materials & Applied Physics

Authors & Affiliations

Andrew Jackson, Theodoros Kapourniotis, and Animesh Datta

  • Department of Physics, University of Warwick, Coventry CV4 7AL, United Kingdom

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 107, Iss. 1 — January 2023

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×