A Domain-agnostic, Noise-resistant, Hardware-efficient Evolutionary Variational Quantum Eigensolver

Abstract

Variational quantum algorithms have shown promise in numerous fields due to their versatility in solving problems of scientific and commercial interest. However, leading algorithms for Hamiltonian simulation, such as the Variational Quantum Eigensolver (VQE), use fixed preconstructed ansatzes, limiting their general applicability and accuracy. Thus, variational forms---the quantum circuits that implement ansatzes ---are either crafted heuristically or by encoding domain-specific knowledge. In this paper, we present an Evolutionary Variational Quantum Eigensolver (EVQE), a novel variational algorithm that uses evolutionary programming techniques to minimize the expectation value of a given Hamiltonian by dynamically generating and optimizing an ansatz. The algorithm is equally applicable to optimization problems in all domains, obtaining accurate energy evaluations with hardware-efficient ansatzes. In molecular simulations, the variational forms generated by EVQE are up to $18.6\times$ shallower and use up to $12\times$ fewer CX gates than those obtained by VQE with a unitary coupled cluster ansatz. EVQE demonstrates significant noise-resistance properties, obtaining results in noisy simulation with at least $3.6\times$ less error than VQE using any tested ansatz configuration. We successfully evaluated EVQE on a real 5-qubit IBMQ quantum computer. The experimental results, which we obtained both via simulation and on real quantum hardware, demonstrate the effectiveness of EVQE for general-purpose optimization on the quantum computers of the present and near future.

14 pages, 10 figures; references added; minor additions and edits made; affiliations corrected;

References in corpus (19)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Elementary gates for quantum computation
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Ising formulations of many NP problems
• Supervised learning with quantum enhanced feature spaces
• Barren plateaus in quantum neural network training landscapes
• A Quantum Approximate Optimization Algorithm
• Quantum Circuit Learning
• Error mitigation for short-depth quantum circuits
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Circuit-centric quantum classifiers
• Extending the computational reach of a noisy superconducting quantum processor
• Validating quantum computers using randomized model circuits
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• Structure optimization for parameterized quantum circuits
• Tapering off qubits to simulate fermionic Hamiltonians
• Reducing qubit requirements for quantum simulation using molecular point group symmetries
• Low cost quantum circuits for classically intractable instances of the Hamiltonian dynamics simulation problem

Cited by in corpus (20)

• The Variational Quantum Eigensolver: a review of methods and best practices
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• Quantum circuit architecture search for variational quantum algorithms
• Differentiable Quantum Architecture Search
• Reinforcement learning for optimization of variational quantum circuit architectures
• Markovian Quantum Neuroevolution for Machine Learning
• Quantum Machine Learning for Finance
• Variational Hamiltonian simulation for translational invariant systems via classical pre-processing
• Quantum Architecture Search with Meta-learning
• Representation of binary classification trees with binary features by quantum circuits
• Evaluation of Parameterized Quantum Circuits with Cross-Resonance Pulse-Driven Entanglers
• GSQAS: Graph Self-supervised Quantum Architecture Search
• Quantum Circuit Evolution on NISQ Devices
• Variational Quantum Cloning: Improving Practicality for Quantum Cryptanalysis
• Expressivity of Variational Quantum Machine Learning on the Boolean Cube
• Quantum Information reveals that orbital-wise correlation is essentially classical in Natural Orbitals
• Near Term Algorithms for Linear Systems of Equations
• A Classically Efficient Quantum Scalable Fermi-Hubbard Benchmark
• Advantage of discrete variable representation in variational quantum eigensolvers for vibrational energy calculations
• Exploiting subspace constraints and ab initio variational methods for quantum chemistry