10 February 2020 in Chemical Reviews
9 June 2021 in PRX Quantum
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 the problem size. Increased depth can both degrade the accuracy of the results and reduce trainability. In this work, we propose an approach to reduce ansatz circuit depth. Our approach, called “PermVQE,” adds an additional optimization loop to the VQE that permutes qubits in order to solve for the qubit Hamiltonian that maximally localizes correlations in the ground state. The choice of permutations is based on mutual information, which is a measure of interaction between electrons and/or holes in spin-orbitals. Encoding strongly entangled spin-orbitals into proximal qubits on a quantum chip naturally reduces the circuit depth needed to prepare the ground state. For representative molecular systems, , , , , , and , we demonstrate that placing entangled qubits in close proximity leads to shallower depth circuits required to reach a given eigenvalue-eigenvector accuracy. The approach is designed for hardware-efficient ansatz of any qubit connectivity, and examples are demonstrated for linear and two-dimensional grid architectures. The main ideas can also be applied to simulate molecules with other ansatz as well as variational quantum algorithms beyond the VQE. In particular, we demonstrate the beneficial effect of qubit permutations to build fermionic–adaptive derivative assembled pseudo-Trotter ansatz on a linear qubit connectivity architecture with nearly a twofold reduction of the number of controlled not gates.
7 July 2020 in Journal of Chemical Theory and Computation
12 August 2022 in npj Quantum Information
The variational quantum eigensolver (VQE) is one of the most promising algorithms to find eigenstates of a given Hamiltonian on noisy intermediate-scale quantum devices (NISQ). The practical realization is limited by the complexity of quantum circuits. Here we present an approach to reduce quantum circuit complexity in VQE for electronic structure calculations. Our ClusterVQE algorithm splits the initial qubit space into clusters which are further distributed on individual (shallower) quantum circuits. The clusters are obtained based on mutual information reflecting maximal entanglement between qubits, whereas inter-cluster correlation 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 at the cost of additional classical resources, making it a potential leader for quantum chemistry simulations on NISQ devices. Proof-of-principle demonstrations are presented for several molecular systems based on quantum simulators as well as IBM quantum devices.
2 July 2020 in Journal of the American Chemical Society