Reducing molecular electronic Hamiltonian simulation cost for Linear Combination of Unitaries approaches

Abstract

We consider different Linear Combination of Unitaries (LCU) decompositions for molecular electronic structure Hamiltonians. Using these LCU decompositions for Hamiltonian simulation on a quantum computer, the main figure of merit is the 1-norm of their coefficients, which is associated with the quantum circuit complexity. It is derived that the lowest possible LCU 1-norm for a given Hamiltonian is half of its spectral range. This lowest norm decomposition is practically unattainable for general Hamiltonians; therefore, multiple practical techniques to generate LCU decompositions are proposed and assessed. A technique using symmetries to reduce the 1-norm further is also introduced. In addition to considering LCU in the Schrödinger picture, we extend it to the interaction picture, which substantially further reduces the 1-norm.

References in corpus (8)

• Simulating Hamiltonian dynamics with a truncated Taylor series
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Quantum computing enhanced computational catalysis
• Time-dependent unbounded Hamiltonian simulation with vector norm scaling
• Orbital transformations to reduce the 1-norm of the electronic structure Hamiltonian for quantum computing applications
• Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation
• How to define quantum mean-field solvable Hamiltonians using Lie algebras

Cited by in corpus (23)

• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• Rapid initial state preparation for the quantum simulation of strongly correlated molecules
• Hamiltonian simulation for hyperbolic partial differential equations by scalable quantum circuits
• Reducing the runtime of fault-tolerant quantum simulations in chemistry through symmetry-compressed double factorization
• Exponential improvements in the simulation of lattice gauge theories using near-optimal techniques
• Quantum simulation of battery materials using ionic pseudopotentials
• Accelerating Quantum Computations of Chemistry Through Regularized Compressed Double Factorization
• Assessment of various Hamiltonian partitionings for the electronic structure problem on a quantum computer using the Trotter approximation
• Quantum algorithm for partial differential equations of non-conservative systems with spatially varying parameters
• Faster quantum chemistry simulations on a quantum computer with improved tensor factorization and active volume compilation
• Simulating Vibrational Dynamics on Bosonic Quantum Devices
• Efficient Strategies for Reducing Sampling Error in Quantum Krylov Subspace Diagonalization
• Understanding and mitigating noise in molecular quantum linear response for spectroscopic properties on quantum computers
• Efficient ground-state energy estimation and certification on early fault-tolerant quantum computers
• Greedy Gradient-free Adaptive Variational Quantum Algorithms on a Noisy Intermediate Scale Quantum Computer
• Simulating Chemistry with Fermionic Optical Superlattices
• Solvent distribution effects on quantum chemical calculations with quantum computers
• Trotter simulation of vibrational Hamiltonians on a quantum computer
• Nonlinear Spectroscopy via Generalized Quantum Phase Estimation
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers
• Phase estimation with partially randomized time evolution
• Blockwise Optimization for Projective Variational Quantum Dynamics (BLOP-VQD): Algorithm and Implementation for Lattice Systems
• Quantum Simulation via Stochastic Combination of Unitaries