Pauli Partitioning with Respect to Gate Sets

Abstract

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. We go on to conjecture that allowing arbitrary Clifford operators before measurement, rather than single-qubit operations, leads to a decrease in the number of parts which is linear with respect to the lengths of the operators. We give evidence to confirm this conjecture and comment on the importance of this result for a specific near-term application: speeding up the measurement process of the variational quantum eigensolver.

arXiv comment7 pages, 2 figures

References in corpus (2)

• A new proof for the existence of mutually unbiased bases
• Variational Quantum State Diagonalization

Cited by in corpus (19)

• Quantum computational chemistry
• The Variational Quantum Eigensolver: a review of methods and best practices
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• Emerging quantum computing algorithms for quantum chemistry
• Efficient quantum measurement of Pauli operators in the presence of finite sampling error
• Fermionic partial tomography via classical shadows
• Minimizing State Preparations in Variational Quantum Eigensolver by Partitioning into Commuting Families
• Measurement cost of metric-aware variational quantum algorithms
• Orbital transformations to reduce the 1-norm of the electronic structure Hamiltonian for quantum computing applications
• Adaptive estimation of quantum observables
• Operator Sampling for Shot-frugal Optimization in Variational Algorithms
• Implementation of Measurement Reduction for the Variational Quantum Eigensolver
• Variational Quantum Eigensolver for SU($N$) Fermions
• Computationally Efficient Quantum Expectation with Extended Bell Measurements
• Coarse grained intermolecular interactions on quantum processors
• A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz
• Predicting Features of Quantum Systems from Very Few Measurements
• Quantum Zeno approach for molecular energies with maximum commuting initialHamiltonians
• Software-Hardware Co-Optimization for Computational Chemistry on Superconducting Quantum Processors