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

Precision Chemistry

Quantum Computer Simulation of Molecules in Optical Cavity

Zirui Sheng, Yufei Ge, Jianpeng Chen, Weitang Li, Zhigang Shuai

Published May 12, 2025• 4 citations
Publisher

Abstract

High Resolution Image Download MS PowerPoint Slide Various phenomena have been observed in molecule–cavity coupled systems, which are believed to hold potential for applications in transistors, lasers, and computational units, among others. However, theoretical methods for simulating molecules in optical cavities still require further development due to the complex couplings between electrons, phonons, and photons within the cavity. In this study, motivated by recent advances in quantum algorithms and quantum computing hardware, we propose a quantum computing algorithm tailored for molecules in optical cavities. Our method, based on a variational quantum algorithm and variational boson encoders, has its effectiveness validated on both quantum simulators and hardware. For aggregates within the cavity, described by the Holstein–Tavis–Cummings model, our approach demonstrates clear advantages over other quantum and classical methods, as proved by numerical benchmarks. Additionally, we apply this method to study the H 2 molecule in a cavity using a superconducting quantum computer and the Pauli–Fierz model. To enhance accuracy, we incorporate error mitigation techniques, such as readout and reference-state error mitigation, resulting in an 86% reduction in the average error.

DOI
10.1021/prechem.4c00108

Related papers

Digital quantum simulation of cavity quantum electrodynamics: insights from superconducting and trapped ion quantum testbeds

Alex H. Rubin, Brian Marinelli, Victoria A. Norman +15 more

Abstract We explore the potential for hybrid development of quantum hardware where currently available quantum computers simulate open cavity quantum electrodynamical (CQED) systems for applications in optical quantum communication, simulation and computing. Our simulations make use of a recent quantum algorithm that maps the dynamics of a singly excited open Tavis–Cummings model containing N atoms coupled to a lossy cavity. We report the results of executing this algorithm on two noisy intermediate-scale quantum computers: a superconducting processor and a trapped ion processor, to simulate the population dynamics of an open CQED system featuring N = 3 atoms. By applying technology-specific transpilation and error mitigation techniques, we minimize the impact of gate errors, noise, and decoherence in each hardware platform, obtaining results which agree closely with the exact solution of the system. These results can be used as a recipe for efficient and platform-specific quantum simulation of cavity–emitter systems on contemporary and future quantum computers.

arXiv:2404.03861•Quantum Science and Technology•Sep 24, 2025•7 citations

Digital Tavis-Cummings Simulation on Superconducting Quantum Hardware with Error Mitigation

Brian Marinelli, Alex H. Rubin, Victoria A. Norman +8 more

We explore digital quantum simulation of the dynamics of N emitters coupled to an optical cavity (Tavis-Cummings model) on superconducting quantum hardware and successfully mitigate errors using randomized compiling and noiseless output extrapolation methods.

Quantum 2.0 Conference and Exhibition•Jan 1, 2023•0 citations

DEVELOPMENT OF ALGORITHMS AND SIMULATIONS FOR QUANTUM COMPUTERS AND THEIR POTENTIAL APPLICATIONS IN SOLVING QUANTUM PROBLEMS

K. Sabeeh, Gul Rahman

Quantum computing has emerged as a transformative paradigm capable of solving complex computational problems that are intractable for classical computers. Central to the advancement of this technology is the development of efficient quantum algorithms and high fidelity simulations that enable the design, testing, and optimization of quantum solutions before deployment on physical hardware. This study focuses on the design and implementation of quantum algorithms tailored for solving a variety of quantum problems, including quantum chemistry, optimization, and cryptography. Using state of the art simulation platforms such as Qiskit, Cirq, and Pennylane, algorithm performance was evaluated in terms of accuracy, execution time, scalability, and resilience to noise. Benchmarks demonstrate that algorithms such as the Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA) achieve significant speedups in problem specific domains, while hybrid quantum–classical methods provide robust pathways for near term quantum advantage. Simulation results reveal that algorithmic efficiency can be significantly improved through optimized circuit depth, qubit connectivity mapping, and advanced error mitigation techniques. The findings highlight the potential of simulation driven quantum algorithm development in accelerating the practical realization of quantum computing applications across disciplines such as materials discovery, molecular modeling, secure communications, and complex optimization tasks.

•Dec 1, 2025•0 citations

Simulating Polaritonic Ground States on Noisy Quantum Devices

Mohammad Hassan, Fabijan Pavošević, Derek S. Wang +1 more

The recent advent of quantum algorithms for noisy quantum devices offers a new route toward simulating strong light–matter interactions of molecules in optical cavities for polaritonic chemistry. In this work, we introduce a general framework for simulating electron–photon-coupled systems on small, noisy quantum devices. This method is based on the variational quantum eigensolver (VQE) with the polaritonic unitary coupled cluster (PUCC) ansatz. To achieve chemical accuracy, we exploit various symmetries in qubit reduction methods, such as electron–photon parity, and use recently developed error mitigation schemes, such as the reference zero-noise extrapolation method. We explore the robustness of the VQE-PUCC approach across a diverse set of regimes for the bond length, cavity frequency, and coupling strength of the H 2 molecule in an optical cavity. To quantify the performance, we measure two properties: ground-state energy, fundamentally relevant to chemical reactivity, and photon number, an experimentally accessible general indicator of electron–photon correlation.

arXiv:2310.02100•The Journal of Physical Chemistry Letters•Jan 29, 2024•3 citations

Quantum algorithms for electronic structure beyond ground state energies

Emiel Koridon

Quantum chemistry models atoms and molecules using quantum mechanics, with the electronic structure problem at its core. This problem, which determines the energy and properties of electrons in a molecule, is exponentially hard to solve exactly on classical computers. To approximate solutions, effective models introduce layers of simplifications. However, these approximations can fail for strongly correlated systems, necessitating alternative approaches. Quantum computers, capable of processing quantum information natively, offer a promising path to simulate molecular systems beyond classical reach, with potential applications in catalysis, materials science, and photochemistry. Despite rapid advancements in quantum hardware, practical quantum computations remain challenging due to limited resources. This thesis optimizes quantum resource usage in computational chemistry, introducing novel embedding techniques and exploring applications beyond ground-state energies. Chapter 1 establishes the foundation by reviewing quantum chemistry methods, from Hartree-Fock and Density Functional Theory (DFT) to active space approaches. It also provides an introduction to quantum computing for chemistry, focusing on near-term algorithms. The following chapters present novel methods aimed at reducing quantum resource requirements and tackling problems classical methods struggle with. Chapter 2 introduces a technique to reduce the $\lambda$-norm of the electronic structure Hamiltonian, a key measure of quantum resource demand. By transforming molecular orbitals, this method enhances sampling efficiency in Noisy Intermediate-Scale Quantum (NISQ) algorithms and reduces runtime in Fault-Tolerant Quantum Computing (FTQC). Localized orbitals outperform canonical ones, and an orbital-optimization scheme is proposed to minimize the $\lambda$-norm. Benchmarks on hydrogen chains, FeMoco, and Ruthenium complexes demonstrate its effectiveness. Chapter 3 presents the FragPT2 framework for simulating large systems with multiple interacting fragments. This method embeds each fragment in the mean field of others and applies multi-reference perturbation theory to capture inter-fragment correlations such as dispersion and charge transfer efficiently. The approach reduces computational overhead and enables scalable simulations, as shown in applications to \ce{N2} dimers, aromatic dimers, and butadiene. Chapter 4 focuses on photochemical systems, where multiple electronic states must be treated equally. The state-averaged orbital-optimized variational quantum eigensolver (SAOOVQE) is extended with analytical energy gradients and non-adiabatic couplings, enabling geometry optimizations and simulations of non-adiabatic dynamics on quantum hardware. This is demonstrated by locating the conical intersection in formaldimine, highlighting SAOOVQE’s potential for studying photoisomerization in biomolecules. Building on this, Chapter 5 develops a quantum algorithm to detect conical intersections, where the Born-Oppenheimer approximation breaks down. These intersections are characterized by a discrete Berry phase (0 or $\pi$), representing their topological nature. The algorithm extracts this phase as a single bit of information, ensuring resilience to noise. Analytical proof and numerical validation using a toy molecular model illustrate its effectiveness for studying light-perception biochemistry and related photochemical processes. Finally, Chapter 6 explores machine learning density functionals trained on noisy quantum data. While DFT is computationally efficient, its accuracy depends on approximated exchange-correlation functionals. This work proposes a neural network-based approach to learn the exact functional from quantum data, showing that training on noisy outputs from NISQ devices can mitigate sampling errors. Applications to the Fermi-Hubbard model and other systems demonstrate its potential to generalize and provide accurate results under noise. This thesis advances quantum computational chemistry by optimizing quantum resource usage, developing new embedding strategies, and expanding the scope of quantum simulations beyond ground-state properties. These contributions pave the way for practical quantum algorithms that could revolutionize molecular simulations in the near future.

•Apr 4, 2025•0 citations

Ab initio polaritonic chemistry on diverse quantum computing platforms: Ansatz circuit design for qubit, qudit, and hybrid qubit-qumode architectures

Even Chiari, Wafa Makhlouf, Lucie Pepe +5 more

In the field of ab initio polaritonic chemistry, the use of quantum computers may offer, in the long term, a promising computational pathway for simulating and exploring novel cavity-induced light-matter phenomena. Addressing such problems on emerging platforms, however, already presents significant challenges that need to be considered for near-term applications. Within the framework of the variational quantum eigensolver (VQE), a key question concerns the development of quantum circuit Ans\"atze capable of encoding strongly correlated electron-photon states at a reasonable resource cost. Motivated by this question, in this work we develop different Ansatz strategies covering not only conventional qubit-based approaches but also higher-dimensional information units. Specifically, we introduce a set of circuits tailored to three different quantum computing architectures: (i) qubits, (ii) qudits, and (iii) hybrid qubit-qumode units of information. All circuits are designed to be both compact and physically motivated, with a central element being the development of spin-adapted electron-photon entangling fragment circuits tailored to the native capabilities of each platform. Integrating the different Ans\"atze within the state-averaged VQE, we numerically benchmark the three strategies on a cavity-embedded ${\mathrm{H}}_{2}$ molecule using state-vector simulations. Our results show that each proposed Ansatz achieves high accuracy in encoding the ground, first, and second polaritonic eigenstates of the system, even reproducing characteristic light-matter phenomena such as light-induced avoided crossings and conical intersections. This prospective work, beyond introducing multiple computational strategies adapted to different platforms, also highlights the potential of higher-dimensional quantum architectures to address hybrid fermion-boson systems.

arXiv:2506.12504•Physical Review A•Nov 18, 2025•8 citations
High Resolution Image Download MS PowerPoint Slide Various phenomena have been observed in molecule–cavity coupled systems, which are believed to hold potential for applications in transistors, lasers, and computational units, among others. However, theoretical methods for simulating molecules in optical cavities still require further development due to the complex couplings between electrons, phonons, and photons within the cavity. In this study, motivated by recent advances in quantum algorithms and quantum computing hardware, we propose a quantum computing algorithm tailored for molecules in optical cavities. Our method, based on a variational quantum algorithm and variational boson encoders, has its effectiveness validated on both quantum simulators and hardware. For aggregates within the cavity, described by the Holstein–Tavis–Cummings model, our approach demonstrates clear advantages over other quantum and classical methods, as proved by numerical benchmarks. Additionally, we apply this method to study the H 2 molecule in a cavity using a superconducting quantum computer and the Pauli–Fierz model. To enhance accuracy, we incorporate error mitigation techniques, such as readout and reference-state error mitigation, resulting in an 86% reduction in the average error.
Abstract We explore the potential for hybrid development of quantum hardware where currently available quantum computers simulate open cavity quantum electrodynamical (CQED) systems for applications in optical quantum communication, simulation and computing. Our simulations make use of a recent quantum algorithm that maps the dynamics of a singly excited open Tavis–Cummings model containing N atoms coupled to a lossy cavity. We report the results of executing this algorithm on two noisy intermediate-scale quantum computers: a superconducting processor and a trapped ion processor, to simulate the population dynamics of an open CQED system featuring N = 3 atoms. By applying technology-specific transpilation and error mitigation techniques, we minimize the impact of gate errors, noise, and decoherence in each hardware platform, obtaining results which agree closely with the exact solution of the system. These results can be used as a recipe for efficient and platform-specific quantum simulation of cavity–emitter systems on contemporary and future quantum computers.
Quantum computing has emerged as a transformative paradigm capable of solving complex computational problems that are intractable for classical computers. Central to the advancement of this technology is the development of efficient quantum algorithms and high fidelity simulations that enable the design, testing, and optimization of quantum solutions before deployment on physical hardware. This study focuses on the design and implementation of quantum algorithms tailored for solving a variety of quantum problems, including quantum chemistry, optimization, and cryptography. Using state of the art simulation platforms such as Qiskit, Cirq, and Pennylane, algorithm performance was evaluated in terms of accuracy, execution time, scalability, and resilience to noise. Benchmarks demonstrate that algorithms such as the Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA) achieve significant speedups in problem specific domains, while hybrid quantum–classical methods provide robust pathways for near term quantum advantage. Simulation results reveal that algorithmic efficiency can be significantly improved through optimized circuit depth, qubit connectivity mapping, and advanced error mitigation techniques. The findings highlight the potential of simulation driven quantum algorithm development in accelerating the practical realization of quantum computing applications across disciplines such as materials discovery, molecular modeling, secure communications, and complex optimization tasks.
The recent advent of quantum algorithms for noisy quantum devices offers a new route toward simulating strong light–matter interactions of molecules in optical cavities for polaritonic chemistry. In this work, we introduce a general framework for simulating electron–photon-coupled systems on small, noisy quantum devices. This method is based on the variational quantum eigensolver (VQE) with the polaritonic unitary coupled cluster (PUCC) ansatz. To achieve chemical accuracy, we exploit various symmetries in qubit reduction methods, such as electron–photon parity, and use recently developed error mitigation schemes, such as the reference zero-noise extrapolation method. We explore the robustness of the VQE-PUCC approach across a diverse set of regimes for the bond length, cavity frequency, and coupling strength of the H 2 molecule in an optical cavity. To quantify the performance, we measure two properties: ground-state energy, fundamentally relevant to chemical reactivity, and photon number, an experimentally accessible general indicator of electron–photon correlation.
Quantum chemistry models atoms and molecules using quantum mechanics, with the electronic structure problem at its core. This problem, which determines the energy and properties of electrons in a molecule, is exponentially hard to solve exactly on classical computers. To approximate solutions, effective models introduce layers of simplifications. However, these approximations can fail for strongly correlated systems, necessitating alternative approaches. Quantum computers, capable of processing quantum information natively, offer a promising path to simulate molecular systems beyond classical reach, with potential applications in catalysis, materials science, and photochemistry. Despite rapid advancements in quantum hardware, practical quantum computations remain challenging due to limited resources. This thesis optimizes quantum resource usage in computational chemistry, introducing novel embedding techniques and exploring applications beyond ground-state energies. Chapter 1 establishes the foundation by reviewing quantum chemistry methods, from Hartree-Fock and Density Functional Theory (DFT) to active space approaches. It also provides an introduction to quantum computing for chemistry, focusing on near-term algorithms. The following chapters present novel methods aimed at reducing quantum resource requirements and tackling problems classical methods struggle with. Chapter 2 introduces a technique to reduce the λ\lambdaλ-norm of the electronic structure Hamiltonian, a key measure of quantum resource demand. By transforming molecular orbitals, this method enhances sampling efficiency in Noisy Intermediate-Scale Quantum (NISQ) algorithms and reduces runtime in Fault-Tolerant Quantum Computing (FTQC). Localized orbitals outperform canonical ones, and an orbital-optimization scheme is proposed to minimize the λ\lambdaλ-norm. Benchmarks on hydrogen chains, FeMoco, and Ruthenium complexes demonstrate its effectiveness. Chapter 3 presents the FragPT2 framework for simulating large systems with multiple interacting fragments. This method embeds each fragment in the mean field of others and applies multi-reference perturbation theory to capture inter-fragment correlations such as dispersion and charge transfer efficiently. The approach reduces computational overhead and enables scalable simulations, as shown in applications to \ce{N2} dimers, aromatic dimers, and butadiene. Chapter 4 focuses on photochemical systems, where multiple electronic states must be treated equally. The state-averaged orbital-optimized variational quantum eigensolver (SAOOVQE) is extended with analytical energy gradients and non-adiabatic couplings, enabling geometry optimizations and simulations of non-adiabatic dynamics on quantum hardware. This is demonstrated by locating the conical intersection in formaldimine, highlighting SAOOVQE’s potential for studying photoisomerization in biomolecules. Building on this, Chapter 5 develops a quantum algorithm to detect conical intersections, where the Born-Oppenheimer approximation breaks down. These intersections are characterized by a discrete Berry phase (0 or π\piπ), representing their topological nature. The algorithm extracts this phase as a single bit of information, ensuring resilience to noise. Analytical proof and numerical validation using a toy molecular model illustrate its effectiveness for studying light-perception biochemistry and related photochemical processes. Finally, Chapter 6 explores machine learning density functionals trained on noisy quantum data. While DFT is computationally efficient, its accuracy depends on approximated exchange-correlation functionals. This work proposes a neural network-based approach to learn the exact functional from quantum data, showing that training on noisy outputs from NISQ devices can mitigate sampling errors. Applications to the Fermi-Hubbard model and other systems demonstrate its potential to generalize and provide accurate results under noise. This thesis advances quantum computational chemistry by optimizing quantum resource usage, developing new embedding strategies, and expanding the scope of quantum simulations beyond ground-state properties. These contributions pave the way for practical quantum algorithms that could revolutionize molecular simulations in the near future.
In the field of ab initio polaritonic chemistry, the use of quantum computers may offer, in the long term, a promising computational pathway for simulating and exploring novel cavity-induced light-matter phenomena. Addressing such problems on emerging platforms, however, already presents significant challenges that need to be considered for near-term applications. Within the framework of the variational quantum eigensolver (VQE), a key question concerns the development of quantum circuit Ans\"atze capable of encoding strongly correlated electron-photon states at a reasonable resource cost. Motivated by this question, in this work we develop different Ansatz strategies covering not only conventional qubit-based approaches but also higher-dimensional information units. Specifically, we introduce a set of circuits tailored to three different quantum computing architectures: (i) qubits, (ii) qudits, and (iii) hybrid qubit-qumode units of information. All circuits are designed to be both compact and physically motivated, with a central element being the development of spin-adapted electron-photon entangling fragment circuits tailored to the native capabilities of each platform. Integrating the different Ans\"atze within the state-averaged VQE, we numerically benchmark the three strategies on a cavity-embedded H2{\mathrm{H}}_{2}H2​ molecule using state-vector simulations. Our results show that each proposed Ansatz achieves high accuracy in encoding the ground, first, and second polaritonic eigenstates of the system, even reproducing characteristic light-matter phenomena such as light-induced avoided crossings and conical intersections. This prospective work, beyond introducing multiple computational strategies adapted to different platforms, also highlights the potential of higher-dimensional quantum architectures to address hybrid fermion-boson systems.