Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover

Abstract

Solving the electronic structure problem using the Variational Quantum Eigensolver (VQE) technique involves measurement of the Hamiltonian expectation value. Current hardware can perform only projective single-qubit measurements, and thus, the Hamiltonian expectation value is obtained by measuring parts of the Hamiltonian rather than the full Hamiltonian. This restriction makes the measurement process inefficient because the number of terms in the Hamiltonian grows as $O(N^4)$ with the size of the system, $N$. To optimize VQE measurement one can try to group as many Hamiltonian terms as possible for their simultaneous measurement. Single-qubit measurements allow one to group only the terms that commute within corresponding single-qubit subspaces or qubit-wise commuting. We found that qubit-wise commutativity between the Hamiltonian terms can be expressed as a graph and the problem of the optimal grouping is equivalent of finding a minimum clique cover (MCC) for the Hamiltonian graph. The MCC problem is NP-hard but there exist several polynomial heuristic algorithms to solve it approximately. Several of these heuristics were tested in this work for a set of molecular electronic Hamiltonians. On average, grouping qubit-wise commuting terms reduced the number of operators to measure three times compared to the total number of terms in the considered Hamiltonians.

References in corpus (13)

• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• The theory of variational hybrid quantum-classical algorithms
• Fermionic quantum computation
• Towards Practical Quantum Variational Algorithms
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Quantum chemistry calculations on a trapped-ion quantum simulator
• From transistor to trapped-ion computers for quantum chemistry
• Analog quantum chemistry simulation
• Operator Locality in Quantum Simulation of Fermionic Models
• Bravyi-Kitaev Superfast simulation of fermions on a quantum computer
• Minimizing State Preparations in Variational Quantum Eigensolver by Partitioning into Commuting Families
• Quantum Information and Computation for Chemistry

Cited by in corpus (158)

• Variational Quantum Algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computational chemistry
• The Variational Quantum Eigensolver: a review of methods and best practices
• Quantum algorithms for quantum chemistry and quantum materials science
• Information-theoretic bounds on quantum advantage in machine learning
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
• Efficient estimation of Pauli observables by derandomization
• Efficient quantum measurement of Pauli operators in the presence of finite sampling error
• Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
• Fermionic partial tomography via classical shadows
• Entanglement Devised Barren Plateau Mitigation
• Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
• Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
• Measurement reduction in variational quantum algorithms
• Orbital optimized unitary coupled cluster theory for quantum computer
• On barren plateaus and cost function locality in variational quantum algorithms
• Performance comparison of optimization methods on variational quantum algorithms
• Classical Shadows With Noise
• Nearly Optimal Measurement Scheduling for Partial Tomography of Quantum States
• Chemistry Beyond the Scale of Exact Diagonalization on a Quantum-Centric Supercomputer
• Biology and medicine in the landscape of quantum advantages
• Minimizing State Preparations in Variational Quantum Eigensolver by Partitioning into Commuting Families
• Improving Hamiltonian encodings with the Gray code
• Minimizing estimation runtime on noisy quantum computers
• Quantum Filter Diagonalization with Double-Factorized Hamiltonians
• Experimental quantum state measurement with classical shadows
• Purification-based quantum error mitigation of pair-correlated electron simulations
• Tequila: A platform for rapid development of quantum algorithms
• Efficient evaluation of quantum observables using entangled measurements
• Cartan sub-algebra approach to efficient measurements of quantum observables
• Using models to improve optimizers for variational quantum algorithms
• Towards near-term quantum simulation of materials
• Simulating Many-Body Systems with a Projective Quantum Eigensolver
• Subspace Variational Quantum Simulator
• Iterative Quantum Assisted Eigensolver
• Overlapped grouping measurement: A unified framework for measuring quantum states
• Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters
• Efficient quantum computation of molecular forces and other energy gradients
• Ordering of Trotterization: Impact on Errors in Quantum Simulation of Electronic Structure
• Nearly Optimal Quantum Algorithm for Estimating Multiple Expectation Values
• Variational Quantum Algorithm for Non-equilibrium Steady States
• Measurement Error Mitigation for Variational Quantum Algorithms
• Free fermions behind the disguise
• Solving hadron structures using the basis light-front quantization approach on quantum computers
• An efficient adaptive variational quantum solver of the Schrodinger equation based on reduced density matrices
• Characterization of solvable spin models via graph invariants
• Ancilla-free implementation of generalized measurements for qubits embedded in a qudit space
• Symmetry enhanced variational quantum spin eigensolver
• Orbital transformations to reduce the 1-norm of the electronic structure Hamiltonian for quantum computing applications
• Quantifying the effect of gate errors on variational quantum eigensolvers for quantum chemistry
• Lyapunov control-inspired strategies for quantum combinatorial optimization
• How many quantum gates do gauge theories require?
• Quantum computed moments correction to variational estimates
• Adaptive estimation of quantum observables
• Preserving Symmetries for Variational Quantum Eigensolvers in the Presence of Noise
• Improving quantum measurements by introducing "ghost" Pauli products
• Decision Diagrams for Quantum Measurements with Shallow Circuits
• Quantum expectation-value estimation by computational basis sampling
• Folded Spectrum VQE : A quantum computing method for the calculation of molecular excited states
• Improving the Accuracy of the Variational Quantum Eigensolver for Molecular Systems by the Explicitly-Correlated Perturbative [2]-R12-Correction
• Hamiltonian operator approximation for energy measurement and ground state preparation
• Improving the accuracy and efficiency of quantum connected moments expansions
• Quantum Computer-Aided design of Quantum Optics Hardware
• Contextual Subspace Variational Quantum Eigensolver
• Topology-Driven Quantum Architecture Search Framework
• The Basics of Quantum Computing for Chemists
• Towards a variational Jordan-Lee-Preskill quantum algorithm
• Low-depth Hamiltonian Simulation by Adaptive Product Formula
• Accelerating Quantum Computations of Chemistry Through Regularized Compressed Double Factorization
• Implementation of Measurement Reduction for the Variational Quantum Eigensolver
• HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware
• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Dual frame optimization for informationally complete quantum measurements
• Accelerated variational quantum eigensolver with joint Bell measurement
• Optimizing the information extracted by a single qubit measurement
• Triply efficient shadow tomography
• Certified variational quantum algorithms for eigenstate preparation
• Estimating Quantum Hamiltonians via Joint Measurements of Noisy Non-Commuting Observables
• Assessment of various Hamiltonian partitionings for the electronic structure problem on a quantum computer using the Trotter approximation
• Testing Scalable Bell Inequalities for Quantum Graph States on IBM Quantum Devices
• A stabilizer framework for Contextual Subspace VQE and the noncontextual projection ansatz
• Measurement optimization of variational quantum simulation by classical shadow and derandomization
• Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems
• Lowering Tomography Costs in Quantum Simulation with a Symmetry Projected Operator Basis
• Assessment of the variational quantum eigensolver: application to the Heisenberg model
• Fast Partitioning of Pauli Strings into Commuting Families for Optimal Expectation Value Measurements of Dense Operators
• Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping
• Fermionic approach to variational quantum simulation of Kitaev spin models
• Computationally Efficient Quantum Expectation with Extended Bell Measurements
• 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
• Algorithmic Shadow Spectroscopy
• Quantum computational advantage attested by nonlocal games with the cyclic cluster state
• Partitioning Quantum Chemistry Simulations with Clifford Circuits
• Hardware-Tailored Diagonalization Circuits
• Coarse grained intermolecular interactions on quantum processors
• Unitary Partitioning and the Contextual Subspace Variational Quantum Eigensolver
• A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz
• Fast Classical Simulation of Hamiltonian Dynamics by Simultaneous Diagonalization Using Clifford Transformation with Parallel Computation
• Zero and Finite Temperature Quantum Simulations Powered by Quantum Magic
• Quantum algorithms for generator coordinate methods
• Efficient and Robust Parameter Optimization of the Unitary Coupled-Cluster Ansatz
• Quantum Computed Green's Functions using a Cumulant Expansion of the Lanczos Method
• Quantum computing for classical problems: Variational Quantum Eigensolver for activated processes
• Mapping renormalized coupled cluster methods to quantum computers through a compact unitary representation of non-unitary operators
• 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
• Hardware-efficient entangled measurements for variational quantum algorithms
• Unleashed from Constrained Optimization: Quantum Computing for Quantum Chemistry Employing Generator Coordinate Inspired Method
• A Hybrid Qubit Encoding: Splitting Fock Space into Fermionic and Bosonic Subspaces
• Noise-robust exploration of many-body quantum states on near-term quantum devices
• Demonstrating Quantum Computation for Quasiparticle Band Structures
• Quantum gradient evaluation through quantum non-demolition measurements
• SHARC-VQE: Simplified Hamiltonian Approach with Refinement and Correction enabled Variational Quantum Eigensolver for Molecular Simulation
• Scalable circuit depth reduction in feedback-based quantum optimization with a quadratic approximation
• Efficient measurement schemes for bosonic systems
• Toward Reliability in the NISQ Era: Robust Interval Guarantee for Quantum Measurements on Approximate States
• Mitigating Quantum Gate Errors for Variational Eigensolvers Using Hardware-Inspired Zero-Noise Extrapolation
• Improved resource-tunable near-term quantum algorithms for transition probabilities, with applications in physics and variational quantum linear algebra
• Practical techniques for high-precision measurements on near-term quantum hardware and applications in molecular energy estimation
• Hamiltonian-based graph-state ansatz for variational quantum algorithms
• C3-VQA: Cryogenic Counter-based Co-processor for Variational Quantum Algorithms
• Quantum Zeno approach for molecular energies with maximum commuting initialHamiltonians
• Computing Electronic Correlation Energies using Linear Depth Quantum Circuits
• Backpropagation scaling in parameterised quantum circuits
• A Simple and Efficient Joint Measurement Strategy for Estimating Fermionic Observables and Hamiltonians
• Neutron-nucleus dynamics simulations for quantum computers
• Optimizing quantum measurements by partitioning multisets of observables
• Quantum annealer accelerates the variational quantum eigensolver in a triple-hybrid algorithm
• Transforming Collections of Pauli Operators into Equivalent Collections of Pauli Operators over Minimal Registers
• Software-Hardware Co-Optimization for Computational Chemistry on Superconducting Quantum Processors
• Leveraging commuting groups for an efficient variational Hamiltonian ansatz
• Sampling Groups of Pauli Operators to Enhance Direct Fidelity Estimation
• State Specific Measurement Protocols for the Variational Quantum Eigensolver
• Quantum Simulation of Molecular Dynamics Processes -- A Benchmark Study Using Classical Simulator and Present-Day Quantum Hardware
• Adaptive measurement strategy for quantum subspace methods
• Almost optimal measurement scheduling of molecular Hamiltonian via finite projective plane
• Revisiting semiconductor bulk hamiltonians using quantum computers
• Reducing the sampling complexity of energy estimation in quantum many-body systems using empirical variance information
• Optimizing Quantum Chemistry Simulations with a Hybrid Quantization Scheme
• Shot-noise reduction for lattice Hamiltonians
• Optimal Fermionic Joint Measurements for Estimating Non-Commuting Majorana Observables
• Adiabatic state preparation from general initial states
• An Error Mitigated Non-Orthogonal Quantum Eigensolver via Shadow Tomography
• Rovibrational energy levels of H${}_2$O by quantum computing
• Short-time simulation of quantum dynamics by Pauli measurements
• Shot-Efficient ADAPT-VQE via Reused Pauli Measurements and Variance-Based Shot Allocation
• Quantum Circuit Optimization by Graph Coloring
• EVA: a quantum Exponential Value Approximation algorithm
• A variational quantum eigensolver tailored to multi-band tight-binding simulations of electronic structures
• On the Fundamental Resource for Exponential Advantage in Quantum Channel Learning
• Variational Quantum Generative Modeling by Sampling Expectation Values of Tunable Observables
• One, Two, Three: One empirical evaluation of a two-copy shadow tomography scheme with triple efficiency
• Size-Consistent Quantum Chemistry on Quantum Computers
• Accelerating Fermionic System Simulation on Quantum Computers
• Resource-Optimized Grouping Shadow for Efficient Energy Estimation