Resource Estimation for VQE on Small Molecules: Impact of Fermion Mappings and Hamiltonian Reductions

Abstract

Accurate determination of ground-state energies for molecules remains a challenge in quantum chemistry and a cornerstone for progress in fields such as drug discovery and materials design. The Variational Quantum Eigensolver (VQE) represents a leading hybrid quantum-classical paradigm for addressing this challenge; however, its widespread realization is limited by noise and the restricted scalability of current quantum hardware. Achieving efficient simulations on Noisy Intermediate-Scale Quantum (NISQ) devices and forthcoming Fault-Tolerant Application-Scalable Quantum (FASQ) systems demands a detailed understanding of how computational resources scale with molecular complexity and fermion-to-qubit encodings. In this study, resource requirements for VQE implementations employing the Unitary Coupled Cluster Singles and Doubles (UCCSD) ansatz are systematically analyzed. The molecular Hamiltonian is formulated in second quantization and mapped to qubit operators through the Jordan-Wigner (JW), Bravyi-Kitaev (BK), and Parity (Pa) transformations. Hamiltonian reduction strategies, including ${\mathbb{Z}}_2$ tapering and frozen-core approximations, are examined to assess their effect on quantum resource scaling. The analysis reveals that appropriate transformations, when combined with symmetry-based reductions, can substantially reduce qubit counts by up to $\approx 50\%$ and quantum gate counts by up to $\approx 27.5\times$ and Hamiltonian Pauli string counts by up to $\approx 2.75\times$, relative to the corresponding unreduced Hamiltonian representations within the same active-space configuration for the representative set of molecular systems under study. These findings provide practical circuit-level insights for executing chemically relevant simulations on NISQ hardware, while establishing physical-resource baselines that may inform future logical-level analyses targeting FASQ systems.

arXiv comment41 pages, 4 figures. Major revision

References in corpus (38)

• Quantum entanglement
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A variational eigenvalue solver on a quantum processor
• Quantum algorithm for solving linear systems of equations
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• A Quantum Approximate Optimization Algorithm
• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• Simulated Quantum Computation of Molecular Energies
• Recent developments in the PySCF program package
• The Variational Quantum Eigensolver: a review of methods and best practices
• Fermionic quantum computation
• Scalable Quantum Simulation of Molecular Energies
• Quantum algorithms for quantum chemistry and quantum materials science
• Towards Practical Quantum Variational Algorithms
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Nuclear quantum effects in water
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• Quantum computing with Qiskit
• Tapering off qubits to simulate fermionic Hamiltonians
• Quantum delocalization of protons in the hydrogen bond network of an enzyme active site
• A comparison of the Bravyi-Kitaev and Jordan-Wigner transformations for the quantum simulation of quantum chemistry
• Reducing qubit requirements for quantum simulation using molecular point group symmetries
• Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
• A Compact Fermion to Qubit Mapping
• Symmetry-adapted variational quantum eigensolver
• Accuracy and Resource Estimations for Quantum Chemistry on a Near-term Quantum Computer
• Resource Estimation for Quantum Variational Simulations of the Hubbard Model
• The Bonsai algorithm: grow your own fermion-to-qubit mapping
• A Perspective on Quantum Computing Applications in Quantum Chemistry using 25--100 Logical Qubits
• A Quantum Computing Implementation of Nuclear-Electronic Orbital (NEO) Theory: Towards an Exact pre-Born-Oppenheimer Formulation of Molecular Quantum Systems
• Reducing Entanglement With Physically-Inspired Fermion-To-Qubit Mappings
• Ultrafast Hybrid Fermion-to-Qubit mapping
• Clifford circuit based heuristic optimization of fermion-to-qubit mappings
• Mind the gaps: The fraught road to quantum advantage
• HATT: Hamiltonian Adaptive Ternary Tree for Optimizing Fermion-to-Qubit Mapping
• Error-Mitigation Enabled Multicomponent Quantum Simulations Beyond the Born-Oppenheimer Approximation
• Quantum Advantage in Computational Chemistry?