Fast Partitioning of Pauli Strings into Commuting Families for Expectation Value Measurements of Dense Operators

Nouman Butt, Andrew Lytle, Ben Reggio, Patrick Draper

Research output: Contribution to journalConference articlepeer-review

Abstract

The cost of measuring quantum expectation values of an operator can be reduced by grouping the Pauli string (SU(2) tensor product) decomposition of the operator into maximally commuting sets. We detail an algorithm, presented in [1], to partition the full set of m-qubit Pauli strings into the minimal number of commuting families, and benchmark the performance with dense Hamiltonians on IBM hardware. Here we also compare how our method scales compared to graph-theoretic techniques for the generally commuting case.

Original languageEnglish (US)
Article number130
JournalProceedings of Science
Volume453
StatePublished - Nov 6 2024
Externally publishedYes
Event40th International Symposium on Lattice Field Theory, LATTICE 2023 - Batavia, United States
Duration: Jul 31 2023Aug 4 2023

ASJC Scopus subject areas

  • General

Fingerprint

Dive into the research topics of 'Fast Partitioning of Pauli Strings into Commuting Families for Expectation Value Measurements of Dense Operators'. Together they form a unique fingerprint.

Cite this