Reducing the runtime of fault-tolerant quantum simulations in chemistry through symmetry-compressed double factorization
arXiv:2403.03502 · doi:10.1021/acs.jctc.4c00352
Abstract
Quantum phase estimation based on qubitization is the state-of-the-art fault-tolerant quantum algorithm for computing ground-state energies in chemical applications. In this context, the 1-norm of the Hamiltonian plays a fundamental role in determining the total number of required iterations and also the overall computational cost. In this work, we introduce the symmetry-compressed double factorization (SCDF) approach, which combines a compressed double factorization of the Hamiltonian with the symmetry shift technique, significantly reducing the 1-norm value. The effectiveness of this approach is demonstrated numerically by considering various benchmark systems, including the FeMoco molecule, cytochrome P450, and hydrogen chains of different sizes. To compare the efficiency of SCDF to other methods in absolute terms, we estimate Toffoli gate requirements, which dominate the execution time on fault-tolerant quantum computers. For the systems considered here, SCDF leads to a sizeable reduction of the Toffoli gate count in comparison to other variants of double factorization or even tensor hypercontraction, which is usually regarded as the most efficient approach for qubitization.
References in corpus (12)
- Simulated Quantum Computation of Molecular Energies
- Suppressing quantum errors by scaling a surface code logical qubit
- Logical quantum processor based on reconfigurable atom arrays
- The Variational Quantum Eigensolver: a review of methods and best practices
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Even more efficient quantum computations of chemistry through tensor hypercontraction
- Quantum computing enhanced computational catalysis
- Reliably assessing the electronic structure of cytochrome P450 on today's classical computers and tomorrow's quantum computers
- Improved magic states distillation for quantum universality
- Quantum Filter Diagonalization with Double-Factorized Hamiltonians
- Reducing molecular electronic Hamiltonian simulation cost for Linear Combination of Unitaries approaches
- Orbital transformations to reduce the 1-norm of the electronic structure Hamiltonian for quantum computing applications
Cited by in corpus (11)
- Quantum Simulations of Chemistry in First Quantization with any Basis Set
- Faster quantum chemistry simulations on a quantum computer with improved tensor factorization and active volume compilation
- Fast quantum simulation of electronic structure by spectrum amplification
- Ab initio extended Hubbard model of short polyenes for efficient quantum computing
- Molecular Properties from Quantum Krylov Subspace Diagonalization
- Compressing Hamiltonians with ab initio downfolding for simulating strongly-correlated materials on quantum computers
- Error mitigation and circuit division for early fault-tolerant quantum phase estimation
- The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute
- Trotter simulation of vibrational Hamiltonians on a quantum computer
- Simulating methylamine using symmetry adapted qubit-excitation-based variational quantum eigensolver
- Phase estimation with partially randomized time evolution