Fetching the paper…

Reading the bibliography…

2019

Pauli Partitioning with Respect to Gate Sets

Jena, Andrew, Genin, Scott, Mosca, Michele

Original
PDF
Post on X

Understand

Measuring the expectation value of Pauli operators on prepared quantum states is a fundamental task in a multitude of quantum algorithms.

Simultaneously measuring sets of operators allows for fewer measurements and an overall speedup of the measurement process.
We investigate the task of partitioning a random subset of Pauli operators into simultaneously-measurable parts.
Using heuristics from coloring random graphs, we give an upper bound for the expected number of parts in our partition.

Pauli Partitioning with Respect to Gate Sets · Around

Built on

Two classical theorems on commuting matrices
Morris Newman · 1967
Earlier work this paper cites.
The chromatic number of random graphs
Béla Bollobás · 1988
Earlier work this paper cites.

Similar

Similarity to symmetric matrices over finite fields
Joel V. Brawley and Timothy C. Teitloff · 1998
Cited alongside, same era.
Fault-tolerant quantum computation with higher-dimensional systems
Daniel Gottesman · 1999
Cited alongside, same era.

Then

A new proof for the existence of mutually unbiased bases
Original
Samshubhro Bandyopadhyay, P. Oscar Boykin, Vwani Roychowdhury, and Farrokh Vatan · 2002
Later among the works it cites.
Variational quantum state diagonalization
Ryan LaRose, Arkin Tikku, Étude O’Neel-Judy, Lukasz Cincio, and Patrick J. Coles · 2019
Closest in time.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…