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:2611.05603

Quantum resource trade-offs of mixed sparse single and double factorization for qubitization-based phase estimation

Troy Losey, J. Williams, Avanish Mishra, Jian-Xin Zhu, Yu Zhang

Published Nov 3, 2026• 0 citations
arXivHTMLPDF

Abstract

We study a mixed block encoding of quantum-chemistry Hamiltonians for quantum phase estimation (QPE) on fault-tolerant quantum computers. Following a Cholesky decomposition of the electron repulsion integral tensor, we assign each Cholesky tensor to either a double-factorization (DF) branch or a sparse-single-factorization (SPSF) branch. This freedom permits a trade-off between reducing the block-encoding normalization factor $λ$ with DF and reducing the coefficient data loaded through quantum read-only memory (QROM) with SPSF. Resource estimates across molecular benchmarks show, however, that the mixed circuit does not generally reduce the Toffoli count relative to the less expensive pure circuit. The main obstacles are the overhead of loading substantial data through separate branch-specific QROMs and the limited benefit of mixing when the pure DF and SPSF circuits have dissimilar costs. Modest savings occur only in restricted parameter regimes, most clearly when logical-qubit requirements are included in the cost metric. These results identify the circuit-level conditions that a useful mixed block encoding must satisfy.

DOI
10.48550/arxiv.2611.05603

Related papers

Reducing the Runtime of Fault-Tolerant Quantum Simulations in Chemistry through Symmetry-Compressed Double Factorization

Dario Rocca, Cristian L. Cortes, Jérôme F. Gonthier +7 more

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 CDF 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 sizable reduction of the Toffoli gate count in comparison to other variants of DF or even tensor hypercontraction, which is usually regarded as the most efficient approach for qubitization.

arXiv:2403.03502•Journal of Chemical Theory and Computation•May 24, 2024•38 citations

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

Konrad Deka, E. J. Zak

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.

arXiv:2412.01338•Journal of Chemical Theory and Computation•Apr 22, 2025•11 citations

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

Benchmarking quantum simulation of chemical Hamiltonians using the sorted-list encoding

Calvin Ku, Yu‐Cheng Chen, Alice Hu +1 more

Quantum phase estimation is a cornerstone algorithm for fault-tolerant quantum computation, especially for electronic structure calculations of chemical systems. Optimal simulation relies on a complex trade-offs across many parameters including Hamiltonian simulation techniques, basis sets, and the fermion-to-qubit encodings. Here, we characterize the trade-offs and quantify the quantum resource costs of the sorted-list encoding as a particle-conserving, low-qubit alternative to the Jordan-Wigner encoding. We identify specific regimes, across different simulation techniques and basis sets, where the sorted-list encoding would be favorable compared to existing methods. Our findings are further supported through numerical benchmarks of real-world chemical systems. We found the sorted-list encoding to be a viable alternative to the Jordan-Wigner encoding for the compact molecular orbital basis when the electron-filling ratio is low, which typically occurs when high-precision results are required. In the plane-wave basis, we found similar asymptotic gate and qubit scaling between the sorted-list and the first-quantized encoding, although the first-quantized encoding still retains lower constant factors.

arXiv:2510.01710•Physical Review Research•Jun 22, 2026•5 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

Halving the cost of QROM again via dense encoding

Danial Motlagh

Quantum read only memory (QROM) is a substantial source of non-Clifford cost in fault-tolerant quantum algorithms. Borrowing dirty qubits can reduce this cost, provided their unknown initial states are restored. We consider the practically relevant qubit-constrained regime, where limited workspace restricts the table-block size and table loading dominates the cost. For $N$ entries of $b$ bits and approximately $bλ$ dirty qubits, SelectSwap has leading Toffoli count $2N/λ$. Recent work using sequential bit packets reduces this to $(1+1/b)N/λ$. In this work we introduce a dense encoding construction of QROM, where two bits of classical information are stored in each dirty qubit instead of one by utilizing both the $Z$ and $X$ bases. On its own, dense encoding provides a $2\times$ improvement over SelectSwap by reducing the leading Toffoli count to $N/λ$. Combining it with sequential bit packets gives $\tfrac12(1+1/b)N/λ$, a further halving of the sequential construction's leading cost, and an approximately $4\times$ improvement over SelectSwap in the large-$N$ limit for practical values of $b$.

quant-pharXiv:2610.02321•Oct 5, 2026•1 citation
We study a mixed block encoding of quantum-chemistry Hamiltonians for quantum phase estimation (QPE) on fault-tolerant quantum computers. Following a Cholesky decomposition of the electron repulsion integral tensor, we assign each Cholesky tensor to either a double-factorization (DF) branch or a sparse-single-factorization (SPSF) branch. This freedom permits a trade-off between reducing the block-encoding normalization factor λλλ with DF and reducing the coefficient data loaded through quantum read-only memory (QROM) with SPSF. Resource estimates across molecular benchmarks show, however, that the mixed circuit does not generally reduce the Toffoli count relative to the less expensive pure circuit. The main obstacles are the overhead of loading substantial data through separate branch-specific QROMs and the limited benefit of mixing when the pure DF and SPSF circuits have dissimilar costs. Modest savings occur only in restricted parameter regimes, most clearly when logical-qubit requirements are included in the cost metric. These results identify the circuit-level conditions that a useful mixed block encoding must satisfy.
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 CDF 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 sizable reduction of the Toffoli gate count in comparison to other variants of DF or even tensor hypercontraction, which is usually regarded as the most efficient approach for qubitization.
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.
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.
Quantum phase estimation is a cornerstone algorithm for fault-tolerant quantum computation, especially for electronic structure calculations of chemical systems. Optimal simulation relies on a complex trade-offs across many parameters including Hamiltonian simulation techniques, basis sets, and the fermion-to-qubit encodings. Here, we characterize the trade-offs and quantify the quantum resource costs of the sorted-list encoding as a particle-conserving, low-qubit alternative to the Jordan-Wigner encoding. We identify specific regimes, across different simulation techniques and basis sets, where the sorted-list encoding would be favorable compared to existing methods. Our findings are further supported through numerical benchmarks of real-world chemical systems. We found the sorted-list encoding to be a viable alternative to the Jordan-Wigner encoding for the compact molecular orbital basis when the electron-filling ratio is low, which typically occurs when high-precision results are required. In the plane-wave basis, we found similar asymptotic gate and qubit scaling between the sorted-list and the first-quantized encoding, although the first-quantized encoding still retains lower constant factors.
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%.
Quantum read only memory (QROM) is a substantial source of non-Clifford cost in fault-tolerant quantum algorithms. Borrowing dirty qubits can reduce this cost, provided their unknown initial states are restored. We consider the practically relevant qubit-constrained regime, where limited workspace restricts the table-block size and table loading dominates the cost. For NNN entries of bbb bits and approximately bλbλbλ dirty qubits, SelectSwap has leading Toffoli count 2N/λ2N/λ2N/λ. Recent work using sequential bit packets reduces this to (1+1/b)N/λ(1+1/b)N/λ(1+1/b)N/λ. In this work we introduce a dense encoding construction of QROM, where two bits of classical information are stored in each dirty qubit instead of one by utilizing both the ZZZ and XXX bases. On its own, dense encoding provides a 2×2\times2× improvement over SelectSwap by reducing the leading Toffoli count to N/λN/λN/λ. Combining it with sequential bit packets gives 12(1+1/b)N/λ\tfrac12(1+1/b)N/λ21​(1+1/b)N/λ, a further halving of the sequential construction's leading cost, and an approximately 4×4\times4× improvement over SelectSwap in the large-NNN limit for practical values of bbb.