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

• URL: http://arxiv.org/abs/2601.08533v1
• Date: Tue, 13 Jan 2026 13:17:59 GMT
• Title: Symmetry-Adapted State Preparation for Quantum Chemistry on Fault-Tolerant Quantum Computers
• Abstract summary: We present a systematic and resource-efficient construction of continuous symmetry projectors for fault-tolerant quantum computations.<n>For the particle number and $S_z$ symmetries, GQSP offers favorable resource usage features owing to its low ancilla qubit requirements.<n>For the total spin projection, the structured decomposition of $hatP_S,M_S$ reduces the projector T gate count.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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

• Predicting Multipartite Entanglement in Quantum Circuits using Transformer [0.11242503819703259]
  Multipartite entanglement is a critical property of parameterized quantum circuits (PQCs)<n>We introduce a graph-based transformer surrogate that predicts both the first-order Meyer-Wallach measure ($Q$) and the second-order Scott measure ($Q$)<n>Our central contribution is the qubit-interconnected graph (QIG) encoding for transformers, where each node represents a qubit and weighted adjacencies record entangling-gate multiplicities.
  arXiv  Detail & Related papers  (2026-08-28T07:00:20Z)
• SpinGQE: A Generative Quantum Eigensolver for Spin Hamiltonians [42.007194397302825]
  Ground state search is central to quantum computing.<n>We present SpinGQE, an extension of the Generative Quantum Eigensolver framework to spin Hamiltonians.<n>We employ a transformer-based decoder to learn over quantum circuits that produce low-energy states.
  arXiv  Detail & Related papers  (2026-03-25T13:38:15Z)
• Performance Guarantees for Quantum Neural Estimation of Entropies [31.955071410400947]
  Quantum neural estimators (QNEs) combine classical neural networks with parametrized quantum circuits.<n>We study formal guarantees for QNEs of measured relative entropies in the form of non-asymptotic error risk bounds.<n>Our theory aims to facilitate principled implementation of QNEs for measured relative entropies.
  arXiv  Detail & Related papers  (2025-11-24T16:36:06Z)
• Benchmarking Quantum Simulation Methods [8.088728237481323]
  Quantum Phase Estimation is a cornerstone algorithm for fault-tolerant quantum computation.<n>We quantify the impact of three key parameters on the overall quantum resource costs for the QPE algorithm.
  arXiv  Detail & Related papers  (2025-10-02T06:35:57Z)
• Restricting to the chip architecture maintains the quantum neural network accuracy [0.0]
  variational quantum algorithms (VQAs) are a prominent strategy for constructing quantum machine learning models. This article aims to address several critical questions, such as determining the optimal gate sequence, efficient parameter optimization strategies, and understanding the influence of quantum chip architectures on the final results.
  arXiv  Detail & Related papers  (2022-12-29T18:57:05Z)
• SnCQA: A hardware-efficient equivariant quantum convolutional circuit architecture [11.404166974371197]
  SnCQA is a set of hardware-efficient variational circuits of equivariant quantum convolutional circuits. Our quantum neural networks are suitable for solving machine learning problems where permutation symmetries are present.
  arXiv  Detail & Related papers  (2022-11-23T05:16:26Z)
• Error Mitigation-Aided Optimization of Parameterized Quantum Circuits: Convergence Analysis [42.275148861039895]
  Variational quantum algorithms (VQAs) offer the most promising path to obtaining quantum advantages via noisy processors. gate noise due to imperfections and decoherence affects the gradient estimates by introducing a bias. Quantum error mitigation (QEM) techniques can reduce the estimation bias without requiring any increase in the number of qubits. QEM can reduce the number of required iterations, but only as long as the quantum noise level is sufficiently small.
  arXiv  Detail & Related papers  (2022-09-23T10:48:04Z)
• Symmetric Pruning in Quantum Neural Networks [111.438286016951]
  Quantum neural networks (QNNs) exert the power of modern quantum machines. QNNs with handcraft symmetric ansatzes generally experience better trainability than those with asymmetric ansatzes. We propose the effective quantum neural tangent kernel (EQNTK) to quantify the convergence of QNNs towards the global optima.
  arXiv  Detail & Related papers  (2022-08-30T08:17:55Z)
• Analytical and experimental study of center line miscalibrations in M\o lmer-S\o rensen gates [51.93099889384597]
  We study a systematic perturbative expansion in miscalibrated parameters of the Molmer-Sorensen entangling gate. We compute the gate evolution operator which allows us to obtain relevant key properties. We verify the predictions from our model by benchmarking them against measurements in a trapped-ion quantum processor.
  arXiv  Detail & Related papers  (2021-12-10T10:56:16Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Resource-Optimized Fermionic Local-Hamiltonian Simulation on Quantum Computer for Quantum Chemistry [6.361119478712919]
  We present a framework that enables bootstrapping the VQE progression towards the convergence of the ground-state energy of the fermionic system. We show that resource-requirement savings of up to more than $20%$, in small instances, is possible.
  arXiv  Detail & Related papers  (2020-04-08T17:59:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.