Faster quantum chemistry simulations on a quantum computer with improved tensor factorization and active volume compilation

Abstract

Electronic structure calculations of molecular systems are among the most promising applications for fault-tolerant quantum computing (FTQC) in quantum chemistry and drug design. However, while recent algorithmic advancements such as qubitization and Tensor Hypercontraction (THC) have significantly reduced the complexity of such calculations, they do not yet achieve computational runtimes short enough to be practical for industrially relevant use cases. In this work, we introduce several advances to electronic structure calculation for molecular systems, resulting in a two-orders-of-magnitude speedup of estimated runtimes over prior-art algorithms run on comparable quantum devices. One of these advances is a novel framework for block-invariant symmetry-shifted Tensor Hypercontraction (BLISS-THC), with which we achieve the tightest Hamiltonian factorizations reported to date. We compile our algorithm for an Active Volume (AV) architecture, a technical layout that has recently been proposed for fusion-based photonic quantum hardware. AV compilation contributes towards a lower runtime of our computation by eliminating overheads stemming from connectivity issues in the underlying surface code. We present a detailed benchmark of our approach, focusing primarily on the computationally challenging benchmark molecule P450. Leveraging a number of hardware tradeoffs in interleaving-based photonic FTQC, we estimate runtimes for the electronic structure calculation of P450 as a function of the device footprint.

References in corpus (35)

• Surface codes: Towards practical large-scale quantum computation
• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• Simulated Quantum Computation of Molecular Energies
• Recent developments in the PySCF program package
• Hamiltonian Simulation by Qubitization
• Quantum algorithms for quantum chemistry and quantum materials science
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Elucidating Reaction Mechanisms on Quantum Computers
• Quantum error correction below the surface code threshold
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• Surface code quantum computing by lattice surgery
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• High-threshold and low-overhead fault-tolerant quantum memory
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Halving the cost of quantum addition
• Quantum computing enhanced computational catalysis
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Reliably assessing the electronic structure of cytochrome P450 on today's classical computers and tomorrow's quantum computers
• Drug design on quantum computers
• The electronic complexity of the ground-state of the FeMo cofactor of nitrogenase as relevant to quantum simulations
• Block2: a comprehensive open source framework to develop and apply state-of-the-art DMRG algorithms in electronic structure and beyond
• Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
• Quantum Computing for Molecular Biology
• Trading T gates for dirty qubits in state preparation and unitary synthesis
• High threshold codes for neutral atom qubits with biased erasure errors
• Simulating key properties of lithium-ion batteries with a fault-tolerant quantum computer
• Strong Electron Correlation in Nitrogenase Cofactor, FeMoco
• Reducing molecular electronic Hamiltonian simulation cost for Linear Combination of Unitaries approaches
• Rapid initial state preparation for the quantum simulation of strongly correlated molecules
• Reducing the runtime of fault-tolerant quantum simulations in chemistry through symmetry-compressed double factorization
• Accelerating Quantum Computations of Chemistry Through Regularized Compressed Double Factorization
• Fault-tolerant quantum computation of molecular observables

Cited by in corpus (5)

• Resource-optimized fault-tolerant simulation of the Fermi-Hubbard model and high-temperature superconductor models
• Logical qubits with erasure conversion using metastable neutral atoms
• Phase estimation with partially randomized time evolution
• Quantum resource estimates for computing binary elliptic curve discrete logarithms
• Chemically Motivated Simulation Problems are Efficiently Solvable by a Quantum Computer