Learning to Measure: Adaptive Informationally Complete Generalized Measurements for Quantum Algorithms
Guillermo García-Pérez, Matteo A. C. Rossi, Boris Sokolov, Francesco Tacchino, Panagiotis Kl. Barkoutsos, Guglielmo Mazzola, Ivano Tavernelli, Sabrina Maniscalco
Many prominent quantum computing algorithms with applications in fields such as chemistry and materials science require a large number of measurements, which represents an important roadblock for future real-world use cases.We introduce a novel approach to tackle this problem through an adaptive measurement scheme.We present an algorithm that optimizes informationally complete positive operator-valued measurements (POVMs) on the fly in order to minimize the statistical fluctuations in the estimation of relevant cost functions.We show its advantage by improving the efficiency of the variational quantum eigensolver in calculating ground-state energies of molecular Hamiltonians with extensive numerical simulations.Our results indicate that the proposed method is competitive with state-of-the-art measurement-reduction approaches in terms of efficiency.In addition, the informational completeness of the approach offers a crucial advantage, as the measurement data can be reused to infer other quantities of interest.We demonstrate the feasibility of this prospect by reusing ground-state energy-estimation data to perform high-fidelity reduced state tomography.
Many prominent quantum computing algorithms with applications in fields such as chemistry and materials science require a large number of measurements, which represents an important roadblock for future real-world use cases.We introduce a novel approach to tackle this problem through an adaptive measurement scheme.We present an algorithm that optimizes informationally complete positive operator-valued measurements (POVMs) on the fly in order to minimize the statistical fluctuations in the estimation of relevant cost functions.We show its advantage by improving the efficiency of the variational quantum eigensolver in calculating ground-state energies of molecular Hamiltonians with extensive numerical simulations.Our results indicate that the proposed method is competitive with state-of-the-art measurement-reduction approaches in terms of efficiency.In addition, the informational completeness of the approach offers a crucial advantage, as the measurement data can be reused to infer other quantities of interest.We demonstrate the feasibility of this prospect by reusing ground-state energy-estimation data to perform high-fidelity reduced state tomography.
Adaptive derivative-assembled problem-tailored ansatz variational quantum eigensolver (ADAPT-VQE) stands out as a robust algorithm for constructing compact ansätze for molecular simulation. It enables to significantly reduce the circuit depth with respect to other methods, such as unitary coupled cluster singles and doubles, while achieving higher accuracy and not suffering from so-called barren plateaus that hinder the variational optimization of many hardware-efficient ansätze. In its standard implementation, however, it introduces a considerable measurement overhead in the form of gradient evaluations through estimations of many commutator operators. In this work, we mitigate this measurement overhead by exploiting a recently introduced method for energy evaluation relying on adaptive informationally complete generalized measurements (AIMs). Besides offering an efficient way to measure the energy itself, informationally complete (IC) measurement data can be reused to estimate all the commutators of the operators in the operator pool of ADAPT-VQE, using only classically efficient postprocessing. The framework is generic for any IC positive operator-valued measures (POVMs) implementation, and in this work, we demonstrate it’s effectiveness with dilation POVMs. We present the AIM-ADAPT-VQE scheme in detail, and investigate its performance with H 4 , N 2 , and 1,3,5,7-octatetraene Hamiltonians and several operator pools. Our numerical simulations indicate that the measurement data obtained to evaluate the energy can be reused to implement ADAPT-VQE with no additional measurement overhead for the systems considered here. In addition, we show that, if the energy is measured within chemical precision, the count in the resulting circuits is close to the ideal one. With scarce measurement data, AIM-ADAPT-VQE still converges to the ground state with high probability, albeit with an increased circuit depth in some cases.
Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the ground state of a system by solving a generalized eigenvalue problem in a subspace spanned by a collection of parametrized quantum states. This allows for the systematic improvement of a logical wavefunction ansatz without a significant increase in circuit complexity. To minimize the circuit complexity of this approach, we propose a strategy for efficiently measuring the Hamiltonian and overlap matrix elements between states parametrized by circuits that commute with the total particle number operator. This strategy doubles the size of the state preparation circuits but not their depth, while adding a small number of additional two-qubit gates relative to standard variational quantum eigensolver. We also propose a classical Monte Carlo scheme to estimate the uncertainty in the ground state energy caused by a finite number of measurements of the matrix elements. We explain how this Monte Carlo procedure can be extended to adaptively schedule the required measurements, reducing the number of circuit executions necessary for a given accuracy. We apply these ideas to two model strongly correlated systems, a square configuration of H 4 and the π -system of hexatriene (C 6 H 8 ).
The variational quantum eigensolver (VQE) stands as a prominent quantum-classical hybrid algorithm for near-term quantum computers to obtain the ground states of molecular Hamiltonians in quantum chemistry. However, due to the noncommutativity of the Pauli operators in the Hamiltonian, the number of measurements required on quantum computers increases significantly as the system size grows, which may hinder practical applications of VQE. In this work, we present a protocol termed (JBM-VQE) to reduce the number of measurements and speed up the VQE algorithm. Our method employs joint Bell measurements, enabling the simultaneous measurement of the absolute values of all expectation values of Pauli operators present in the Hamiltonian. In the course of the optimization, JBM-VQE estimates the absolute values of the expectation values of the Pauli operators for each iteration by the joint Bell measurement, while the signs of them are measured less frequently by the conventional method to measure the expectation values. Our approach is based on the empirical observation that the signs do not often change during optimization. We illustrate the speed-up of JBM-VQE compared to conventional VQE by numerical simulations for finding the ground states of molecular Hamiltonians of small molecules, and the speed-up of JBM-VQE at the early stage of the optimization becomes increasingly pronounced in larger systems. Our approach based on the joint Bell measurement is not limited to VQE and can be utilized in various quantum algorithms whose cost functions are expectation values of many Pauli operators. Published by the American Physical Society 2024
We present adaptive measurement techniques tailored for variational quantum algorithms on near-term small and noisy devices. In particular, we generalise earlier "learning to measure" strategies in two ways. First, by considering a class of adaptive positive operator valued measures (POVMs) that can be simulated with simple projective measurements without ancillary qubits, we decrease the amount of required qubits and two-qubit gates. Second, by introducing a method based on Quantum Detector Tomography to mitigate the effect of noise, we are able to optimise the POVMs as well as to infer expectation values reliably in the currently available noisy quantum devices. Our numerical simulations clearly indicate that the presented strategies can significantly reduce the number of needed shots to achieve chemical accuracy in variational quantum eigensolvers, thus helping to solve one of the bottlenecks of near-term quantum computing.
Variational Quantum Eigensolver (VQE) has emerged as a prominent hybrid quantum-classical algorithm for near-term quantum computing, particularly in applications like quantum machine learning. However, the performance of VQE is significantly constrained by the limitations of classical optimization methods employed to minimize the expectation value of the Hamiltonian. Traditional VQE approaches often suffer from slow convergence and sensitivity to initial conditions, particularly when dealing with complex, high-dimensional problems encountered in machine learning scenarios. This work introduces a novel adaptive quantum computing framework for VQE optimization, designed to dynamically adjust the quantum circuit parameters during the optimization process. By continuously monitoring the optimization progress and intelligently modifying the parameters, we aim to accelerate convergence and improve the robustness of VQE algorithms for machine learning tasks. The core idea is to shift from a static, fixed-parameter VQE to a dynamic, adaptive one. We explore various adaptive control strategies and demonstrate their potential to significantly reduce the number of iterations required to reach a solution, leading to improved computational efficiency and enabling VQE to tackle more complex machine learning problems within the constraints of current quantum hardware. The research focuses on the theoretical underpinnings and the design principles of this adaptive approach, laying the foundation for future implementations and experimental validation.
Recently, adaptive variational quantum algorithms, e.g., Adaptive Derivative-Assembled Pseudo-Trotter-Variational Quantum Eigensolver (ADAPT-VQE) and Iterative Qubit-Excitation Based-Variational Quantum Eigensolver (IQEB-VQE), have been proposed to optimize the circuit depth, while a huge number of additional measurements make these algorithms highly inefficient. In this work, we reformulate the ADAPT-VQE with reduced density matrices (RDMs) to avoid additional measurement overhead. With Valdemoro's reconstruction of the three-electron RDM, we present a revised ADAPT-VQE algorithm, termed ADAPT-V, without any additional measurements but at the cost of increasing variational parameters compared to the ADAPT-VQE. Furthermore, we present an ADAPT-Vx algorithm by prescreening the anti-Hermitian operator pool with this RDM-based scheme. ADAPT-Vx requires almost the same variational parameters as ADAPT-VQE but a significantly reduced number of gradient evaluations. Numerical benchmark calculations for small molecules demonstrate that ADAPT-V and ADAPT-Vx provide an accurate description of the ground- and excited-state potential energy curves. In addition, to minimize the quantum resource demand, we generalize this RDM-based scheme to circuit-efficient IQEB-VQE algorithm and achieve significant measurement reduction.