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 (58)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• The theory of variational hybrid quantum-classical algorithms
• Quantum Chemistry in the Age of Quantum Computing
• Simulated Quantum Computation of Molecular Energies
• Intrinsic atomic orbitals: An unbiased bridge between quantum theory and chemical concepts
• Hamiltonian Simulation by Qubitization
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Quantum algorithms for quantum chemistry and quantum materials science
• Elucidating Reaction Mechanisms on Quantum Computers
• Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
• Towards Practical Quantum Variational Algorithms
• Hybrid quantum-classical algorithms and quantum error mitigation
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• Quantum measurements and the Abelian Stabilizer Problem
• Variational Quantum Computation of Excited States
• Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
• A random compiler for fast Hamiltonian simulation
• Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
• Subspace-search variational quantum eigensolver for excited states
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• A practical guide to density matrix embedding theory in quantum chemistry
• Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
• Soundness and completeness of quantum root-mean-square errors
• Quantum computing enhanced computational catalysis
• Variational quantum algorithms for discovering Hamiltonian spectra
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• Automated construction of molecular active spaces from atomic valence orbitals
• Exact Parameterization of Fermionic Wave Functions via Unitary Coupled Cluster Theory
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Quantum equation of motion for computing molecular excitation energies on a noisy quantum processor
• Quantum phase estimation of multiple eigenvalues for small-scale (noisy) experiments
• Low rank representations for quantum simulation of electronic structure
• Application of fermionic marginal constraints to hybrid quantum algorithms
• Exponentially more precise quantum simulation of fermions I: Quantum chemistry in second quantization
• Exploiting locality in quantum computation for quantum chemistry
• Measurement reduction in variational quantum algorithms
• Exactly-embedded multiconfigurational self-consistent field theory using density matrix embedding: the localized active space self-consistent field method
• Calculating energy derivatives for quantum chemistry on a quantum computer
• Operator Locality in Quantum Simulation of Fermionic Models
• Nearly Optimal Measurement Scheduling for Partial Tomography of Quantum States
• Minimizing State Preparations in Variational Quantum Eigensolver by Partitioning into Commuting Families
• Quantum Algorithm for Molecular Properties and Geometry Optimization
• Minimizing estimation runtime on noisy quantum computers
• A state-averaged orbital-optimized hybrid quantum-classical algorithm for a democratic description of ground and excited states
• The Variational Localized Active Space Self-Consistent Field Method
• Theory of analytical energy derivatives for the variational quantum eigensolver
• 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
• Embedding for bulk systems using localized atomic orbitals
• 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?