Variational Quantum Eigensolver with Reduced Circuit Complexity

Abstract

The variational quantum eigensolver (VQE) is one of the most promising algorithms to find eigenvalues and eigenvectors of a given Hamiltonian on noisy intermediate-scale quantum (NISQ) devices. A particular application is to obtain ground or excited states of molecules. The practical realization is currently limited by the complexity of quantum circuits. Here we present a novel approach to reduce quantum circuit complexity in VQE for electronic structure calculations. Our algorithm, called ClusterVQE, splits the initial qubit space into subspaces (qubit clusters) which are further distributed on individual (shallower) quantum circuits. The clusters are obtained based on quantum mutual information reflecting maximal entanglement between qubits, whereas entanglement between different clusters is taken into account via a new "dressed" Hamiltonian. ClusterVQE therefore allows exact simulation of the problem by using fewer qubits and shallower circuit depth compared to standard VQE at the cost of additional classical resources. In addition, a new gradient measurement method without using an ancillary qubit is also developed in this work. Proof-of-principle demonstrations are presented for several molecular systems based on quantum simulators as well as an IBM quantum device with accompanying error mitigation. The efficiency of the new algorithm is comparable to or even improved over qubit-ADAPT-VQE and iterative Qubit Coupled Cluster (iQCC), state-of-the-art circuit-efficient VQE methods to obtain variational ground state energies of molecules on NISQ hardware. Above all, the new ClusterVQE algorithm simultaneously reduces the number of qubits and circuit depth, making it a potential leader for quantum chemistry simulations on NISQ devices.

References in corpus (49)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• 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
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• Simulated Quantum Computation of Molecular Energies
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Fermionic quantum computation
• The power of quantum neural networks
• Extending the computational reach of a noisy superconducting quantum processor
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• Quantum optimization using variational algorithms on near-term quantum devices
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Hybrid quantum-classical algorithms and quantum error mitigation
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Variational Quantum Computation of Excited States
• Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• Automated Selection of Active Orbital Spaces
• Subspace-search variational quantum eigensolver for excited states
• Quantum Implementation of Unitary Coupled Cluster for Simulating Molecular Electronic Structure
• Measuring orbital interaction using quantum information theory
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• Modern Approaches to Exact Diagonalization and Selected Configuration Interaction with the Adaptive Sampling CI Method
• Doubling the size of quantum simulators by entanglement forging
• Fermionic partial tomography via classical shadows
• Qubit-excitation-based adaptive variational quantum eigensolver
• Reducing qubit requirements for quantum simulation using molecular point group symmetries
• Measurement reduction in variational quantum algorithms
• Entanglement as Measure of Electron-Electron Correlation in Quantum Chemistry Calculations
• Parallel Quantum Simulation of Large Systems on Small Quantum Computers
• Machine learning of noise-resilient quantum circuits
• A Jastrow-type decomposition in quantum chemistry for low-depth quantum circuits
• Detecting Multiple Communities Using Quantum Annealing on the D-Wave System
• Quantum simulation with hybrid tensor networks
• Accuracy and Resource Estimations for Quantum Chemistry on a Near-term Quantum Computer
• Correlation-Informed Permutation of Qubits for Reducing Ansatz Depth in VQE
• Cartan sub-algebra approach to efficient measurements of quantum observables
• Mutual information-assisted Adaptive Variational Quantum Eigensolver
• Exact and approximate symmetry projectors for the electronic structure problem on a quantum computer
• Shallow-circuit variational quantum eigensolver based on symmetry-inspired Hilbert space partitioning for quantum chemical calculations
• Accurate quantum simulation of molecular ground and excited states with a transcorrelated Hamiltonian

Cited by in corpus (20)

• The Variational Quantum Eigensolver: a review of methods and best practices
• Review of Distributed Quantum Computing. From single QPU to High Performance Quantum Computing
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• Quantifying the effect of gate errors on variational quantum eigensolvers for quantum chemistry
• Quantum utility -- definition and assessment of a practical quantum advantage
• Benchmarking variational quantum eigensolvers for the square-octagon-lattice Kitaev model
• Testing platform-independent quantum error mitigation on noisy quantum computers
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive
• A Perspective on Quantum Computing Applications in Quantum Chemistry using 25--100 Logical Qubits
• Exploring Parameter Redundancy in the Unitary Coupled-Cluster Ansatze for Hybrid Variational Quantum Computing
• Molecular Dynamics on Quantum Annealers
• Partitioning Quantum Chemistry Simulations with Clifford Circuits
• Information flow in parameterized quantum circuits
• Cascaded variational quantum eigensolver algorithm
• Advantage of discrete variable representation in variational quantum eigensolvers for vibrational energy calculations
• Improving the efficiency of learning-based error mitigation
• Enhancing Variational Quantum Circuit Training: An Improved Neural Network Approach for Barren Plateau Mitigation
• Quantum Approximation Optimization Algorithm for the Trellis based Viterbi Decoding of Classical Error Correcting Codes
• Orbital Expansion Variational Quantum Eigensolver: Enabling Efficient Simulation of Molecules with Shallow Quantum Circuit