Resource-Optimized Grouping Shadow for Efficient Energy Estimation

Abstract

The accurate and efficient energy estimation of quantum Hamiltonians consisting of Pauli observables is an essential task in modern quantum computing. We introduce a Resource-Optimized Grouping Shadow (ROGS) algorithm, which optimally allocates measurement resources by minimizing the estimation error bound through a novel overlapped grouping strategy and convex optimization. Our numerical experiments demonstrate that ROGS requires significantly fewer unique quantum circuits for accurate estimation accuracy compared to existing methods given a fixed measurement budget, addressing a major cost factor for compiling and executing circuits on quantum computers.

22 pages, 5 figures

References in corpus (16)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Predicting Many Properties of a Quantum System from Very Few Measurements
• The Variational Quantum Eigensolver: a review of methods and best practices
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
• Efficient estimation of Pauli observables by derandomization
• A comparison of the Bravyi-Kitaev and Jordan-Wigner transformations for the quantum simulation of quantum chemistry
• Overlapped grouping measurement: A unified framework for measuring quantum states
• Combining quantum processors with real-time classical communication
• Adaptive estimation of quantum observables
• Minimum quantum run-time characterization and calibration via restless measurements with dynamic repetition rates
• Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping