Low rank representations for quantum simulation of electronic structure

Abstract

The quantum simulation of quantum chemistry is a promising application of quantum computers. However, for N molecular orbitals, the $\mathcal{O}(N^4)$ gate complexity of performing Hamiltonian and unitary Coupled Cluster Trotter steps makes simulation based on such primitives challenging. We substantially reduce the gate complexity of such primitives through a two-step low-rank factorization of the Hamiltonian and cluster operator, accompanied by truncation of small terms. Using truncations that incur errors below chemical accuracy, we are able to perform Trotter steps of the arbitrary basis electronic structure Hamiltonian with $\mathcal{O}(N^3)$ gate complexity in small simulations, which reduces to $\mathcal{O}(N^2\log N)$ gate complexity in the asymptotic regime, while our unitary Coupled Cluster Trotter step has $\mathcal{O}(N^3)$ gate complexity as a function of increasing basis size for a given molecule. In the case of the Hamiltonian Trotter step, these circuits have $\mathcal{O}(N^2)$ depth on a linearly connected array, an improvement over the $\mathcal{O}(N^3)$ scaling assuming no truncation. As a practical example, we show that a chemically accurate Hamiltonian Trotter step for a 50 qubit molecular simulation can be carried out in the molecular orbital basis with as few as 4,000 layers of parallel nearest-neighbor two-qubit gates, consisting of fewer than 100,000 non-Clifford rotations. We also apply our algorithm to iron-sulfur clusters relevant for elucidating the mode of action of metalloenzymes.

8 pages, 4 figures

References in corpus (17)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Surface codes: Towards practical large-scale quantum computation
• Simulated Quantum Computation of Molecular Energies
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Toward the first quantum simulation with quantum speedup
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Quantum computing enhanced computational catalysis
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
• Quantum algorithms to simulate many-body physics of correlated fermions
• Ab initio computations of molecular systems by the auxiliary-field quantum Monte Carlo method
• Efficient synthesis of universal Repeat-Until-Success circuits
• A Jastrow-type decomposition in quantum chemistry for low-depth quantum circuits
• An efficient algorithm for Cholesky decomposition of electron repulsion integrals
• Efficient ab initio auxiliary-field quantum Monte Carlo calculations in Gaussian bases via low-rank tensor decomposition

Cited by in corpus (54)

• Variational Quantum Algorithms
• The Variational Quantum Eigensolver: a review of methods and best practices
• Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
• Building a fault-tolerant quantum computer using concatenated cat codes
• Quantum computing enhanced computational catalysis
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• A Quantum Computing View on Unitary Coupled Cluster Theory
• Emerging quantum computing algorithms for quantum chemistry
• Increasing the representation accuracy of quantum simulations of chemistry without extra quantum resources
• Reliably assessing the electronic structure of cytochrome P450 on today's classical computers and tomorrow's quantum computers
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• A Jastrow-type decomposition in quantum chemistry for low-depth quantum circuits
• Calculating energy derivatives for quantum chemistry on a quantum computer
• Hardware Efficient Quantum Algorithms for Vibrational Structure Calculations
• Towards a Larger Molecular Simulation on the Quantum Computer: Up to 28 Qubits Systems Accelerated by Point Group Symmetry
• Toward Practical Quantum Embedding Simulation of Realistic Chemical Systems on Near-term Quantum Computers
• Nearly tight Trotterization of interacting electrons
• Majorana loop stabilizer codes for error correction of fermionic quantum simulations
• Simulating key properties of lithium-ion batteries with a fault-tolerant quantum computer
• Variational Quantum Computation of Molecular Linear Response Properties on a Superconducting Quantum Processor
• Efficient quantum computation of molecular forces and other energy gradients
• Orbital transformations to reduce the 1-norm of the electronic structure Hamiltonian for quantum computing applications
• Fluid fermionic fragments for optimizing quantum measurements of electronic Hamiltonians in the variational quantum eigensolver
• The Bonsai algorithm: grow your own fermion-to-qubit mapping
• Improving quantum measurements by introducing "ghost" Pauli products
• On the complexity of implementing Trotter steps
• Hybrid quantum-classical algorithm for computing imaginary-time correlation functions
• Quantum simulation of real-space dynamics
• Simulating Effective QED on Quantum Computers
• The Fermionic Quantum Emulator
• Quantum simulations employing connected moments expansions
• The Basics of Quantum Computing for Chemists
• AGP-based unitary coupled cluster theory for quantum computers
• Minimal Effective Gibbs Ansatz (MEGA): A simple protocol for extracting an accurate thermal representation for quantum simulation
• Accelerating Quantum Computations of Chemistry Through Regularized Compressed Double Factorization
• Calculating nonadiabatic couplings and Berry's phase by variational quantum eigensolvers
• Exploiting fermion number in factorized decompositions of the electronic structure Hamiltonian
• Variational dynamics as a ground-state problem on a quantum computer
• Assessment of various Hamiltonian partitionings for the electronic structure problem on a quantum computer using the Trotter approximation
• A stochastic quantum Krylov protocol with double factorized Hamiltonians
• Efficient Quantum Analytic Nuclear Gradients with Double Factorization
• From Ansätze to Z-gates: a NASA View of Quantum Computing
• A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz
• TFermion: A non-Clifford gate cost assessment library of quantum phase estimation algorithms for quantum chemistry
• Quantifying fermionic nonlinearity of quantum circuits
• Graph Optimization Perspective for Low-Depth Trotter-Suzuki Decomposition
• Differentiable quantum computational chemistry with PennyLane
• ChemiQ: A Chemistry Simulator for Quantum Computer
• Computing Electronic Correlation Energies using Linear Depth Quantum Circuits
• Discontinuous Galerkin discretization for quantum simulation of chemistry
• Qubit coupled cluster singles and doubles variational quantum eigensolver ansatz for electronic structure calculations
• Towards Compact Wavefunctions from Quantum-Selected Configuration Interaction
• Many-Fermion Simulation from the Contracted Quantum Eigensolver without Fermionic Encoding of the Wave Function
• Quantum Computation