TY - JOUR
T1 - Adaptive estimation of quantum observables
AU - Shlosberg, Ariel
AU - Jena, Andrew J.
AU - Mukhopadhyay, Priyanka
AU - Haase, Jan F.
AU - Leditzky, Felix
AU - Dellantonio, Luca
N1 - Publisher Copyright:
© 2023 Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften. All Rights Reserved.
PY - 2023
Y1 - 2023
N2 - The accurate estimation of quantum observables is a critical task in science. With progress on the hardware, measuring a quantum system will become increasingly demanding, particularly for variational protocols that require extensive sampling. Here, we introduce a measurement scheme that adaptively modifies the estimator based on previously obtained data. Our algorithm, which we call AEQuO, continuously monitors both the estimated average and the associated error of the considered observable, and determines the next measurement step based on this information. We allow both for overlap and non-bitwise commutation relations in the subsets of Pauli operators that are simultaneously probed, thereby maximizing the amount of gathered information. AEQuO comes in two variants: a greedy bucket-filling algorithm with good performance for small problem instances, and a machine learning-based algorithm with more favorable scaling for larger instances. The measurement configuration determined by these subroutines is further post-processed in order to lower the error on the estimator. We test our protocol on chemistry Hamiltonians, for which AEQuO provides error estimates that improve on all state-of-the-art methods based on various grouping techniques or randomized measurements, thus greatly lowering the toll of measurements in current and future quantum applications.
AB - The accurate estimation of quantum observables is a critical task in science. With progress on the hardware, measuring a quantum system will become increasingly demanding, particularly for variational protocols that require extensive sampling. Here, we introduce a measurement scheme that adaptively modifies the estimator based on previously obtained data. Our algorithm, which we call AEQuO, continuously monitors both the estimated average and the associated error of the considered observable, and determines the next measurement step based on this information. We allow both for overlap and non-bitwise commutation relations in the subsets of Pauli operators that are simultaneously probed, thereby maximizing the amount of gathered information. AEQuO comes in two variants: a greedy bucket-filling algorithm with good performance for small problem instances, and a machine learning-based algorithm with more favorable scaling for larger instances. The measurement configuration determined by these subroutines is further post-processed in order to lower the error on the estimator. We test our protocol on chemistry Hamiltonians, for which AEQuO provides error estimates that improve on all state-of-the-art methods based on various grouping techniques or randomized measurements, thus greatly lowering the toll of measurements in current and future quantum applications.
UR - http://www.scopus.com/inward/record.url?scp=85148897211&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85148897211&partnerID=8YFLogxK
U2 - 10.22331/q-2023-01-26-906
DO - 10.22331/q-2023-01-26-906
M3 - Article
AN - SCOPUS:85148897211
SN - 2521-327X
VL - 7
JO - Quantum
JF - Quantum
M1 - 906
ER -