Minimizing State Preparations in Variational Quantum Eigensolver by Partitioning into Commuting Families

Abstract

Variational quantum eigensolver (VQE) is a promising algorithm suitable for near-term quantum machines. VQE aims to approximate the lowest eigenvalue of an exponentially sized matrix in polynomial time. It minimizes quantum resource requirements both by co-processing with a classical processor and by structuring computation into many subproblems. Each quantum subproblem involves a separate state preparation terminated by the measurement of one Pauli string. However, the number of such Pauli strings scales as $N^4$ for typical problems of interest--a daunting growth rate that poses a serious limitation for emerging applications such as quantum computational chemistry. We introduce a systematic technique for minimizing requisite state preparations by exploiting the simultaneous measurability of partitions of commuting Pauli strings. Our work encompasses algorithms for efficiently approximating a MIN-COMMUTING-PARTITION, as well as a synthesis tool for compiling simultaneous measurement circuits. For representative problems, we achieve 8-30x reductions in state preparations, with minimal overhead in measurement circuit cost. We demonstrate experimental validation of our techniques by estimating the ground state energy of deuteron on an IBM Q 20-qubit machine. We also investigate the underlying statistics of simultaneous measurement and devise an adaptive strategy for mitigating harmful covariance terms.

References in corpus (26)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• Quantum computational chemistry
• Improved Simulation of Stabilizer Circuits
• On the volume of the set of mixed entangled states
• Quantum Algorithms Revisited
• Fermionic quantum computation
• Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
• Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
• Cloud Quantum Computing of an Atomic Nucleus
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• Gate count estimates for performing quantum chemistry on small quantum computers
• Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
• Concrete Categorical Model of a Quantum Circuit Description Language with Measurement
• Tapering off qubits to simulate fermionic Hamiltonians
• Performance of hybrid quantum/classical variational heuristics for combinatorial optimization
• Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers
• Contextuality Test of the Nonclassicality of Variational Quantum Eigensolvers
• Cartan Decomposition of SU(2^n), Constructive Controllability of Spin systems and Universal Quantum Computing
• Pauli Partitioning with Respect to Gate Sets
• Construction of mutually unbiased bases with cyclic symmetry for qubit systems
• Cyclic Mutually Unbiased Bases and Quantum Public-Key Encryption
• Depth reduction for quantum Clifford circuits through Pauli measurements

Cited by in corpus (53)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computational chemistry
• The Variational Quantum Eigensolver: a review of methods and best practices
• Quantum Natural Gradient
• Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
• Stochastic gradient descent for hybrid quantum-classical optimization
• A perspective on the current state-of-the-art of quantum computing for drug discovery applications
• Strategies for solving the Fermi-Hubbard model on near-term quantum computers
• Experimental Realization of a Measurement-Induced Entanglement Phase Transition on a Superconducting Quantum Processor
• Efficient quantum measurement of Pauli operators in the presence of finite sampling error
• Fermionic partial tomography via classical shadows
• Measurement reduction in variational quantum algorithms
• Review of Distributed Quantum Computing. From single QPU to High Performance Quantum Computing
• Improving Hamiltonian encodings with the Gray code
• Quantum Filter Diagonalization with Double-Factorized Hamiltonians
• Efficient evaluation of quantum observables using entangled measurements
• Quantum Computational Quantification of Protein-Ligand Interactions
• Qudits for Witnessing Quantum Gravity Induced Entanglement of Masses Under Decoherence
• Simulating Many-Body Systems with a Projective Quantum Eigensolver
• Measurement cost of metric-aware variational quantum algorithms
• Improving resilience of the Quantum Gravity Induced Entanglement of Masses (QGEM) to decoherence using 3 superpositions
• Overlapped grouping measurement: A unified framework for measuring quantum states
• Constrained mixers for the quantum approximate optimization algorithm
• Orbital transformations to reduce the 1-norm of the electronic structure Hamiltonian for quantum computing applications
• Quantum computing for chemistry and physics applications from a Monte Carlo perspective
• Adaptive estimation of quantum observables
• Quantum utility -- definition and assessment of a practical quantum advantage
• Preserving Symmetries for Variational Quantum Eigensolvers in the Presence of Noise
• Operator Sampling for Shot-frugal Optimization in Variational Algorithms
• Resource-Optimized Fermionic Local-Hamiltonian Simulation on Quantum Computer for Quantum Chemistry
• Ab Initio Molecular Dynamics on Quantum Computers
• Quantum hardware calculations of periodic systems with partition-measurement symmetry verification: simplified models of hydrogen chain and iron crystals
• Systems Architecture for Quantum Random Access Memory
• Provable bounds for noise-free expectation values computed from noisy samples
• Implementation of Measurement Reduction for the Variational Quantum Eigensolver
• Networked Quantum Services
• Lowering Tomography Costs in Quantum Simulation with a Symmetry Projected Operator Basis
• Complexity of Supersymmetric Systems and the Cohomology Problem
• The phase diagram of quantum chromodynamics in one dimension on a quantum computer
• Extending the reach of quantum computing for materials science with machine learning potentials
• Efficient Strategies for Reducing Sampling Error in Quantum Krylov Subspace Diagonalization
• GraphStateVis: Interactive Visual Analysis of Qubit Graph States and their Stabilizer Groups
• Noise-robust exploration of many-body quantum states on near-term quantum devices
• Quantum Zeno approach for molecular energies with maximum commuting initialHamiltonians
• Quantum annealer accelerates the variational quantum eigensolver in a triple-hybrid algorithm
• Software-Hardware Co-Optimization for Computational Chemistry on Superconducting Quantum Processors
• Revisiting semiconductor bulk hamiltonians using quantum computers
• Error Analysis of the Variational Quantum Eigensolver Algorithm
• EVA: a quantum Exponential Value Approximation algorithm
• Reduced Sampling Overhead for Probabilistic Error Cancellation by Pauli Error Propagation
• Quantum computation of lowest-energy Kramers states and magnetic g-factors of rare earth ions in crystals