arXiv · 2311.08551
Fast Partitioning of Pauli Strings into Commuting Families for Expectation Value Measurements of Dense Operators
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.
Explore related subjects
Keep this discovery
Nouman Butt, Andrew Lytle, Ben Reggio, Patrick Draper. 2023-11-14. Fast Partitioning of Pauli Strings into Commuting Families for Expectation Value Measurements of Dense Operators. https://arxiv.org/abs/2311.08551
Cite the original work for its findings. Save a collection to share your selection of sources.