Improving quantum measurements by introducing "ghost" Pauli products
arXiv:2208.06563 · doi:10.1021/acs.jctc.2c00837
Abstract
Reducing the number of measurements required to estimate the expectation value of an observable is crucial for the variational quantum eigensolver to become competitive with state-of-the-art classical algorithms. To measure complicated observables such as a molecular electronic Hamiltonian, one of the common strategies is to partition the observable into linear combinations (fragments) of mutually commutative Pauli products. The total number of measurements for obtaining the expectation value is then proportional to the sum of variances of individual fragments. We propose a method that lowers individual fragment variances by modifying the fragments without changing the total observable expectation value. Our approach is based on adding Pauli products ("ghosts") that are compatible with members of multiple fragments. The total expectation value does not change because a sum of coefficients for each "ghost" Pauli product introduced to several fragments is zero. Yet, these additions change individual fragment variances because of the non-vanishing contributions of "ghost" Pauli products within each fragment. The proposed algorithm minimizes individual fragment variances using a classically efficient approximation of the quantum wavefunction for variance estimations. Numerical tests on a few molecular electronic Hamiltonian expectation values show several-fold reductions in the number of measurements in the "ghost" Pauli algorithm compared to those in the other recently developed techniques.
Cited by in corpus (15)
- Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
- Fluid fermionic fragments for optimizing quantum measurements of electronic Hamiltonians in the variational quantum eigensolver
- Sparse Quantum State Preparation for Strongly Correlated Systems
- Quantum Equation of Motion with Orbital Optimization for Computing Molecular Properties in Near-Term Quantum Computing
- Measurement optimization of variational quantum simulation by classical shadow and derandomization
- Reducing the Resources Required by ADAPT-VQE Using Coupled Exchange Operators and Improved Subroutines
- Optimizing the number of measurements for vibrational structure on quantum computers: coordinates and measurement schemes
- A hybrid quantum algorithm to detect conical intersections
- Efficient Strategies for Reducing Sampling Error in Quantum Krylov Subspace Diagonalization
- Understanding and mitigating noise in molecular quantum linear response for spectroscopic properties on quantum computers
- Greedy Gradient-free Adaptive Variational Quantum Algorithms on a Noisy Intermediate Scale Quantum Computer
- Almost optimal measurement scheduling of molecular Hamiltonian via finite projective plane
- Accelerating Fermionic System Simulation on Quantum Computers
- An occupation number quantum subspace expansion approach to compute the single-particle Green function: an opportunity for noise filtering
- Shot-Efficient ADAPT-VQE via Reused Pauli Measurements and Variance-Based Shot Allocation