REVIEW 8 cited by
Faster quantum chemistry simulations on a quantum computer with improved tensor factorization and active volume compilation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Forward citations
Cited by 8 Pith papers
-
Fast simulations of X-ray absorption spectroscopy for battery materials on a quantum computer
An optimized Trotter-based quantum algorithm reduces the estimated cost of simulating X-ray absorption spectra for a Li4Mn2O cathode cluster to 100 logical qubits and 3.1e8 Toffoli gates per circuit.
-
Logical qubits with erasure conversion using metastable neutral atoms
Metastable 171Yb qubits turn many errors into detectable erasures and use that information to improve logical qubit decoding and teleportation.
-
Learning Circuits with Infinite Tensor Networks
Infinite tensor networks are used to compile translation-invariant quantum circuits that prepare ground states and time evolution operators with fewer gates than Trotterization.
-
Fullqubit alchemist: Quantum algorithm for alchemical free energy calculations
A quantum algorithm for alchemical free energy calculations that block-encodes the Liouvillian to simulate molecular dynamics with polylogarithmic precision scaling, avoiding entropy estimation.
-
Improving the runtime of quantum phase estimation for chemistry through basis set optimization
Frozen natural orbitals built from large basis sets and truncated to a fixed target accuracy substantially reduce quantum phase estimation resource estimates for molecular ground states.
-
QB Ground State Energy Estimation Benchmark
A new ground-state energy estimation benchmark rates SHCI, DMRG, and double-factorized QPE, reporting near-universal SHCI solvability from an ML extrapolation that its own empirical table only partially supports.
-
Quantum Circuit Caches and Compressors for Low Latency, High Throughput Computing
Caching and graph-state compression of repeated quantum sub-circuits yields about 10^5 lower transpilation latency in adder benchmarks, supporting just-in-time execution of large quantum programs.
-
Quantum Computing Technology Roadmaps and Capability Assessment for Scientific Computing -- An analysis of use cases from the NERSC workload
A NERSC analysis finds that more than 50% of its workload could ultimately benefit from quantum computing and that vendor roadmaps and quantum application requirements are projected to overlap in the next 5 to 10 years.
Discussion (0). Sign in to comment.