Accelerated variational quantum eigensolver with joint Bell measurement
arXiv:2307.00766 · doi:10.1103/PhysRevResearch.6.013205
Abstract
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 non-commutativity 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 joint Bell measurement VQE (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.
arXiv comment14 pages, 8 figures
References in corpus (45)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A variational eigenvalue solver on a quantum processor
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Quantum computational advantage using photons
- The theory of variational hybrid quantum-classical algorithms
- Quantum Circuit Learning
- Error mitigation for short-depth quantum circuits
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Evaluating analytic gradients on quantum hardware
- The Variational Quantum Eigensolver: a review of methods and best practices
- Fermionic quantum computation
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- Quantum Error Mitigation
- Variational ansatz-based quantum simulation of imaginary time evolution
- The Bravyi-Kitaev transformation for quantum computation of electronic structure
- Quantum advantage in learning from experiments
- Qulacs: a fast and versatile quantum circuit simulator for research purpose
- Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
- Subspace-search variational quantum eigensolver for excited states
- Information-theoretic bounds on quantum advantage in machine learning
- Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
- Accelerated Variational Quantum Eigensolver
- Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
- Sequential minimal optimization for quantum-classical hybrid algorithms
- Efficient quantum measurement of Pauli operators in the presence of finite sampling error
- Fermionic partial tomography via classical shadows
- An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
- Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
- Measurement reduction in variational quantum algorithms
- Quantum Computation of Finite-Temperature Static and Dynamical Properties of Spin Systems Using Quantum Imaginary Time Evolution
- Variational Quantum Fidelity Estimation
- Scalable measures of magic resource for quantum computers
- Nearly Optimal Measurement Scheduling for Partial Tomography of Quantum States
- Efficient evaluation of quantum observables using entangled measurements
- Optimal fermion-to-qubit mapping via ternary trees with applications to reduced quantum states learning
- Calculating transition amplitudes by variational quantum deflation
- Algorithmic Error Mitigation Scheme for Current Quantum Processors
- Experimental optimal orienteering via parallel and antiparallel spins
- Quantum imaginary time evolution steered by reinforcement learning
- Experimental Quantum Target Detection Approaching the Fundamental Helstrom Limit
- Quantum variational learning for quantum error-correcting codes
- Accelerating the variational quantum eigensolver using parallelism
- Mitigating algorithmic errors in quantum optimization through energy extrapolation
- Almost optimal measurement scheduling of molecular Hamiltonian via finite projective plane
Cited by in corpus (10)
- Unveiling quantum phase transitions from traps in variational quantum algorithms
- Size-consistency and orbital-invariance issues revealed by VQE-UCCSD calculations with the FMO scheme
- Simulating thermodynamic properties of dinuclear metal complexes using Variational Quantum Algorithms
- Learning quantum phases via single-qubit disentanglement
- Photonic variational quantum eigensolver using entanglement measurements
- Quantum annealer accelerates the variational quantum eigensolver in a triple-hybrid algorithm
- Tangent Space Excitation Ansatz for Quantum Circuits
- Exploiting many-body localization for scalable variational quantum simulation
- Optical Quantum Computing
- Imaginary Time Spectral Transforms for Excited State Preparation