Partitioning Pauli Operators: in Theory and in Practice
Andrew Jena
Abstract
Measuring the expectation value of Pauli operators on prepared quantum states is a \nfundamental task in the variational quantum eigensolver. Simultaneously measuring sets \nof operators allows for fewer measurements and an overall speedup of the measurement \nprocess. In this thesis, we look both at the task of partitioning all Pauli operators of a \n xed length and of partitioning a random subset of these Pauli operators. We rst show \nhow Singer cycles can be used to optimally partition the set of all Pauli operators, giving \nsome insight to the structure underlying many constructions of mutually unbiased bases. \nThereafter, we show how graph coloring algorithms promise to provide speedups linear \nwith respect to the lengths of the operators over currently-implemented techniques in the \nmeasurement step of the variational quantum eigensolver.