Correlation-Informed Permutation of Qubits for Reducing Ansatz Depth in VQE

Abstract

The Variational Quantum Eigensolver (VQE) is a method of choice to solve the electronic structure problem for molecules on near-term gate-based quantum computers. However, the circuit depth is expected to grow significantly with problem size. Increased depth can both degrade the accuracy of the results and reduce trainability. In this work, we propose a novel approach to reduce ansatz circuit depth. Our approach, called PermVQE, adds an additional optimization loop to VQE that permutes qubits in order to solve for the qubit Hamiltonian that minimizes long-range correlations in the ground state. The choice of permutations is based on mutual information, which is a measure of interaction between electrons in spin-orbitals. Encoding strongly interacting spin-orbitals into proximal qubits on a quantum chip naturally reduces the circuit depth needed to prepare the ground state. For representative molecular systems, LiH, H${}_2$, (H${}_2$)${}_2$, H${}_4$, and H${}_3^{+}$, we demonstrate for linear qubit connectivity that placing entangled qubits in close proximity leads to shallower depth circuits required to reach a given eigenvalue-eigenvector accuracy. This approach can be extended to any qubit connectivity and can significantly reduce the depth required to reach a desired accuracy in VQE. Moreover, our approach can be applied to other variational quantum algorithms beyond VQE.

11 pages, 8 figures, 10 pages of Supplemental Material

References in corpus (3)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Variational Quantum Eigensolver for Frustrated Quantum Systems
• Benchmarking adaptive variational quantum eigensolvers

Cited by in corpus (33)

• Variational Quantum Algorithms
• The Variational Quantum Eigensolver: a review of methods and best practices
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Barren Plateaus in Variational Quantum Computing
• Approximate amplitude encoding in shallow parameterized quantum circuits and its application to financial market indicator
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Variational Quantum Eigensolver with Reduced Circuit Complexity
• Toward Practical Quantum Embedding Simulation of Realistic Chemical Systems on Near-term Quantum Computers
• Mutual information-assisted Adaptive Variational Quantum Eigensolver
• Analytic gradients in variational quantum algorithms: Algebraic extensions of the parameter-shift rule to general unitary transformations
• Grover search revisited; application to image pattern matching
• A semi-agnostic ansatz with variable structure for quantum machine learning
• 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
• Unraveling correlated material properties with noisy quantum computers: Natural orbitalized variational quantum eigensolving of extended impurity models within a slave-boson approach
• Molecular Dynamics on Quantum Annealers
• Reducing Entanglement With Physically-Inspired Fermion-To-Qubit Mappings
• Partitioning Quantum Chemistry Simulations with Clifford Circuits
• Natural orbitals and sparsity of quantum mutual information
• Quantum Information Driven Ansatz (QIDA): shallow-depth empirical quantum circuits from Quantum Chemistry
• Sequential optimal selection of a single-qubit gate and its relation to barren plateau in parameterized quantum circuits
• Characterization of variational quantum algorithms using free fermions
• Stochastic approach for quantum metrology with generic Hamiltonians
• Qsun: an open-source platform towards practical quantum machine learning applications
• Implementing Jastrow--Gutzwiller operators on a quantum computer using the cascaded variational quantum eigensolver algorithm
• Optimization strategies in WAHTOR algorithm for quantum computing empirical ansatz: a comparative study
• Exploiting subspace constraints and ab initio variational methods for quantum chemistry
• Cascaded variational quantum eigensolver algorithm
• Quantum nuclear dynamics on a distributed set of ion-trap quantum computing systems
• Compact Multi-Threshold Quantum Information Driven Ansatz For Strongly Interactive Lattice Spin Models
• Entanglement-informed Construction of Variational Quantum Circuits
• Consensus-based qubit configuration optimization for variational algorithms on neutral atom quantum systems
• Distributed variational quantum computing with deterministic entanglement tuning