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.
Volume 453 -
The 40th International Symposium on Lattice Field Theory (LATTICE2023) -
Poster session
Fast Partitioning of Pauli Strings into Commuting Families for Expectation Value Measurements of Dense Operators
Full text:
pdf
Pre-published on:
May 03, 2024
Published on:
November 06, 2024
Abstract
DOI: https://doi.org/10.22323/1.453.0130
How to cite
Metadata are provided both in "article" format (very similar to INSPIRE) as this helps creating very compact bibliographies which can be beneficial to authors and readers, and in "proceeding" format which is more detailed and complete.
Open Access
Copyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Copyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.