Quantum Filter Diagonalization with Double-Factorized Hamiltonians
arXiv:2104.08957 · doi:10.1103/PRXQuantum.2.040352
Abstract
We demonstrate a method that merges the quantum filter diagonalization (QFD) approach for hybrid quantum/classical solution of the time-independent electronic Schrödinger equation with a low-rank double factorization (DF) approach for the representation of the electronic Hamiltonian. In particular, we explore the use of sparse "compressed" double factorization (C-DF) truncation of the Hamiltonian within the time-propagation elements of QFD, while retaining a similarly compressed but numerically converged double-factorized representation of the Hamiltonian for the operator expectation values needed in the QFD quantum matrix elements. Together with significant circuit reduction optimizations and number-preserving post-selection/echo-sequencing error mitigation strategies, the method is found to provide accurate predictions for low-lying eigenspectra in a number of representative molecular systems, while requiring reasonably short circuit depths and modest measurement costs. The method is demonstrated by experiments on noise-free simulators, decoherence- and shot-noise including simulators, and real quantum hardware.
References in corpus (1)
Cited by in corpus (33)
- Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
- Exact and efficient Lanczos method on a quantum computer
- Quantum chemistry simulation of ground- and excited-state properties of the sulfonium cation on a superconducting quantum processor
- Quantum Machine Learning in Drug Discovery: Applications in Academia and Pharmaceutical Industries
- Quantifying the effect of gate errors on variational quantum eigensolvers for quantum chemistry
- Fluid fermionic fragments for optimizing quantum measurements of electronic Hamiltonians in the variational quantum eigensolver
- Hybrid quantum-classical algorithm for computing imaginary-time correlation functions
- Challenges in the use of quantum computing hardware-efficient Ansatze in electronic structure theory
- Synthesis of and compilation with time-optimal multi-qubit gates
- Reducing the runtime of fault-tolerant quantum simulations in chemistry through symmetry-compressed double factorization
- Diagonalization of large many-body Hamiltonians on a quantum processor
- Accelerating Quantum Computations of Chemistry Through Regularized Compressed Double Factorization
- Efficient Quantum Analytic Nuclear Gradients with Double Factorization
- Fault-tolerant quantum computation of molecular observables
- A stochastic quantum Krylov protocol with double factorized Hamiltonians
- Analysis of quantum Krylov algorithms with errors
- Tailored and Externally Corrected Coupled Cluster with Quantum Inputs
- Sampling Error Analysis in Quantum Krylov Subspace Diagonalization
- Measurement-efficient quantum Krylov subspace diagonalisation
- Fast-forwarding quantum simulation with real-time quantum Krylov subspace algorithms
- A hybrid quantum algorithm to detect conical intersections
- A Quantum Algorithmic Approach to Multiconfigurational Valence Bond Theory: Insights from Interpretable Circuit Design
- Precision ground-state energy calculation for the water molecule on a superconducting quantum processor
- Understanding and mitigating noise in molecular quantum linear response for spectroscopic properties on quantum computers
- Time-optimal multi-qubit gates: Complexity, efficient heuristic and gate-time bounds
- Comparative study on compact quantum circuits of hybrid quantum-classical algorithms for quantum impurity models
- Phase estimation with partially randomized time evolution
- Adaptive measurement strategy for quantum subspace methods
- Adiabatic state preparation from general initial states
- Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions
- Numerical investigation of the quantum inverse algorithm on small molecules
- Towards Compact Wavefunctions from Quantum-Selected Configuration Interaction
- Data-Driven Reconstruction and Characterization of Stochastic Dynamics via Dynamical Mode Decomposition