Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.25968

Efficient Block Encodings for Ensembles of Molecular Hamiltonians

Cristian L. Cortes, Andrew J. Jenkins, William Pol, Dario Rocca, Mark Steudtner, Gian-Luca R. Anselmetti, Matthias Degroote, Nikolaj Moll, Raffaele Santagati, Michael Streif, Markus R. Hermann

quant-phSubmitted Oct 19, 2026• Announced Oct 20, 2026• 1 citation
arXivHTMLPDF

Abstract

Accurately characterizing molecular properties and reactivity often requires electronic-structure calculations across an ensemble of molecular geometries. Quantum algorithms that process such ensembles coherently could address this challenge, but they require Hamiltonian block encoding circuits that combine advanced factorization techniques with sublinear scaling in ensemble size. Here, we introduce SVD-THC, which extends tensor hypercontraction to sets of Hamiltonians defined at different nuclear geometries through a singular value decomposition of the ensemble. We use SVD-THC to construct a single multiplexed block encoding circuit for all geometries in an ensemble. We then evaluate the approach on ensembles generated by varying internal rotational coordinates in 1-bromo-2-chloroethane as well as in glycine and alanine dipeptides, corresponding to established model systems for peptide conformational landscapes, with up to 5,184 geometries. Across several resolutions of the internal-coordinate grids, the Toffoli complexity of the resulting circuits grows only weakly with the number of geometries, changing by at most 12\% over grids that differ in size by up to 576$\times$. In an energy-thresholding circuit, this yields 35--200$\times$ fewer Toffoli gates than slicing together single-geometry block encodings. This approach could help make coherent processing of molecular geometry ensembles a useful primitive for fault-tolerant quantum computing.

AI Summary

Electronic-structure tasks involving potential-energy surfaces require access to Hamiltonians at many nuclear geometries. This paper asks whether their shared structure can reduce the cost of coherently block encoding an ensemble, rather than implementing independent geometry-conditioned circuits. SVD-THC constructs a joint geometry basis from one- and two-electron integral snapshots, expressing the ensemble through $K$ geometry-independent fermionic Hamiltonians. Each mode is compressed with BLISS tensor hypercontraction. A multiplexed circuit loads geometry-dependent mode weights and accommodates different THC ranks across modes. Resource estimates use this primitive in coherent energy thresholding via phase estimation and generalized quantum signal processing. Numerical tests cover 1-bromo-2-chloroethane and glycine and alanine dipeptides, with up to $5{,}184$ geometries. The relaxed ensembles retain respectively $14$, $90$, and $150$ modes. Compression is validated at every sampled geometry using CCSD correlation-energy errors below $0.6$ mHa, with exact Hartree–Fock offsets restored separately. Estimated Toffoli costs change by at most $12\%$ across grids differing by up to $576\times$. Full-grid reductions versus sliced single-geometry block encodings are approximately $35$–$201\times$; reductions versus sequential energy estimation are $10$–$60\times$. Active-volume reductions versus slicing are smaller, approximately $18$–$30\times$. The tests use minimal STO-3G bases, frozen cores, and low-dimensional torsional scans; CCSD is a proxy for quantum-resolved correlation energies. Relaxation reduces compressibility. Explicit ensemble preprocessing limits higher-dimensional applications, smoothly varying active spaces remain unresolved, and Clifford-heavy data loading limits active-volume savings. End-to-end search advantages require additional thresholding queries and depend on their constants.

Little sign of AI-generated textMissing comparisonOverclaims

Error found: The resource discussion retains a full-grid 150-mode circuit for the nine-geometry alanine subset without clearly explaining how this relates to the captions' statement that compression is redone for each grid. The observed nearly constant finite-grid costs do not establish general ensemble-size scaling without assumptions on compression ranks, normalization, and data-loading workspace. The CCSD correlation-energy tests validate a classical proxy rather than certify the compression error in exact ground-state energies returned by QPE. The QPE appendix incorrectly substitutes a product of projected oracle blocks for the projected implemented sequence and uses an unjustified state-distance-to-probability bound, leaving its claimed 5% confidence loss unproved.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Efficient Block Encodings of Vibrational Hamiltonians

Shashank G. Mehendale, Ignacio Loaiza, Shreyas Malpathak +3 more

Simulation of molecular vibrations is emerging as a promising application of quantum computing in quantum chemistry. In this work, we develop new strategies for block-encoding the second-quantized $n$-mode representation of the vibrational Hamiltonian, whose algebraic structure closely parallels that of the second-quantized electronic Hamiltonian. We derive linear-combination-of-unitaries (LCU) representations of this Hamiltonian based on Pauli decomposition and tensor hypercontraction (THC) and construct efficient circuits for the corresponding block encodings. We also extend the Block-Invariant Symmetry Shift (BLISS) technique to vibrational Hamiltonians, yielding a lower LCU 1-norm and, consequently, a lower overall circuit cost. For the molecules considered here, BLISS-THC reduces the Toffoli cost of quantum phase estimation by more than two orders of magnitude relative to existing block-encoding approaches. In comparison with recent Trotter-based methods, it shows up to a ninefold reduction in the T-gate count, with the relative savings tending to increase with system size. Asymptotically, and up to polylogarithmic factors, both the Pauli and THC LCUs trade additional ancillas for a quadratic improvement in scaling with the number of modes, while THC provides an additional quadratic improvement in scaling with the number of modals. These results highlight the importance of Hamiltonian factorizations and Toffoli-qubit tradeoffs for reducing the computational cost of quantum simulations of molecular vibrations.

quant-pharXiv:2610.33800•Oct 27, 2026•0 citations

Even More Efficient Quantum Computations of Chemistry Through Tensor Hypercontraction

Joonho Lee, Dominic William Berry, Craig Gidney +4 more

We describe quantum circuits with only O(N ) Toffoli complexity that block encode the spectra of quantum chemistry Hamiltonians in a basis of N arbitrary (e.g., molecular) orbitals.With O(λ/ ) repetitions of these circuits one can use phase estimation to sample in the molecular eigenbasis, where λ is the 1-norm of Hamiltonian coefficients and is the target precision.This is the lowest complexity shown for quantum computations of chemistry within an arbitrary basis.Furthermore, up to logarithmic factors, this matches the scaling of the most efficient prior block encodings that can work only with orthogonal-basis functions diagonalizing the Coloumb operator (e.g., the plane-wave dual basis).Our key insight is to factorize the Hamiltonian using a method known as tensor hypercontraction (THC) and then to transform the Coulomb operator into an isospectral diagonal form with a nonorthogonal basis defined by the THC factors.We then use qubitization to simulate the nonorthogonal THC Hamiltonian, in a fashion that avoids most complications of the nonorthogonal basis.We also reanalyze and reduce the cost of several of the best prior algorithms for these simulations in order to facilitate a clear comparison to the present work.In addition to having lower asymptotic scaling space-time volume, compilation of our algorithm for challenging finitesized molecules such as FeMoCo reveals that our method requires the least fault-tolerant resources of any known approach.By laying out and optimizing the surface-code resources required of our approach we show that FeMoCo can be simulated using about four million physical qubits and under 4 days of runtime, assuming 1-μs cycle times and physical gate-error rates no worse than 0.1%.

arXiv:2011.03494•PRX Quantum•Jul 8, 2021•383 citations

Computational complexity analysis of the linear combination of unitaries algorithm in the quantum chemistry framework

Defne Tolun

Hamiltonian simulation is a fundamental application of quantum computing, particularly in quantum chemistry, where solving the electronic structure problem requires efficiently representing electron repulsion integrals (ERI). This thesis analyzes the computational complexity of Hamiltonian simulation using the Linear Combination ofUnitaries (LCU) algorithm and Tensor Hypercontraction (THC), a factorization method that reduces the cost of ERI representation. By decomposing the Coulomb tensor via Interpolative Separable Density Fitting (ISDF) and mapping the THC representation to an LCU form using the Jordan-Wigner transformation, we achieve a more efficient block encoding of the Hamiltonian in a basis of N molecular orbitals. This enables quantum simulation with an asymptotic Toffoli complexity of O(Nl/e) and a space complexity of O(N), where e = 0.0016 Hartree is the target accuracy and l denotes the 1-norm of the coefficients of the electronic Hamiltonian in the THC representation. Beyond Hamiltonian simulation, we explore how Quantum Signal Processing (QSP) and Quantum Singular Value Transformation (QSVT) leverage block encoding for eigenvalue transformations and time evolution, extending its utility to a broader class of quantum algorithms. Despite these advancements, large-scale quantum chemistry simulations are far from experimental feasibility, for instance, simulating the FeMoCo molecule in an active space model under surface code constraints would require billions of Toffoli gates, millions of physical qubits and several days of runtime using error-corrected qubits; and that is assuming it ever becomes feasible. This work contributes to the effort of making quantum chemistry simulations more computationally viable by investigating how LCU and THC can be integrated to reduce costs and maintain chemical accuracy, while exploring different methods and their combinations to identify key challenges in quantum chemistry simulations.

•Jan 1, 2025•0 citations

Faster Quantum Chemistry Simulations on a Quantum Computer with Improved Tensor Factorization and Active Volume Compilation

Athena Caesura, Cristian L. Cortes, William Pol +8 more

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 combine several advances to electronic structure calculation for molecular systems, resulting in a 2-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, 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 trade-offs in interleaving-based photonic FTQC, we estimate runtimes for the electronic structure calculation of P450 as a function of the device footprint.

arXiv:2501.06165•PRX Quantum•Jul 22, 2025•48 citations

Fast Quantum Simulation of Electronic Structure by Spectral Amplification

Guang Hao Low, Robbie King, Dominic William Berry +6 more

The most advanced techniques using fault-tolerant quantum computers to estimate the ground-state energy of a chemical Hamiltonian involve compression of the Coulomb operator through tensor factorizations, enabling efficient block encodings of the Hamiltonian. A natural challenge of these methods is the degree to which block-encoding costs can be reduced. We address this challenge through the technique of spectral amplification, which magnifies the spectrum of the low-energy states of Hamiltonians that can be expressed as sums of squares. Spectral amplification enables estimating ground-state energies with significantly improved cost scaling in the block encoding normalization factor Λ to just 2 Λ E gap , where E gap ≪ Λ is the lowest energy of the sum-of-squares Hamiltonian. To achieve this, we show that sum-of-squares representations of the electronic structure Hamiltonian are efficiently computable by a family of classical simulation techniques that approximate the ground-state energy from below. In order to further optimize, we also develop a novel factorization that provides a trade-off between the two leading Coulomb integral factorization schemes—namely, double factorization and tensor hypercontraction—that when combined with spectral amplification yields a factor of 4 to 195 speedup over the state of the art in ground-state energy estimation for models of iron-sulfur complexes and a CO 2 -fixation catalyst.

arXiv:2502.15882•Physical Review X•Sep 9, 2025•64 citations

Scalable Quantum Monte Carlo Method for Polariton Chemistry via Mixed Block Sparsity and Tensor Hypercontraction Method

Yu Zhang

We present a reduced-scaling auxiliary-field quantum Monte Carlo (AFQMC) framework designed for large molecular systems and ensembles, with or without coupling to optical cavities. Our approach leverages the natural block sparsity of the Cholesky decomposition (CD) of electron repulsion integrals in molecular ensembles and employs tensor hypercontraction (THC) to efficiently compress low-rank Cholesky blocks. By representing the Cholesky vectors in a mixed format, keeping high-rank blocks in block-sparse form and compressing low-rank blocks with THC, we reduce the scaling of exchange-energy evaluation from quartic to robust cubic in the number of molecular orbitals N, while lowering memory from cubic toward quadratic. Benchmark analyses on one-, two-, and three-dimensional molecular ensembles (up to ∼1,200 orbitals) show that (a) the number of nonzeros in Cholesky tensors grows linearly with system size across dimensions; (b) the average numerical rank increases sublinearly and does not saturate at these sizes; and (c) rank heterogeneity─some blocks nearly full rank and many low rank, naturally motivates the proposed mixed block sparsity and THC scheme for efficient calculation of exchange energy. We demonstrate that the mixed scheme yields cubic wall-time scaling with favorable prefactors and preserves AFQMC accuracy.

arXiv:2510.11634•Journal of Chemical Theory and Computation•Feb 2, 2026•1 citation
Accurately characterizing molecular properties and reactivity often requires electronic-structure calculations across an ensemble of molecular geometries. Quantum algorithms that process such ensembles coherently could address this challenge, but they require Hamiltonian block encoding circuits that combine advanced factorization techniques with sublinear scaling in ensemble size. Here, we introduce SVD-THC, which extends tensor hypercontraction to sets of Hamiltonians defined at different nuclear geometries through a singular value decomposition of the ensemble. We use SVD-THC to construct a single multiplexed block encoding circuit for all geometries in an ensemble. We then evaluate the approach on ensembles generated by varying internal rotational coordinates in 1-bromo-2-chloroethane as well as in glycine and alanine dipeptides, corresponding to established model systems for peptide conformational landscapes, with up to 5,184 geometries. Across several resolutions of the internal-coordinate grids, the Toffoli complexity of the resulting circuits grows only weakly with the number of geometries, changing by at most 12% over grids that differ in size by up to 576×\times×. In an energy-thresholding circuit, this yields 35--200×\times× fewer Toffoli gates than slicing together single-geometry block encodings. This approach could help make coherent processing of molecular geometry ensembles a useful primitive for fault-tolerant quantum computing.
Electronic-structure tasks involving potential-energy surfaces require access to Hamiltonians at many nuclear geometries. This paper asks whether their shared structure can reduce the cost of coherently block encoding an ensemble, rather than implementing independent geometry-conditioned circuits.
SVD-THC constructs a joint geometry basis from one- and two-electron integral snapshots, expressing the ensemble through KKK geometry-independent fermionic Hamiltonians. Each mode is compressed with BLISS tensor hypercontraction. A multiplexed circuit loads geometry-dependent mode weights and accommodates different THC ranks across modes. Resource estimates use this primitive in coherent energy thresholding via phase estimation and generalized quantum signal processing.
Numerical tests cover 1-bromo-2-chloroethane and glycine and alanine dipeptides, with up to 5,1845{,}1845,184 geometries. The relaxed ensembles retain respectively 141414, 909090, and 150150150 modes. Compression is validated at every sampled geometry using CCSD correlation-energy errors below 0.60.60.6 mHa, with exact Hartree–Fock offsets restored separately. Estimated Toffoli costs change by at most 12%12\%12% across grids differing by up to 576×576\times576×. Full-grid reductions versus sliced single-geometry block encodings are approximately 353535–201×201\times201×; reductions versus sequential energy estimation are 101010–60×60\times60×. Active-volume reductions versus slicing are smaller, approximately 181818–30×30\times30×.
The tests use minimal STO-3G bases, frozen cores, and low-dimensional torsional scans; CCSD is a proxy for quantum-resolved correlation energies. Relaxation reduces compressibility. Explicit ensemble preprocessing limits higher-dimensional applications, smoothly varying active spaces remain unresolved, and Clifford-heavy data loading limits active-volume savings. End-to-end search advantages require additional thresholding queries and depend on their constants.
Simulation of molecular vibrations is emerging as a promising application of quantum computing in quantum chemistry. In this work, we develop new strategies for block-encoding the second-quantized nnn-mode representation of the vibrational Hamiltonian, whose algebraic structure closely parallels that of the second-quantized electronic Hamiltonian. We derive linear-combination-of-unitaries (LCU) representations of this Hamiltonian based on Pauli decomposition and tensor hypercontraction (THC) and construct efficient circuits for the corresponding block encodings. We also extend the Block-Invariant Symmetry Shift (BLISS) technique to vibrational Hamiltonians, yielding a lower LCU 1-norm and, consequently, a lower overall circuit cost. For the molecules considered here, BLISS-THC reduces the Toffoli cost of quantum phase estimation by more than two orders of magnitude relative to existing block-encoding approaches. In comparison with recent Trotter-based methods, it shows up to a ninefold reduction in the T-gate count, with the relative savings tending to increase with system size. Asymptotically, and up to polylogarithmic factors, both the Pauli and THC LCUs trade additional ancillas for a quadratic improvement in scaling with the number of modes, while THC provides an additional quadratic improvement in scaling with the number of modals. These results highlight the importance of Hamiltonian factorizations and Toffoli-qubit tradeoffs for reducing the computational cost of quantum simulations of molecular vibrations.
We describe quantum circuits with only O(N ) Toffoli complexity that block encode the spectra of quantum chemistry Hamiltonians in a basis of N arbitrary (e.g., molecular) orbitals.With O(λ/ ) repetitions of these circuits one can use phase estimation to sample in the molecular eigenbasis, where λ is the 1-norm of Hamiltonian coefficients and is the target precision.This is the lowest complexity shown for quantum computations of chemistry within an arbitrary basis.Furthermore, up to logarithmic factors, this matches the scaling of the most efficient prior block encodings that can work only with orthogonal-basis functions diagonalizing the Coloumb operator (e.g., the plane-wave dual basis).Our key insight is to factorize the Hamiltonian using a method known as tensor hypercontraction (THC) and then to transform the Coulomb operator into an isospectral diagonal form with a nonorthogonal basis defined by the THC factors.We then use qubitization to simulate the nonorthogonal THC Hamiltonian, in a fashion that avoids most complications of the nonorthogonal basis.We also reanalyze and reduce the cost of several of the best prior algorithms for these simulations in order to facilitate a clear comparison to the present work.In addition to having lower asymptotic scaling space-time volume, compilation of our algorithm for challenging finitesized molecules such as FeMoCo reveals that our method requires the least fault-tolerant resources of any known approach.By laying out and optimizing the surface-code resources required of our approach we show that FeMoCo can be simulated using about four million physical qubits and under 4 days of runtime, assuming 1-μs cycle times and physical gate-error rates no worse than 0.1%.
Hamiltonian simulation is a fundamental application of quantum computing, particularly in quantum chemistry, where solving the electronic structure problem requires efficiently representing electron repulsion integrals (ERI). This thesis analyzes the computational complexity of Hamiltonian simulation using the Linear Combination ofUnitaries (LCU) algorithm and Tensor Hypercontraction (THC), a factorization method that reduces the cost of ERI representation. By decomposing the Coulomb tensor via Interpolative Separable Density Fitting (ISDF) and mapping the THC representation to an LCU form using the Jordan-Wigner transformation, we achieve a more efficient block encoding of the Hamiltonian in a basis of N molecular orbitals. This enables quantum simulation with an asymptotic Toffoli complexity of O(Nl/e) and a space complexity of O(N), where e = 0.0016 Hartree is the target accuracy and l denotes the 1-norm of the coefficients of the electronic Hamiltonian in the THC representation. Beyond Hamiltonian simulation, we explore how Quantum Signal Processing (QSP) and Quantum Singular Value Transformation (QSVT) leverage block encoding for eigenvalue transformations and time evolution, extending its utility to a broader class of quantum algorithms. Despite these advancements, large-scale quantum chemistry simulations are far from experimental feasibility, for instance, simulating the FeMoCo molecule in an active space model under surface code constraints would require billions of Toffoli gates, millions of physical qubits and several days of runtime using error-corrected qubits; and that is assuming it ever becomes feasible. This work contributes to the effort of making quantum chemistry simulations more computationally viable by investigating how LCU and THC can be integrated to reduce costs and maintain chemical accuracy, while exploring different methods and their combinations to identify key challenges in quantum chemistry simulations.
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 combine several advances to electronic structure calculation for molecular systems, resulting in a 2-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, 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 trade-offs in interleaving-based photonic FTQC, we estimate runtimes for the electronic structure calculation of P450 as a function of the device footprint.
The most advanced techniques using fault-tolerant quantum computers to estimate the ground-state energy of a chemical Hamiltonian involve compression of the Coulomb operator through tensor factorizations, enabling efficient block encodings of the Hamiltonian. A natural challenge of these methods is the degree to which block-encoding costs can be reduced. We address this challenge through the technique of spectral amplification, which magnifies the spectrum of the low-energy states of Hamiltonians that can be expressed as sums of squares. Spectral amplification enables estimating ground-state energies with significantly improved cost scaling in the block encoding normalization factor Λ to just 2 Λ E gap , where E gap ≪ Λ is the lowest energy of the sum-of-squares Hamiltonian. To achieve this, we show that sum-of-squares representations of the electronic structure Hamiltonian are efficiently computable by a family of classical simulation techniques that approximate the ground-state energy from below. In order to further optimize, we also develop a novel factorization that provides a trade-off between the two leading Coulomb integral factorization schemes—namely, double factorization and tensor hypercontraction—that when combined with spectral amplification yields a factor of 4 to 195 speedup over the state of the art in ground-state energy estimation for models of iron-sulfur complexes and a CO 2 -fixation catalyst.
We present a reduced-scaling auxiliary-field quantum Monte Carlo (AFQMC) framework designed for large molecular systems and ensembles, with or without coupling to optical cavities. Our approach leverages the natural block sparsity of the Cholesky decomposition (CD) of electron repulsion integrals in molecular ensembles and employs tensor hypercontraction (THC) to efficiently compress low-rank Cholesky blocks. By representing the Cholesky vectors in a mixed format, keeping high-rank blocks in block-sparse form and compressing low-rank blocks with THC, we reduce the scaling of exchange-energy evaluation from quartic to robust cubic in the number of molecular orbitals N, while lowering memory from cubic toward quadratic. Benchmark analyses on one-, two-, and three-dimensional molecular ensembles (up to ∼1,200 orbitals) show that (a) the number of nonzeros in Cholesky tensors grows linearly with system size across dimensions; (b) the average numerical rank increases sublinearly and does not saturate at these sizes; and (c) rank heterogeneity─some blocks nearly full rank and many low rank, naturally motivates the proposed mixed block sparsity and THC scheme for efficient calculation of exchange energy. We demonstrate that the mixed scheme yields cubic wall-time scaling with favorable prefactors and preserves AFQMC accuracy.