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

Quantum computational chemistry methods for early-stage quantum computers

Yordan S. Yordanov

Published Jul 26, 2021• 1 citation
Publisher

Abstract

One of the first practical applications of quantum computers is expected to be molecular modelling. Performing this task would profoundly affect areas such as chemistry, materials science and drug synthesis. Modelling of molecules, which are classically intractable, can be achieved with just over $30$ qubits, whereas state of the art quantum computers already have more than $50$ qubits. The Variational Quantum Eigensolver (VQE) algorithm and VQE based protocols, are promising candidates to enable this task on emerging Noisy Intermediate-Scale Quantum (NISQ) computers. These protocols require short quantum circuits and short coherence times, and are particularly resilient to quantum errors. Nevertheless, there is still a significant gap between the accuracy and the coherence times of current NISQ computers, and the hardware requirements of VQE protocols to simulate practically interesting molecules. In this thesis, I present my contribution to narrowing this gap by developing VQE protocols for molecular modelling that are less demanding on quantum hardware. The VQE relies on the Rayleigh-Ritz variational principle to estimate the eigenvalues of a Hamiltonian operator, by minimizing its expectation value with respect to a trial quantum state, prepared by an ansatz. A major challenge for the practical realisation of VQE protocols on NISQ computers is to construct an ansatz that: (1) can accurately approximate the eigenstates of the Hamiltonian; (2) is easy to optimize; and (3) can be implemented by a shallow circuit, within the capabilities of a NISQ computer. The most widely used, unitary coupled cluster (UCC), type of ans\"atze mathematically correspond to a product of unitary evolutions of fermionic excitation operators. Owing to their fermionic structure, UCC ans\"atze preserve the symmetries of electronic wavefunctions, and thus are accurate and easy to optimize. Nevertheless, UCC ans\"atze are implemented by high depth circuits, which severely limit the size of the molecules that can be reliably simulated on NISQ computers. In this thesis, I begin by constructing efficient quantum circuits to perform evolutions of fermionic excitation operators. The circuits are optimized in the number of two-qubit entangling gates, which are the current bottleneck of NISQ computers. Compared to the standard circuits used to implement evolutions of fermionic excitation operators, the circuits derived in this thesis reduce the number of two-qubit entangling gates by more than $70\%$ on average. As an intermediate result, I also derive efficient circuits to perform evolutions of qubit excitation operators (excitation operators that account for qubit, rather than fermionic commutation relations). Even with the fermionic-excitation-evolution circuits derived here, UCC ans\"atze still require very long circuits, with a particularly large number of two-qubit entangling gates. In this thesis, I consider the use of alternative VQE ans\"atze, based on evolutions of qubit excitation operators. Due to not accounting for fermionic anticommutation, evolutions of qubit excitation operators can be performed by circuits that require asymptotically fewer two-qubit entangling gates. Furthermore, qubit excitation operators preserve many of the physical properties of fermionic excitation operators. Performing a number of classical numerical VQE simulations for small molecules, I show that qubit-excitation-based ans\"atze can approximate molecular electronic wavefunctions almost as accurately as fermionic-excitation-based ans\"atze. Hence, I argue that evolutions of qubit excitation operators are more suitable to construct molecular ans\"atze than evolutions of fermionic excitation operators, especially in the era of NISQ computers. Motivated by the advantage of qubit-excitation-based ans\"atze, I introduce the qubit-excitation-based adaptive variational quantum eigensolver (QEB-ADAPT-VQE). The QEB-ADAPT-VQE belongs to a family of ADAPT-VQE protocols for molecular modelling that grow a problem-tailored ansatz by iteratively appending unitary operators sampled from a predefined finite-size pool of operators. The operator at each iteration is sampled based on an ansatz-growing strategy, which aims to achieve the lowest estimate for the Hamiltonian expectation value at each iteration. In this way, ADAPT-VQE protocols construct shallow-circuit, few-parameter ans\"atze tailored specifically to the molecular systems of interest. In the case of the QEB-ADAPT-VQE, the operator pool is defined by a set of evolutions of single and double qubit excitation operators. I benchmark the performance of the QEB-ADAPT-VQE, by performing classical numerical simulations. I demonstrate that it can construct ans\"atze that are several orders of magnitude more accurate, and require significantly shallower circuits, than standard UCC ans\"atze. I also compare the QEB-ADAPT-VQE against the original fermionic-ADAPT-VQE, which utilizes a pool of fermionic excitation evolutions, and the qubit-ADAPT-VQE, which utilizes a pool of Pauli-string evolutions. I demonstrate that, in terms of circuit efficiency and convergence speed, the QEB-ADAPT-VQE systematically outperforms the qubit-ADAPT-VQE, which to my knowledge was the previous most circuit-efficient, scalable VQE protocol for molecular modeling. The QEB-ADAPT-VQE protocol, therefore represents a significant improvement in the field of VQE protocols for molecular modelling and brings us closer to achieving practical quantum advantage. Lastly, I outline a modified version of the QEB-ADAPT-VQE, the excited-QEB-ADAPT-VQE, designed to estimate energies of excited molecular states. The excited-QEB-ADAPT-VQE is more robust to initial simulation conditions, at the expense of increased computational complexity.

DOI
10.17863/cam.77549

Related papers

Quantum-computational chemistry in noisy intermediate-scale quantum era: TenCirChem and its application

Zirui Sheng, Weitang Li, Zhigang Shuai

Quantum computing has emerged as a transformative approach for tackling complex problems in quantum chemistry, particularly in simulating multielectron systems and electron-phonon interactions. However, the current noisy intermediate-scale quantum (NISQ) devices face significant challenges in implementing practical quantum algorithms due to error accumulation caused by increased circuit depth, qubit counts, and gate operations. To address these challenges, we present TenCirChem, an open-source Python package specifically designed for implementing variational quantum algorithms in quantum computational chemistry. TenCirChem demonstrates exceptional performance in simulating unitary coupled-cluster circuits through its innovative use of compact representations for quantum states and excitation operators. This package supports noisy circuit simulation and provides advanced algorithms for variational quantum dynamics, enabling researchers to explore complex chemical phenomena. Its capabilities are exemplified in various applications, including the calculation of potential energy curves and the investigation of quantum gate error impacts on molecular systems. Moreover, TenCirChem’s seamless integration with real quantum hardware makes it a versatile tool for both simulation and experimentation. A key innovation developed within the TenCirChem framework is the Clifford-based Hamiltonian engineering approach for molecules (CHEM). This algorithm addresses the critical challenge of achieving chemical accuracy with shallow quantum circuits, a fundamental requirement for practical applications on NISQ devices. CHEM employs a sophisticated Clifford-based Hamiltonian transformation that operates within the variational quantum eigensolver (VQE) framework using hardware-efficient ansatz. The method ensures four crucial advantages: (1) generation of initial circuit parameters corresponding to Hartree-Fock energy, (2) maximization of initial energy gradients with respect to circuit parameters, (3) minimal classical processing overhead without additional quantum resource requirements, and (4) compatibility with any circuit topology. Through quantum hardware emulator demonstrations, CHEM has achieved chemical accuracy for systems up to 12 qubits with fewer than 30 two-qubit gates, representing a significant advancement in practical quantum computational chemistry. To enhance the efficiency of variational quantum algorithms, we developed the sequential optimization with approximate parabola (SOAP) method, specifically designed for parameter optimization in unitary coupled-cluster ansatz. SOAP addresses the critical bottleneck of measurement requirements in VQE by implementing an innovative optimization strategy that approximates the energy landscape as quadratic functions. This approach minimizes the number of energy evaluations while incorporating parameter correlations through the integration of average directions from previous iterations. Benchmark studies demonstrate SOAP’s superior performance, showing faster convergence and enhanced noise robustness compared to traditional optimization methods. The method’s scalability has been validated through numerical simulations of up to 20 qubits, and its practical efficacy has been confirmed through experiments on superconducting quantum computers. For simulating electron-phonon systems, we introduce a variational basis state encoding algorithm that significantly reduces resource requirements compared to conventional unary and binary encoding schemes. Our approach achieves smaller scaling than traditional methods for qubits and gates for systems obeying the area law of entanglement entropy, this remarkable reduction in resource requirements comes at the cost of a constant amount of additional measurements. The algorithm’s effectiveness has been validated through both numerical simulations and quantum hardware experiments, demonstrating that using just one or two qubits per phonon mode can produce quantitatively accurate results across various coupling regimes. The integration of these innovations within the TenCirChem library represents a significant advancement in quantum computational chemistry. The software package provides researchers with a comprehensive toolkit for developing, testing, and implementing quantum algorithms, while the novel methods address fundamental challenges in circuit depth, parameter optimization, and resource efficiency. These developments collectively enhance the practicality of quantum computing for addressing real-world chemical problems in the NISQ era, offering improved accuracy, efficiency, and noise robustness.

Chinese Science Bulletin (Chinese Version)•Feb 19, 2025•1 citation

Qubit-excitation-based adaptive variational quantum eigensolver

Yordan S. Yordanov, V. Armaos, Crispin H. W. Barnes +1 more

Abstract Molecular simulations with the variational quantum eigensolver (VQE) are a promising application for emerging noisy intermediate-scale quantum computers. Constructing accurate molecular ansatze that are easy to optimize and implemented by shallow quantum circuits is crucial for the successful implementation of such simulations. Ansatze are, generally, constructed as series of fermionic-excitation evolutions. Instead, we demonstrate the usefulness of constructing ansatze with ``qubit-excitation evolutions', which, contrary to fermionic excitation evolutions, obey ``qubit commutation relations'. We show that qubit excitation evolutions, despite the lack of some of the physical features of fermionic excitation evolutions, accurately construct ansatze, while requiring asymptotically fewer gates. Utilizing qubit excitation evolutions, we introduce the iterative qubit excitation based VQE (IQEB-VQE) algorithm. The IQEB-VQE performs molecular simulations using a problem-tailored ansatz, grown iteratively by appending evolutions of single and double qubit excitation operators. By performing numerical simulations for small molecules, we benchmark the IQEB-VQE, and compare it against other competitive VQE algorithms. In terms of circuit efficiency and time complexity, we find that the IQEB-VQE systematically outperforms the previously most circuit-efficient, practically scalable VQE algorithms.

arXiv:2011.10540•Communications Physics•Oct 14, 2021•145 citations

Variational Quantum Information Processing

Jhonathan Romero Fontalvo

Traditional quantum algorithms with guaranteed performance generally require fully coherent quantum computers to operate, making error-correction a necessity. In contrast, variational quantum algorithms seek to remove this requirement by formulating the computation as the approximate optimization of a functional. This optimization is carried out in the space of heuristic functions defined by a parameterized (variational) quantum circuit. Taking advantage of the flexibility in the definition of these heuristics, we can expand the operability of variational algorithms within the regime of coherence times of noisy intermediate-scale quantum devices, avoiding the necessity of error-correction. In this dissertation, we present the application of the variational quantum computing approach to problems in quantum simulation, quantum state preparation, quantum error-correction, and generative modeling.\nIn the first part, we investigate the use of the variational quantum eigensolver (VQE) for simulating the ground state of fermionic systems. We start by studying the implementation of VQE using the unitary coupled cluster (UCC) ansatz and propose strategies to reduce its cost. We use these insights to carry out some of the first experimental quantum computations of molecular energies using simplified versions of this ansatz. We also propose an extension of UCC to study problems in condensed matter physics, along with a new low-depth circuit ansatz for preparing non-gaussian fermionic states on quantum computers. We show the potential of our approach to describe strongly correlated fermionic systems.\nIn the second part, we develop three new variational quantum algorithms for problems in quantum computing and machine learning, namely: 1) the quantum autoencoder, to compress ensembles of quantum states, 2) the variational quantum error corrector, to find device-tailored quantum encoding and recovery circuits for quantum error correction, and 3) the variational quantum generator, to generate classical probability distributions. These techniques offer efficient ways to design new quantum circuits for state preparation, to find more effective error-correcting codes and to perform generative modeling with quantum computers. Our work provides insights into the design of variational quantum algorithms and establishes practical guidelines to implement these methods on near-term quantum computers, as well as some future research directions for this field.

•May 8, 2019•1 citation

Efficient quantum circuits for quantum computational chemistry

Yordan S. Yordanov, David R. M. Arvidsson-Shukur, C. H. W. Barnes

Molecular quantum simulations with the variational quantum eigensolver (VQE) rely on ansatz states that approximate the molecular ground states. These ansatz states are generally defined by parametrized fermionic excitation operators and an initial reference state. Efficient ways to perform fermionic excitations are vital for the realization of the VQE on noisy intermediate-scale quantum computers. Here, we address this issue by first demonstrating circuits that perform qubit excitations, excitations that do not account for fermionic anticommutation relations. We then extend the functionality of these circuits to perform fermionic excitations. Compared to circuits constructed with the standard use of ``$CNOT$ staircases'', our circuits offer a linear reduction in the number of $CNOT$ gates, by a factor of 2 (8) per single (double) qubit or fermionic excitation, respectively. Our results reduce the requirements for near-term realizations of quantum molecular simulations.

arXiv:2005.14475•Physical Review A•Dec 21, 2020•106 citations

Prediction of Molecular Structures and Properties by Using Quantum Technology

Ravuri Krishna

Accurate prediction of molecular structures and properties is vital for chemistry; materials science, and drug discovery, yet classical electronic-structure methods often fail for strongly correlated systems, large basis sets, and complex potential-energy landscapes. Quantum technology encompassing quantum computing, quantum machine learning, and hybrid quantum classical strategies offers a fundamentally new paradigm by encoding many-electron wave functions directly on qubits and exploiting superposition and entanglement to explore exponentially large Hilbert spaces. This review synthesizes recent algorithmic and hardware advances relevant to molecular modelling, including the Variational Quantum Eigensolver (VQE), Quantum Phase Estimation (QPE), quantum unitary coupled-cluster (q-UCC) families, equation-of-motion and subspace methods for excited states, tensor-network hybrids, and quantum kernel and variational QML approaches. We examine noise-aware hybrid workflows, error-mitigation techniques, symmetry-preserving ansätze, and operator-factorization methods that reduce measurement and gate overhead. Representative applications are discussed: ground- and excited-state energy prediction, potential-energy surface mapping, geometry and transition-state optimization, spectroscopic property estimation (IR, UV–Vis, NMR, EPR), and reaction-dynamics scenarios where non-adiabatic effects and conical intersections dominate. Resource estimates and scaling analyses clarify current NISQ limitations qubit counts, circuit depth, shot complexity and delineate the roadmap to fault-tolerant QPE for chemical accuracy. We compare quantum approaches with classical baselines (DFT, CCSD (T), multireference methods), identifying domains where quantum methods already show promise (strong correlation, multi-reference dissociation, spin-state ordering) and where classical methods remain competitive. Finally, we highlight near-term industrial opportunities in drug design, catalysis, CO2 capture, and energy materials, and outline critical research directions: algorithmic reductions in measurement/precision cost, hardware improvements in fidelity and connectivity, scalable ansatz design, and integrated software stacks for reproducible hybrid simulations. Together, these developments indicate that while practical, large-scale quantum advantage for general chemistry remains future work, quantum technologies are rapidly maturing into powerful tools for targeted molecular problems that are intractable with existing classical techniques.

American Journal of Physical Chemistry•Dec 31, 2025•0 citations

The influence of basis sets and ansatze building to quantum computing in chemistry

Caio Moraes Porto, Rene Alfonso Nome, Nelson H. Morgon

Abstract Quantum computing is an exciting area, which has grown at an astonishing rate in the last decade. It is specially promising for the computational and theoretical chemistry area. One algorithm has received a lot of attention lately, the variational quantum eigensolver (VQE). Is is used to solve electronic structure problems and it is suitable to the noisy intermediate-scale quantum (NISQ) hardware. VQE calculations require ansatze and one of the most known is the unitary coupled-cluster (UCC). It uses the chosen basis set to generate a circuit which will be iteratively minimized. The present work investigates the circuit depth as a function of basis sets and molecular size. It has been shown that for the current quantum devices, only the smallest molecules and basis sets are tractable. The H2 molecule with the cc-pVTZ and aug-cc-pVTZ basis sets have circuit depths in the order of 106 to 107 gates and the C2H6 molecule with 3-21G basis set has a circuit depth of 2.2 ×108 gates. At the same time the analysis demonstrate that the H2 molecule with STO-3G basis set, requires at least 500 shots to reduce the error and that, although error mitigation schemes can diminish the error, they were not able to completely negate it.

Journal of Molecular Modeling•Jul 19, 2024•1 citation
One of the first practical applications of quantum computers is expected to be molecular modelling. Performing this task would profoundly affect areas such as chemistry, materials science and drug synthesis. Modelling of molecules, which are classically intractable, can be achieved with just over 303030 qubits, whereas state of the art quantum computers already have more than 505050 qubits. The Variational Quantum Eigensolver (VQE) algorithm and VQE based protocols, are promising candidates to enable this task on emerging Noisy Intermediate-Scale Quantum (NISQ) computers. These protocols require short quantum circuits and short coherence times, and are particularly resilient to quantum errors. Nevertheless, there is still a significant gap between the accuracy and the coherence times of current NISQ computers, and the hardware requirements of VQE protocols to simulate practically interesting molecules. In this thesis, I present my contribution to narrowing this gap by developing VQE protocols for molecular modelling that are less demanding on quantum hardware. The VQE relies on the Rayleigh-Ritz variational principle to estimate the eigenvalues of a Hamiltonian operator, by minimizing its expectation value with respect to a trial quantum state, prepared by an ansatz. A major challenge for the practical realisation of VQE protocols on NISQ computers is to construct an ansatz that: (1) can accurately approximate the eigenstates of the Hamiltonian; (2) is easy to optimize; and (3) can be implemented by a shallow circuit, within the capabilities of a NISQ computer. The most widely used, unitary coupled cluster (UCC), type of ans"atze mathematically correspond to a product of unitary evolutions of fermionic excitation operators. Owing to their fermionic structure, UCC ans"atze preserve the symmetries of electronic wavefunctions, and thus are accurate and easy to optimize. Nevertheless, UCC ans"atze are implemented by high depth circuits, which severely limit the size of the molecules that can be reliably simulated on NISQ computers. In this thesis, I begin by constructing efficient quantum circuits to perform evolutions of fermionic excitation operators. The circuits are optimized in the number of two-qubit entangling gates, which are the current bottleneck of NISQ computers. Compared to the standard circuits used to implement evolutions of fermionic excitation operators, the circuits derived in this thesis reduce the number of two-qubit entangling gates by more than 70%70\%70% on average. As an intermediate result, I also derive efficient circuits to perform evolutions of qubit excitation operators (excitation operators that account for qubit, rather than fermionic commutation relations). Even with the fermionic-excitation-evolution circuits derived here, UCC ans"atze still require very long circuits, with a particularly large number of two-qubit entangling gates. In this thesis, I consider the use of alternative VQE ans"atze, based on evolutions of qubit excitation operators. Due to not accounting for fermionic anticommutation, evolutions of qubit excitation operators can be performed by circuits that require asymptotically fewer two-qubit entangling gates. Furthermore, qubit excitation operators preserve many of the physical properties of fermionic excitation operators. Performing a number of classical numerical VQE simulations for small molecules, I show that qubit-excitation-based ans"atze can approximate molecular electronic wavefunctions almost as accurately as fermionic-excitation-based ans"atze. Hence, I argue that evolutions of qubit excitation operators are more suitable to construct molecular ans"atze than evolutions of fermionic excitation operators, especially in the era of NISQ computers. Motivated by the advantage of qubit-excitation-based ans"atze, I introduce the qubit-excitation-based adaptive variational quantum eigensolver (QEB-ADAPT-VQE). The QEB-ADAPT-VQE belongs to a family of ADAPT-VQE protocols for molecular modelling that grow a problem-tailored ansatz by iteratively appending unitary operators sampled from a predefined finite-size pool of operators. The operator at each iteration is sampled based on an ansatz-growing strategy, which aims to achieve the lowest estimate for the Hamiltonian expectation value at each iteration. In this way, ADAPT-VQE protocols construct shallow-circuit, few-parameter ans"atze tailored specifically to the molecular systems of interest. In the case of the QEB-ADAPT-VQE, the operator pool is defined by a set of evolutions of single and double qubit excitation operators. I benchmark the performance of the QEB-ADAPT-VQE, by performing classical numerical simulations. I demonstrate that it can construct ans"atze that are several orders of magnitude more accurate, and require significantly shallower circuits, than standard UCC ans"atze. I also compare the QEB-ADAPT-VQE against the original fermionic-ADAPT-VQE, which utilizes a pool of fermionic excitation evolutions, and the qubit-ADAPT-VQE, which utilizes a pool of Pauli-string evolutions. I demonstrate that, in terms of circuit efficiency and convergence speed, the QEB-ADAPT-VQE systematically outperforms the qubit-ADAPT-VQE, which to my knowledge was the previous most circuit-efficient, scalable VQE protocol for molecular modeling. The QEB-ADAPT-VQE protocol, therefore represents a significant improvement in the field of VQE protocols for molecular modelling and brings us closer to achieving practical quantum advantage. Lastly, I outline a modified version of the QEB-ADAPT-VQE, the excited-QEB-ADAPT-VQE, designed to estimate energies of excited molecular states. The excited-QEB-ADAPT-VQE is more robust to initial simulation conditions, at the expense of increased computational complexity.
Quantum computing has emerged as a transformative approach for tackling complex problems in quantum chemistry, particularly in simulating multielectron systems and electron-phonon interactions. However, the current noisy intermediate-scale quantum (NISQ) devices face significant challenges in implementing practical quantum algorithms due to error accumulation caused by increased circuit depth, qubit counts, and gate operations. To address these challenges, we present TenCirChem, an open-source Python package specifically designed for implementing variational quantum algorithms in quantum computational chemistry. TenCirChem demonstrates exceptional performance in simulating unitary coupled-cluster circuits through its innovative use of compact representations for quantum states and excitation operators. This package supports noisy circuit simulation and provides advanced algorithms for variational quantum dynamics, enabling researchers to explore complex chemical phenomena. Its capabilities are exemplified in various applications, including the calculation of potential energy curves and the investigation of quantum gate error impacts on molecular systems. Moreover, TenCirChem’s seamless integration with real quantum hardware makes it a versatile tool for both simulation and experimentation. A key innovation developed within the TenCirChem framework is the Clifford-based Hamiltonian engineering approach for molecules (CHEM). This algorithm addresses the critical challenge of achieving chemical accuracy with shallow quantum circuits, a fundamental requirement for practical applications on NISQ devices. CHEM employs a sophisticated Clifford-based Hamiltonian transformation that operates within the variational quantum eigensolver (VQE) framework using hardware-efficient ansatz. The method ensures four crucial advantages: (1) generation of initial circuit parameters corresponding to Hartree-Fock energy, (2) maximization of initial energy gradients with respect to circuit parameters, (3) minimal classical processing overhead without additional quantum resource requirements, and (4) compatibility with any circuit topology. Through quantum hardware emulator demonstrations, CHEM has achieved chemical accuracy for systems up to 12 qubits with fewer than 30 two-qubit gates, representing a significant advancement in practical quantum computational chemistry. To enhance the efficiency of variational quantum algorithms, we developed the sequential optimization with approximate parabola (SOAP) method, specifically designed for parameter optimization in unitary coupled-cluster ansatz. SOAP addresses the critical bottleneck of measurement requirements in VQE by implementing an innovative optimization strategy that approximates the energy landscape as quadratic functions. This approach minimizes the number of energy evaluations while incorporating parameter correlations through the integration of average directions from previous iterations. Benchmark studies demonstrate SOAP’s superior performance, showing faster convergence and enhanced noise robustness compared to traditional optimization methods. The method’s scalability has been validated through numerical simulations of up to 20 qubits, and its practical efficacy has been confirmed through experiments on superconducting quantum computers. For simulating electron-phonon systems, we introduce a variational basis state encoding algorithm that significantly reduces resource requirements compared to conventional unary and binary encoding schemes. Our approach achieves smaller scaling than traditional methods for qubits and gates for systems obeying the area law of entanglement entropy, this remarkable reduction in resource requirements comes at the cost of a constant amount of additional measurements. The algorithm’s effectiveness has been validated through both numerical simulations and quantum hardware experiments, demonstrating that using just one or two qubits per phonon mode can produce quantitatively accurate results across various coupling regimes. The integration of these innovations within the TenCirChem library represents a significant advancement in quantum computational chemistry. The software package provides researchers with a comprehensive toolkit for developing, testing, and implementing quantum algorithms, while the novel methods address fundamental challenges in circuit depth, parameter optimization, and resource efficiency. These developments collectively enhance the practicality of quantum computing for addressing real-world chemical problems in the NISQ era, offering improved accuracy, efficiency, and noise robustness.
Abstract Molecular simulations with the variational quantum eigensolver (VQE) are a promising application for emerging noisy intermediate-scale quantum computers. Constructing accurate molecular ansatze that are easy to optimize and implemented by shallow quantum circuits is crucial for the successful implementation of such simulations. Ansatze are, generally, constructed as series of fermionic-excitation evolutions. Instead, we demonstrate the usefulness of constructing ansatze with ``qubit-excitation evolutions', which, contrary to fermionic excitation evolutions, obey ``qubit commutation relations'. We show that qubit excitation evolutions, despite the lack of some of the physical features of fermionic excitation evolutions, accurately construct ansatze, while requiring asymptotically fewer gates. Utilizing qubit excitation evolutions, we introduce the iterative qubit excitation based VQE (IQEB-VQE) algorithm. The IQEB-VQE performs molecular simulations using a problem-tailored ansatz, grown iteratively by appending evolutions of single and double qubit excitation operators. By performing numerical simulations for small molecules, we benchmark the IQEB-VQE, and compare it against other competitive VQE algorithms. In terms of circuit efficiency and time complexity, we find that the IQEB-VQE systematically outperforms the previously most circuit-efficient, practically scalable VQE algorithms.
Traditional quantum algorithms with guaranteed performance generally require fully coherent quantum computers to operate, making error-correction a necessity. In contrast, variational quantum algorithms seek to remove this requirement by formulating the computation as the approximate optimization of a functional. This optimization is carried out in the space of heuristic functions defined by a parameterized (variational) quantum circuit. Taking advantage of the flexibility in the definition of these heuristics, we can expand the operability of variational algorithms within the regime of coherence times of noisy intermediate-scale quantum devices, avoiding the necessity of error-correction. In this dissertation, we present the application of the variational quantum computing approach to problems in quantum simulation, quantum state preparation, quantum error-correction, and generative modeling.\nIn the first part, we investigate the use of the variational quantum eigensolver (VQE) for simulating the ground state of fermionic systems. We start by studying the implementation of VQE using the unitary coupled cluster (UCC) ansatz and propose strategies to reduce its cost. We use these insights to carry out some of the first experimental quantum computations of molecular energies using simplified versions of this ansatz. We also propose an extension of UCC to study problems in condensed matter physics, along with a new low-depth circuit ansatz for preparing non-gaussian fermionic states on quantum computers. We show the potential of our approach to describe strongly correlated fermionic systems.\nIn the second part, we develop three new variational quantum algorithms for problems in quantum computing and machine learning, namely: 1) the quantum autoencoder, to compress ensembles of quantum states, 2) the variational quantum error corrector, to find device-tailored quantum encoding and recovery circuits for quantum error correction, and 3) the variational quantum generator, to generate classical probability distributions. These techniques offer efficient ways to design new quantum circuits for state preparation, to find more effective error-correcting codes and to perform generative modeling with quantum computers. Our work provides insights into the design of variational quantum algorithms and establishes practical guidelines to implement these methods on near-term quantum computers, as well as some future research directions for this field.
Molecular quantum simulations with the variational quantum eigensolver (VQE) rely on ansatz states that approximate the molecular ground states. These ansatz states are generally defined by parametrized fermionic excitation operators and an initial reference state. Efficient ways to perform fermionic excitations are vital for the realization of the VQE on noisy intermediate-scale quantum computers. Here, we address this issue by first demonstrating circuits that perform qubit excitations, excitations that do not account for fermionic anticommutation relations. We then extend the functionality of these circuits to perform fermionic excitations. Compared to circuits constructed with the standard use of ``CNOTCNOTCNOT staircases'', our circuits offer a linear reduction in the number of CNOTCNOTCNOT gates, by a factor of 2 (8) per single (double) qubit or fermionic excitation, respectively. Our results reduce the requirements for near-term realizations of quantum molecular simulations.
Accurate prediction of molecular structures and properties is vital for chemistry; materials science, and drug discovery, yet classical electronic-structure methods often fail for strongly correlated systems, large basis sets, and complex potential-energy landscapes. Quantum technology encompassing quantum computing, quantum machine learning, and hybrid quantum classical strategies offers a fundamentally new paradigm by encoding many-electron wave functions directly on qubits and exploiting superposition and entanglement to explore exponentially large Hilbert spaces. This review synthesizes recent algorithmic and hardware advances relevant to molecular modelling, including the Variational Quantum Eigensolver (VQE), Quantum Phase Estimation (QPE), quantum unitary coupled-cluster (q-UCC) families, equation-of-motion and subspace methods for excited states, tensor-network hybrids, and quantum kernel and variational QML approaches. We examine noise-aware hybrid workflows, error-mitigation techniques, symmetry-preserving ansätze, and operator-factorization methods that reduce measurement and gate overhead. Representative applications are discussed: ground- and excited-state energy prediction, potential-energy surface mapping, geometry and transition-state optimization, spectroscopic property estimation (IR, UV–Vis, NMR, EPR), and reaction-dynamics scenarios where non-adiabatic effects and conical intersections dominate. Resource estimates and scaling analyses clarify current NISQ limitations qubit counts, circuit depth, shot complexity and delineate the roadmap to fault-tolerant QPE for chemical accuracy. We compare quantum approaches with classical baselines (DFT, CCSD (T), multireference methods), identifying domains where quantum methods already show promise (strong correlation, multi-reference dissociation, spin-state ordering) and where classical methods remain competitive. Finally, we highlight near-term industrial opportunities in drug design, catalysis, CO2 capture, and energy materials, and outline critical research directions: algorithmic reductions in measurement/precision cost, hardware improvements in fidelity and connectivity, scalable ansatz design, and integrated software stacks for reproducible hybrid simulations. Together, these developments indicate that while practical, large-scale quantum advantage for general chemistry remains future work, quantum technologies are rapidly maturing into powerful tools for targeted molecular problems that are intractable with existing classical techniques.
Abstract Quantum computing is an exciting area, which has grown at an astonishing rate in the last decade. It is specially promising for the computational and theoretical chemistry area. One algorithm has received a lot of attention lately, the variational quantum eigensolver (VQE). Is is used to solve electronic structure problems and it is suitable to the noisy intermediate-scale quantum (NISQ) hardware. VQE calculations require ansatze and one of the most known is the unitary coupled-cluster (UCC). It uses the chosen basis set to generate a circuit which will be iteratively minimized. The present work investigates the circuit depth as a function of basis sets and molecular size. It has been shown that for the current quantum devices, only the smallest molecules and basis sets are tractable. The H2 molecule with the cc-pVTZ and aug-cc-pVTZ basis sets have circuit depths in the order of 106 to 107 gates and the C2H6 molecule with 3-21G basis set has a circuit depth of 2.2 ×108 gates. At the same time the analysis demonstrate that the H2 molecule with STO-3G basis set, requires at least 500 shots to reduce the error and that, although error mitigation schemes can diminish the error, they were not able to completely negate it.