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

2023/11/14 by Nouman Butt, Butt, Nouman, Andrew Lytle +5
Computer Science · #FOS: Physical sciences #High Energy Physics - Lattice (hep-lat) #Matrix Theory and Algorithms #Parallel Computing and Optimization Techniques #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph)

paper · pdf · doi:10.48550/arxiv.2311.08551

openalex publication_date 2023/11/14 · openalex created_date 2023/11/17 · openalex updated_date 2026/08/01

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.

Related

• Pauli String Partitioning Algorithm with the Ising Model for Simultaneous Measurement
• Pauli Partitioning with Respect to Gate Sets
• Non-Clifford diagonalization for measurement shot reduction in quantum expectation value estimation
• Measurement reduction for expectation values via fine-grained commutativity
• Optimised Baranyai partitioning of the second quantised Hamiltonian