Tensor Factorized Recursive Hamiltonian Downfolding To Optimize The Scaling Complexity Of The Electronic Correlations Problem on Classical and Quantum Computers

• URL: http://arxiv.org/abs/2303.07051v3
• Date: Wed, 06 Nov 2024 16:24:32 GMT
• Title: Tensor Factorized Recursive Hamiltonian Downfolding To Optimize The Scaling Complexity Of The Electronic Correlations Problem on Classical and Quantum Computers
• Authors: Ritam Banerjee, Ananthakrishna Gopal, Soham Bhandary, Janani Seshadri, Anirban Mukherjee,
• Abstract summary: We present a new variant of post-Hartree-Fock Hamiltonian downfolding-based quantum chemistry methods with optimized scaling for high-cost simulations. We demonstrate super-quadratic speedups of expensive quantum chemistry algorithms on both classical and quantum computers.
• Score: 0.15833270109954137
• License:
• Abstract: This paper presents a new variant of post-Hartree-Fock Hamiltonian downfolding-based quantum chemistry methods with optimized scaling for high-cost simulations like coupled cluster (CC), full configuration interaction (FCI), and multi-reference CI (MRCI) on classical and quantum hardware. This improves the applicability of these calculations to practical use cases. High-accuracy quantum chemistry calculations, such as CC, involve memory and time-intensive tensor operations, which are the primary bottlenecks in determining the properties of many-electron systems. The complexity of those operations scales exponentially with system size. We aim to find properties of chemical systems by optimizing this scaling through mathematical transformations on the Hamiltonian and the state space. By defining a bi-partition of the many-body Hilbert space into electron-occupied and unoccupied blocks for a given orbital, we perform a downfolding transformation that decouples the electron-occupied block from its complement. We represent high-rank electronic integrals and cluster amplitude tensors as low-rank tensor factors of a downfolding transformation, mapping the full many-body Hamiltonian into a smaller dimensional block Hamiltonian recursively. This reduces the computational complexity of solving the residual equations for Hamiltonian downfolding on CPUs from $\mathcal{O}(N^7)$ for CCSD(T) and $\mathcal{O}(N^9)$ - $\mathcal{O}(N^{10})$ for CI and MRCI to $\mathcal{O}(N^3)$. Additionally, we create a quantum circuit encoding of the tensor factors, generating circuits of $\mathcal{O}(N^2)$ depth with $\mathcal{O}(\log N)$ qubits. We demonstrate super-quadratic speedups of expensive quantum chemistry algorithms on both classical and quantum computers.

Related papers

• Non-Iterative Disentangled Unitary Coupled-Cluster based on Lie-algebraic structure [0.0]
  Fixed Unitary Coupled-Cluster (UCC) ans"atze are attractive for performing quantum chemistry Variational Quantumsolver (VQE) computations. We introduce $k$-NI-DUCC, a fixed and Non-iterative Disentangled Unitary Coupled-Cluster compact ansatz.
  arXiv  Detail & Related papers  (2024-08-26T14:19:53Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Efficient Quantum Simulation of Electron-Phonon Systems by Variational Basis State Encoder [12.497706003633391]
  Digital quantum simulation of electron-phonon systems requires truncating infinite phonon levels into $N$ basis states. We propose a variational basis state encoding algorithm that reduces the scaling of the number of qubits and quantum gates.
  arXiv  Detail & Related papers  (2023-01-04T04:23:53Z)
• Variational Adiabatic Gauge Transformation on real quantum hardware for effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
  We introduce the Variational Adiabatic Gauge Transformation (VAGT) VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit. The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
  arXiv  Detail & Related papers  (2021-11-16T20:50:08Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Orbital transformations to reduce the 1-norm of the electronic structure Hamiltonian for quantum computing applications [0.0]
  We investigate the effect of classical pre-optimization of the electronic structure Hamiltonian representation, via single-particle basis transformation, on the "1-norm" We derive a new formula for the 1-norm as a function of the electronic integrals, and use this quantity as a cost function for an orbital-optimization scheme.
  arXiv  Detail & Related papers  (2021-03-26T22:05:42Z)
• Even more efficient quantum computations of chemistry through tensor hypercontraction [0.6234350105794442]
  We describe quantum circuits with only $widetildecal O(N)$ Toffoli complexity that block encode the spectra of quantum chemistry Hamiltonians in a basis of $N$ arbitrary orbitals. This is the lowest complexity that has been shown for quantum computations of chemistry within an arbitrary basis.
  arXiv  Detail & Related papers  (2020-11-06T18:03:29Z)
• Variational Monte Carlo calculations of $\mathbf{A\leq 4}$ nuclei with an artificial neural-network correlator ansatz [62.997667081978825]
  We introduce a neural-network quantum state ansatz to model the ground-state wave function of light nuclei. We compute the binding energies and point-nucleon densities of $Aleq 4$ nuclei as emerging from a leading-order pionless effective field theory Hamiltonian.
  arXiv  Detail & Related papers  (2020-07-28T14:52:28Z)
• Efficient Two-Electron Ansatz for Benchmarking Quantum Chemistry on a Quantum Computer [0.0]
  We present an efficient ansatz for the computation of two-electron atoms and molecules within a hybrid quantum-classical algorithm. The ansatz exploits the fundamental structure of the two-electron system, and treating the nonlocal and local degrees of freedom. We implement this benchmark with error mitigation on two publicly available quantum computers.
  arXiv  Detail & Related papers  (2020-04-21T23:37:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.