Orbital transformations to reduce the 1-norm of the electronic structure Hamiltonian for quantum computing applications

Abstract

Reducing the complexity of quantum algorithms to treat quantum chemistry problems is essential to demonstrate an eventual quantum advantage of Noisy-Intermediate Scale Quantum (NISQ) devices over their classical counterpart. Significant improvements have been made recently to simulate the time-evolution operator $U(t)=e^{i\hat{\mathcal{H}}t}$ where $\hat{\mathcal{H}}$ is the electronic structure Hamiltonian, or to simulate $\hat{\mathcal{H}}$ directly (when written as a linear combination of unitaries) by using block encoding or "qubitization" techniques. A fundamental measure quantifying the practical implementation complexity of these quantum algorithms is the so-called "1-norm" of the qubit-representation of the Hamiltonian, which can be reduced by writing the Hamiltonian in factorized or tensor-hypercontracted forms for instance. In this work, we investigate the effect of classical pre-optimization of the electronic structure Hamiltonian representation, via single-particle basis transformation, on the 1-norm. Specifically, we employ several localization schemes and benchmark the 1-norm of several systems of different sizes (number of atoms and active space sizes). We also 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 that improves over localization schemes. This paper gives more insights about the importance of the 1-norm in quantum computing for quantum chemistry, and provides simple ways of decreasing its value to reduce the complexity of quantum algorithms.

References in corpus (16)

• Simulated Quantum Computation of Molecular Energies
• Hybrid quantum-classical algorithms and quantum error mitigation
• Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Quantum computing enhanced computational catalysis
• Exact Parameterization of Fermionic Wave Functions via Unitary Coupled Cluster Theory
• A state-averaged orbital-optimized hybrid quantum-classical algorithm for a democratic description of ground and excited states
• Minimizing estimation runtime on noisy quantum computers
• The Variational Localized Active Space Self-Consistent Field Method
• Penalty methods for variational quantum eigensolver
• Compilation by stochastic Hamiltonian sparsification
• Generalization of intrinsic orbitals to Kramers-paired quaternion spinors, molecular fragments and valence virtual spinors
• Microcanonical and finite temperature ab initio molecular dynamics simulations on quantum computers
• Pauli Partitioning with Respect to Gate Sets
• Co-iterative augmented Hessian method for orbital optimization
• Hybrid Quantum/Classical Derivative Theory: Analytical Gradients and Excited-State Dynamics for the Multistate Contracted Variational Quantum Eigensolver

Cited by in corpus (21)

• A randomized quantum algorithm for statistical phase estimation
• Efficient quantum computation of molecular forces and other energy gradients
• Reducing molecular electronic Hamiltonian simulation cost for Linear Combination of Unitaries approaches
• Quantum Computation for Periodic Solids in Second Quantization
• Quantum correlations in molecules: from quantum resourcing to chemical bonding
• Reducing the runtime of fault-tolerant quantum simulations in chemistry through symmetry-compressed double factorization
• Perturbation theory with quantum signal processing
• A stochastic quantum Krylov protocol with double factorized Hamiltonians
• Unraveling correlated material properties with noisy quantum computers: Natural orbitalized variational quantum eigensolving of extended impurity models within a slave-boson approach
• Continuous Hamiltonian dynamics on digital quantum computers without discretization error
• Quantum embedding of multi-orbital fragments using the Block-Householder-transformation
• A hybrid quantum algorithm to detect conical intersections
• TFermion: A non-Clifford gate cost assessment library of quantum phase estimation algorithms for quantum chemistry
• Practicality of quantum adiabatic algorithm for chemistry applications
• Ab initio extended Hubbard model of short polyenes for efficient quantum computing
• Fragment quantum embedding using the Householder transformation: a multi-state extension based on ensembles
• Quantum Computing in Pharma: A Multilayer Embedding Approach for Near Future Applications
• Solvent distribution effects on quantum chemical calculations with quantum computers
• Quantum-computing within a bosonic context: Assessing finite basis effects on prototypical vibrational Hamiltonian spectra
• Phase estimation with partially randomized time evolution
• Toward Density Functional Theory on Quantum Computers?