Measurement reduction for expectation values via fine-grained commutativity
Ben DalFavero, Rahul Sarkar, Jeremiah Rowland, Daan Camps, Nicolas Sawaya, Ryan LaRose

TL;DR
The paper introduces a new concept called $k$-commutativity for operators on tensor product spaces, enabling more efficient measurement of expectation values in quantum circuits by reducing the number of measurements needed.
Contribution
It proposes $k$-commutativity, a novel operator commutativity notion, and demonstrates its application in reducing measurement complexity in quantum expectation value estimation.
Findings
Reduction in measurement count at increased circuit depth
Examples of $k$-commutativity scaling as O(1), O(√n), and O(n)
Discussion of asymptotic measurement complexity for various Hamiltonians
Abstract
We introduce a notion of commutativity between operators on a tensor product space, nominally Pauli strings on qubits, that interpolates between qubit-wise commutativity and (full) commutativity. We apply this notion, which we call -commutativity, to measuring expectation values of observables in quantum circuits and show a reduction in the number measurements at the cost of increased circuit depth. Last, we discuss the asymptotic measurement complexity of -commutativity for several families of -qubit Hamiltonians, showing examples with , , and scaling.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Complexity and Algorithms in Graphs · Computability, Logic, AI Algorithms
