Simultaneously Optimizing Symmetry Shifts and Tensor Factorizations for Cost-Efficient Fault-Tolerant Quantum Simulations of Electronic Hamiltonians

In fault-tolerant quantum computing, the cost of calculating Hamiltonian eigenvalues using the quantum phase estimation algorithm is proportional to the constant scaling the Hamiltonian matrix block-encoded in a unitary circuit. We present a method to reduce this scaling constant for the electronic Hamiltonians represented as a linear combination of unitaries. Our approach combines the double tensor-factorization method of Burg et al. with the block-invariant symmetry shift method of Loaiza and Izmaylov. By extending the electronic Hamiltonian with appropriately parametrized symmetry operators and optimizing the tensor factorization parameters, our method achieves a 25% reduction in the block-encoding scaling constant compared to previous best techniques for industrially and biologically relevant molecules, including the nitrogenase cofactor (FeMoCo) and cytochrome P450. Benchmark calculations comparing our method with the original double-factorization method show a 75% reduction in the block-encoding scaling constant. The resulting savings in the number of non-Clifford T-gates, which are an essential resource for fault-tolerant quantum computation, are expected to accelerate the journey to the feasibility of practical Hamiltonian simulations.

Authors

Publication Details

Journal
Journal of Chemical Theory and Computation
Published
2025-04-22
DOI
https://doi.org/10.1021/acs.jctc.4c01722
Citations
2
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
4.96

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Simultaneously Optimizing Symmetry Shifts and Tensor Factorizations for Cost-Efficient Fault-Tolerant Quantum Simulations of Electronic Hamiltonians

Konrad Deka, E. J. Zak
2 citations
Journal of Chemical Theory and Computation
Quantum Computing Algorithms and Architecture
4.96
article

Simultaneously Optimizing Symmetry Shifts and Tensor Factorizations for Cost-Efficient Fault-Tolerant Quantum Simulations of Electronic Hamiltonians

Konrad Deka, E. J. Zak
article en
2 citations

Abstract

In fault-tolerant quantum computing, the cost of calculating Hamiltonian eigenvalues using the quantum phase estimation algorithm is proportional to the constant scaling the Hamiltonian matrix block-encoded in a unitary circuit. We present a method to reduce this scaling constant for the electronic Hamiltonians represented as a linear combination of unitaries. Our approach combines the double tensor-factorization method of Burg et al. with the block-invariant symmetry shift method of Loaiza and Izmaylov. By extending the electronic Hamiltonian with appropriately parametrized symmetry operators and optimizing the tensor factorization parameters, our method achieves a 25% reduction in the block-encoding scaling constant compared to previous best techniques for industrially and biologically relevant molecules, including the nitrogenase cofactor (FeMoCo) and cytochrome P450. Benchmark calculations comparing our method with the original double-factorization method show a 75% reduction in the block-encoding scaling constant. The resulting savings in the number of non-Clifford T-gates, which are an essential resource for fault-tolerant quantum computation, are expected to accelerate the journey to the feasibility of practical Hamiltonian simulations.

Journal of Chemical Theory and ComputationVol. 21(9)
HORIZON EUROPE European Innovation Council
Climate action
Openalex Percentile: Top 6%
Quantum Computing Algorithms and Architecture
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.