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

Symmetry-Adapted State Preparation for Quantum Chemistry on Fault-Tolerant Quantum Computers

Viktor Khinevich, Wataru Mizukami

quant-phSubmitted Jan 13, 2026• Announced Jan 14, 2026• 3 citations
arXivHTMLPDF

Abstract

We present systematic and resource-efficient constructions of continuous symmetry projectors, particularly $U(1)$ particle number and $SU(2)$ total spin, tailored for fault-tolerant quantum computations. Our approach employs a linear combination of unitaries (LCU) as well as generalized quantum signal processing (GQSP and GQSVT) to implement projectors. These projectors can then be coherently applied as state filters prior to quantum phase estimation (QPE). We analyze their asymptotic gate complexities for explicit circuit realizations. For the particle number and $S_z$ symmetries, GQSP offers favorable resource usage features owing to its low ancilla qubit requirements and robustness to finite precision rotation gate synthesis. For the total spin projection, the structured decomposition of $\hat{P}_{S,M_S}$ reduces the projector T gate count. Numerical simulations show that symmetry filtering substantially increases the QPE success probability, leading to a lower overall cost compared to that of unfiltered approaches across representative molecular systems. Resource estimates further indicate that the cost of symmetry filtering is $3$ to $4$ orders of magnitude lower than that of the subsequent phase estimation step This advantage is especially relevant in large, strongly correlated systems, such as FeMoco, a standard strongly correlated open-shell benchmark. For FeMoco, the QPE cost is estimated at ${\sim}10^{10}$ T gates, while our symmetry projector requires only ${\sim}10^{6}$--$10^{7}$ T gates. These results establish continuous-symmetry projectors as practical and scalable tools for state preparation in quantum chemistry and provide a pathway toward realizing more efficient fault-tolerant quantum simulations.

Related papers

Enabling Chemically Accurate Quantum Phase Estimation in the Early Fault-Tolerant Regime

Shota Kanasugi, Riki Toshio, Kazunori Maruyama +1 more

Quantum simulation of molecular electronic structure is one of the most promising applications of quantum computing. However, achieving chemically accurate predictions for strongly correlated systems requires quantum phase estimation (QPE) on fault-tolerant quantum computing (FTQC) devices. Existing resource estimates for typical FTQC architectures suggest that such calculations demand millions of physical qubits, thereby placing them beyond the reach of near-term devices. Here, we investigate the feasibility of performing QPE for chemically relevant molecular systems in an early-FTQC regime, characterized by partial fault tolerance, constrained qubit budgets, and limited circuit depth. Our framework is based on single-ancilla, Trotter-based QPE implementations combined with partially randomized time evolution. Within this framework, we develop a novel Hamiltonian optimization strategy, termed unitary weight concentration, that reduces algorithmic cost by reshaping linear-combination-of-unitaries representations. Applying this framework to active-space models of iron-sulfur clusters, cytochrome P450 active sites, and CO$_2$-utilization catalysts, we perform end-to-end resource estimation using the latest version of the space-time efficient analog rotation (STAR) architecture. Our results indicate that ground-state energy estimation for active spaces of approximately 20 to 50 spatial orbitals, well beyond the reach of classical full configuration interaction, is achievable using $\sim 10^5$ physical qubits, with runtimes on the order of days to weeks. These findings demonstrate that while full-fledged fault-tolerant quantum computers will be required for even larger molecular simulations, chemically meaningful quantum chemistry problems are already within reach in an experimentally relevant, early-FTQC regime.

quant-pharXiv:2603.22778•PRX Quantum•Mar 25, 2026•9 citations

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

Symmetry-preserving quantum compilation

Maryam Mudassar, Zhi-Yuan Wei, Alexander Schuckert +3 more

Fault-tolerant quantum simulation requires compiling symmetry-preserving time evolutions into discrete gate sets. Standard Clifford+T synthesis can break continuous symmetries even when the target evolution preserves them, causing compiled simulations to lose essential features of the original system. We develop a fault-tolerant compilation framework that preserves SU(2) symmetry exactly. We characterize the number-theoretic obstruction preventing symmetry-preserving unitary Clifford+T circuits from approximating arbitrary SU(2)-symmetric evolutions and circumvent it using measurement and feed-forward. The resulting synthesis confines compilation errors to the symmetry-preserving operator algebra rather than introducing symmetry-breaking perturbations. We demonstrate the algorithm by simulating transport in the one-dimensional Heisenberg model. At a lower matched T-count, for instance, 54 T gates per two-site Trotter step, standard synthesis yields an incorrect transport exponent, whereas our symmetry-preserving compilation reproduces the expected exponent for the same expected T-count. If instead each approach is allocated whatever resources are necessary to estimate this exponent to the same accuracy, our construction reduces the T-count by approximately a factor of five. We further extend the framework to gauge symmetries in lattice gauge theories and to particle-number and spin symmetries in fermionic models relevant to quantum chemistry and the Fermi-Hubbard model. These results show that symmetry-preserving fault-tolerant compilation can qualitatively change the effects of synthesis error while substantially reducing the resources required for quantum simulation.

quant-pharXiv:2610.03624•Oct 5, 2026•0 citations

Fault-tolerant simulation of the electronic structure using Projector Augmented-Waves and Bloch orbitals

Rishabh Bhardwaj, Alexander Reed Muñoz, Travis E. Jones +1 more

Strongly correlated materials are a natural target for fault-tolerant quantum computers, but they require tools beyond those developed for molecules. Electronic wavefunctions vary rapidly near nuclei yet remain delocalized across many unit cells, and bulk properties must be converged systematically with respect to finite-size errors. To resolve such issues, we present the Bloch--UPAW framework that combines Bloch-orbital $k$-space structure with unitary projector-augmented-wave (UPAW) augmentation. The UPAW Hamiltonian, expressed directly in the Bloch basis, retains explicit control of Brillouin-zone sampling, and incorporates near-nuclear physics through strictly local on-site corrections. The construction is independent of the underlying one-particle representation, so it applies to both plane-wave and localized bases, and it handles supercells for symmetry-breaking phenomena more efficiently. We derive a linear-combination-of-unitaries decomposition and a block-encoding circuit suitable for qubitization; UPAW augmentation adds one ancilla qubit and no Toffoli gates at leading order relative to a Bloch-only block encoding. Asymptotically, the Toffoli cost scales as $\mathcal{O}(N_k^3)$ when refining the $k$-mesh and as $\mathcal{O}(N_a^{3.5})$ when enlarging the supercell, enabling convergence to be steered by the most favorable route for a given material. Resource estimates for bulk diamond show approximately an order-of-magnitude reduction in Toffoli count relative to prior work on periodic solids.

quant-pharXiv:2604.12142•Physical Review Research•Apr 15, 2026•1 citation

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

Faster matrix product state preparation by exploiting symmetry-induced block-sparsity

Felix Rupprecht, Sabine Wölk

Matrix product states (MPS) serve as a key tool for studying quantum systems from chemistry and condensed-matter physics, making their preparation on quantum computers an important task in interfacing classical and quantum simulation. Many systems of interest have $U(1)$-symmetries induced by particle number and spin projection conservation, allowing to restrict the MPS tensors to be of block-sparse form, a property widely used in the implementation of classical algorithms such as the density matrix renormalization group. We reduce the cost of fault-tolerantly preparing block-sparse MPS within the standard ancilla-assisted linear-depth approach by implementing row and column permutations that transform the block-sparse matrices into block-diagonal form. These block-diagonal unitaries are then implemented via unitary synthesis, with the cost being determined by the size of the largest block. In this context, we modify the unitary synthesis approach of Berry et al. in order to reduce the Toffoli cost for real-valued unitaries by a factor of $\sqrt{2}$. In numerical benchmarks, we achieve Toffoli cost improvement factors of $10 - 30$ compared to the state-of-the-art for MPS of various molecular systems.

quant-pharXiv:2605.28489•May 28, 2026•4 citations
We present systematic and resource-efficient constructions of continuous symmetry projectors, particularly U(1)U(1)U(1) particle number and SU(2)SU(2)SU(2) total spin, tailored for fault-tolerant quantum computations. Our approach employs a linear combination of unitaries (LCU) as well as generalized quantum signal processing (GQSP and GQSVT) to implement projectors. These projectors can then be coherently applied as state filters prior to quantum phase estimation (QPE). We analyze their asymptotic gate complexities for explicit circuit realizations. For the particle number and SzS_zSz​ symmetries, GQSP offers favorable resource usage features owing to its low ancilla qubit requirements and robustness to finite precision rotation gate synthesis. For the total spin projection, the structured decomposition of P^S,MS\hat{P}_{S,M_S}P^S,MS​​ reduces the projector T gate count. Numerical simulations show that symmetry filtering substantially increases the QPE success probability, leading to a lower overall cost compared to that of unfiltered approaches across representative molecular systems. Resource estimates further indicate that the cost of symmetry filtering is 333 to 444 orders of magnitude lower than that of the subsequent phase estimation step This advantage is especially relevant in large, strongly correlated systems, such as FeMoco, a standard strongly correlated open-shell benchmark. For FeMoco, the QPE cost is estimated at ∼1010{\sim}10^{10}∼1010 T gates, while our symmetry projector requires only ∼106{\sim}10^{6}∼106--10710^{7}107 T gates. These results establish continuous-symmetry projectors as practical and scalable tools for state preparation in quantum chemistry and provide a pathway toward realizing more efficient fault-tolerant quantum simulations.
Quantum simulation of molecular electronic structure is one of the most promising applications of quantum computing. However, achieving chemically accurate predictions for strongly correlated systems requires quantum phase estimation (QPE) on fault-tolerant quantum computing (FTQC) devices. Existing resource estimates for typical FTQC architectures suggest that such calculations demand millions of physical qubits, thereby placing them beyond the reach of near-term devices. Here, we investigate the feasibility of performing QPE for chemically relevant molecular systems in an early-FTQC regime, characterized by partial fault tolerance, constrained qubit budgets, and limited circuit depth. Our framework is based on single-ancilla, Trotter-based QPE implementations combined with partially randomized time evolution. Within this framework, we develop a novel Hamiltonian optimization strategy, termed unitary weight concentration, that reduces algorithmic cost by reshaping linear-combination-of-unitaries representations. Applying this framework to active-space models of iron-sulfur clusters, cytochrome P450 active sites, and CO2_22​-utilization catalysts, we perform end-to-end resource estimation using the latest version of the space-time efficient analog rotation (STAR) architecture. Our results indicate that ground-state energy estimation for active spaces of approximately 20 to 50 spatial orbitals, well beyond the reach of classical full configuration interaction, is achievable using ∼105\sim 10^5∼105 physical qubits, with runtimes on the order of days to weeks. These findings demonstrate that while full-fledged fault-tolerant quantum computers will be required for even larger molecular simulations, chemically meaningful quantum chemistry problems are already within reach in an experimentally relevant, early-FTQC regime.
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.
Fault-tolerant quantum simulation requires compiling symmetry-preserving time evolutions into discrete gate sets. Standard Clifford+T synthesis can break continuous symmetries even when the target evolution preserves them, causing compiled simulations to lose essential features of the original system. We develop a fault-tolerant compilation framework that preserves SU(2) symmetry exactly. We characterize the number-theoretic obstruction preventing symmetry-preserving unitary Clifford+T circuits from approximating arbitrary SU(2)-symmetric evolutions and circumvent it using measurement and feed-forward. The resulting synthesis confines compilation errors to the symmetry-preserving operator algebra rather than introducing symmetry-breaking perturbations. We demonstrate the algorithm by simulating transport in the one-dimensional Heisenberg model. At a lower matched T-count, for instance, 54 T gates per two-site Trotter step, standard synthesis yields an incorrect transport exponent, whereas our symmetry-preserving compilation reproduces the expected exponent for the same expected T-count. If instead each approach is allocated whatever resources are necessary to estimate this exponent to the same accuracy, our construction reduces the T-count by approximately a factor of five. We further extend the framework to gauge symmetries in lattice gauge theories and to particle-number and spin symmetries in fermionic models relevant to quantum chemistry and the Fermi-Hubbard model. These results show that symmetry-preserving fault-tolerant compilation can qualitatively change the effects of synthesis error while substantially reducing the resources required for quantum simulation.
Strongly correlated materials are a natural target for fault-tolerant quantum computers, but they require tools beyond those developed for molecules. Electronic wavefunctions vary rapidly near nuclei yet remain delocalized across many unit cells, and bulk properties must be converged systematically with respect to finite-size errors. To resolve such issues, we present the Bloch--UPAW framework that combines Bloch-orbital kkk-space structure with unitary projector-augmented-wave (UPAW) augmentation. The UPAW Hamiltonian, expressed directly in the Bloch basis, retains explicit control of Brillouin-zone sampling, and incorporates near-nuclear physics through strictly local on-site corrections. The construction is independent of the underlying one-particle representation, so it applies to both plane-wave and localized bases, and it handles supercells for symmetry-breaking phenomena more efficiently. We derive a linear-combination-of-unitaries decomposition and a block-encoding circuit suitable for qubitization; UPAW augmentation adds one ancilla qubit and no Toffoli gates at leading order relative to a Bloch-only block encoding. Asymptotically, the Toffoli cost scales as O(Nk3)\mathcal{O}(N_k^3)O(Nk3​) when refining the kkk-mesh and as O(Na3.5)\mathcal{O}(N_a^{3.5})O(Na3.5​) when enlarging the supercell, enabling convergence to be steered by the most favorable route for a given material. Resource estimates for bulk diamond show approximately an order-of-magnitude reduction in Toffoli count relative to prior work on periodic solids.
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.
Matrix product states (MPS) serve as a key tool for studying quantum systems from chemistry and condensed-matter physics, making their preparation on quantum computers an important task in interfacing classical and quantum simulation. Many systems of interest have U(1)U(1)U(1)-symmetries induced by particle number and spin projection conservation, allowing to restrict the MPS tensors to be of block-sparse form, a property widely used in the implementation of classical algorithms such as the density matrix renormalization group. We reduce the cost of fault-tolerantly preparing block-sparse MPS within the standard ancilla-assisted linear-depth approach by implementing row and column permutations that transform the block-sparse matrices into block-diagonal form. These block-diagonal unitaries are then implemented via unitary synthesis, with the cost being determined by the size of the largest block. In this context, we modify the unitary synthesis approach of Berry et al. in order to reduce the Toffoli cost for real-valued unitaries by a factor of 2\sqrt{2}2​. In numerical benchmarks, we achieve Toffoli cost improvement factors of 10−3010 - 3010−30 compared to the state-of-the-art for MPS of various molecular systems.