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:1911.00293 · Physical Review Research

Linear-response functions of molecules on a quantum computer: Charge and spin responses and optical absorption

Taichi Kosugi, Yu‐ichiro Matsushita

Published Jul 9, 2020• 21 citations
arXivHTMLPDF

Abstract

This work proposes a generic construction scheme for the quantum circuit implementing a nonunitary operator appearing in electronic-structure calculations. The authors demonstrate that the scheme enables one via probabilistic state preparation to calculate the linear-response functions of diatomic molecules, where simulated measurements and full configuration-interaction results are compared.

DOI
10.1103/physrevresearch.2.033043

Related papers

Quantum Chemistry on Quantum Computers: A Polynomial-Time Quantum Algorithm for Constructing the Wave Functions of Open-Shell Molecules

Kenji Sugisaki, Satoru Yamamoto, Shigeaki Nakazawa +4 more

Quantum computers are capable to efficiently perform full configuration interaction (FCI) calculations of atoms and molecules by using the quantum phase estimation (QPE) algorithm. Because the success probability of the QPE depends on the overlap between approximate and exact wave functions, efficient methods to prepare accurate initial guess wave functions enough to have sufficiently large overlap with the exact ones are highly desired. Here, we propose a quantum algorithm to construct the wave function consisting of one configuration state function, which is suitable for the initial guess wave function in QPE-based FCI calculations of open-shell molecules, based on the addition theorem of angular momentum. The proposed quantum algorithm enables us to prepare the wave function consisting of an exponential number of Slater determinants only by a polynomial number of quantum operations.

The Journal of Physical Chemistry A•Aug 8, 2016•54 citations

Construction of Green's functions on a quantum computer: Quasiparticle spectra of molecules

Taichi Kosugi, Yu‐ichiro Matsushita

We propose a scheme for the construction of the one-particle Green's function (GF) of an interacting electronic system via statistical sampling on a quantum computer. Although the nonunitarity of creation and annihilation operators for the electronic spin orbitals prevents us from preparing specific states selectively, probabilistic state preparation is demonstrated to be possible for the qubits. We provide quantum circuits equipped with at most two ancillary qubits for obtaining all the components of the GF. We perform simulations of such construction of GFs for LiH and ${\mathrm{H}}_{2}\mathrm{O}$ molecules based on the unitary coupled-cluster (UCC) method to demonstrate the validity of our scheme by comparing the quasiparticle and satellite spectra exact within the UCC method and those from full configuration-interaction calculations. We also examine the accuracy of the sampling method by exploiting the Galitskii-Migdal formula, which gives the total energy only from the GF.

arXiv:1908.03902•Physical Review A•Jan 17, 2020•45 citations

Variational Quantum Computation of Molecular Linear Response Properties on a Superconducting Quantum Processor

Kaixuan Huang, Xiaoxia Cai, Hao Li +12 more

Simulating response properties of molecules is crucial for interpreting experimental spectroscopies and accelerating materials design. However, it remains a long-standing computational challenge for electronic structure methods on classical computers. While quantum computers hold the promise of solving this problem more efficiently in the long run, existing quantum algorithms requiring deep quantum circuits are infeasible for near-term noisy quantum processors. Herein, we introduce a pragmatic variational quantum response (VQR) algorithm for response properties, which circumvents the need for deep quantum circuits. Using this algorithm, we report the first simulation of linear response properties of molecules including dynamic polarizabilities and absorption spectra on a superconducting quantum processor. Our results indicate that a large class of important dynamical properties, such as Green's functions, are within the reach of near-term quantum hardware using this algorithm in combination with suitable error mitigation techniques.

arXiv:2201.02426•The Journal of Physical Chemistry Letters•Sep 26, 2022•52 citations

Dynamic linear response quantum algorithm

Alessandro Roggero, Joseph Carlson

The dynamic linear response of a quantum system is critical for understanding both the structure and dynamics of strongly interacting quantum systems, including neutron scattering from materials, photon and electron scattering from atomic systems, and electron and neutrino scattering by nuclei. We present a general algorithm for universal quantum computers to calculate the dynamic linear response function with controlled errors and to obtain information about specific final states that can be directly compared to experimental observations.

arXiv:1804.01505•Physical Review C•Sep 13, 2019•129 citations

Open shell electronic state calculations on quantum computers: A quantum circuit for the preparation of configuration state functions based on Serber construction

Kenji Sugisaki, Satoru Yamamoto, Shigeaki Nakazawa +4 more

• An improved quantum circuit for the preparation of spin symmetry-adapted configuration state function is given. • The quantum circuit contains one-qubit rotations and controlled-NOT operations acting to adjacent two qubits. • The quantum circuit is fully parallelizable. • The depth of the quantum circuit is constant and independent to the number of unpaired electrons. Full configuration interaction (full-CI) calculations can be executed efficiently on quantum computers (QCs) by utilizing a quantum phase estimation algorithm (QPEA). In the QPEA-based full-CI on QCs, the preparation of the initial guess wave functions having large overlap with the full-CI root is crucial. Recently, we proposed a quantum circuit to prepare spin symmetry-adapted configuration state functions (CSFs) toward open shell electronic structure calculations of molecules on QCs. Here, we propose an improved quantum circuit, based on Serber construction of spin eigenfunctions, enabling us to prepare CSFs with much less and easier-to-implement quantum gates than the previously proposed one.

Chemical Physics Letters•Dec 13, 2018•30 citations

Universal programmable quantum circuit schemes to emulate an operator

Ammar Daskin, Ananth Y. Grama, Giorgos Kollias +1 more

Unlike fixed designs, programmable circuit designs support an infinite number of operators. The functionality of a programmable circuit can be altered by simply changing the angle values of the rotation gates in the circuit. Here, we present a new quantum circuit design technique resulting in two general programmable circuit schemes. The circuit schemes can be used to simulate any given operator by setting the angle values in the circuit. This provides a fixed circuit design whose angles are determined from the elements of the given matrix-which can be non-unitary-in an efficient way. We also give both the classical and quantum complexity analysis for these circuits and show that the circuits require a few classical computations. For the electronic structure simulation on a quantum computer, one has to perform the following steps: prepare the initial wave function of the system; present the evolution operator U = e(-iHt) for a given atomic and molecular Hamiltonian H in terms of quantum gates array and apply the phase estimation algorithm to find the energy eigenvalues. Thus, in the circuit model of quantum computing for quantum chemistry, a crucial step is presenting the evolution operator for the atomic and molecular Hamiltonians in terms of quantum gate arrays. Since the presented circuit designs are independent from the matrix decomposition techniques and the global optimization processes used to find quantum circuits for a given operator, high accuracy simulations can be done for the unitary propagators of molecular Hamiltonians on quantum computers. As an example, we show how to build the circuit design for the hydrogen molecule.

arXiv:1204.3600•The Journal of Chemical Physics•Dec 21, 2012•31 citations
This work proposes a generic construction scheme for the quantum circuit implementing a nonunitary operator appearing in electronic-structure calculations. The authors demonstrate that the scheme enables one via probabilistic state preparation to calculate the linear-response functions of diatomic molecules, where simulated measurements and full configuration-interaction results are compared.
Quantum computers are capable to efficiently perform full configuration interaction (FCI) calculations of atoms and molecules by using the quantum phase estimation (QPE) algorithm. Because the success probability of the QPE depends on the overlap between approximate and exact wave functions, efficient methods to prepare accurate initial guess wave functions enough to have sufficiently large overlap with the exact ones are highly desired. Here, we propose a quantum algorithm to construct the wave function consisting of one configuration state function, which is suitable for the initial guess wave function in QPE-based FCI calculations of open-shell molecules, based on the addition theorem of angular momentum. The proposed quantum algorithm enables us to prepare the wave function consisting of an exponential number of Slater determinants only by a polynomial number of quantum operations.
We propose a scheme for the construction of the one-particle Green's function (GF) of an interacting electronic system via statistical sampling on a quantum computer. Although the nonunitarity of creation and annihilation operators for the electronic spin orbitals prevents us from preparing specific states selectively, probabilistic state preparation is demonstrated to be possible for the qubits. We provide quantum circuits equipped with at most two ancillary qubits for obtaining all the components of the GF. We perform simulations of such construction of GFs for LiH and H2O{\mathrm{H}}_{2}\mathrm{O}H2​O molecules based on the unitary coupled-cluster (UCC) method to demonstrate the validity of our scheme by comparing the quasiparticle and satellite spectra exact within the UCC method and those from full configuration-interaction calculations. We also examine the accuracy of the sampling method by exploiting the Galitskii-Migdal formula, which gives the total energy only from the GF.
Simulating response properties of molecules is crucial for interpreting experimental spectroscopies and accelerating materials design. However, it remains a long-standing computational challenge for electronic structure methods on classical computers. While quantum computers hold the promise of solving this problem more efficiently in the long run, existing quantum algorithms requiring deep quantum circuits are infeasible for near-term noisy quantum processors. Herein, we introduce a pragmatic variational quantum response (VQR) algorithm for response properties, which circumvents the need for deep quantum circuits. Using this algorithm, we report the first simulation of linear response properties of molecules including dynamic polarizabilities and absorption spectra on a superconducting quantum processor. Our results indicate that a large class of important dynamical properties, such as Green's functions, are within the reach of near-term quantum hardware using this algorithm in combination with suitable error mitigation techniques.
The dynamic linear response of a quantum system is critical for understanding both the structure and dynamics of strongly interacting quantum systems, including neutron scattering from materials, photon and electron scattering from atomic systems, and electron and neutrino scattering by nuclei. We present a general algorithm for universal quantum computers to calculate the dynamic linear response function with controlled errors and to obtain information about specific final states that can be directly compared to experimental observations.
• An improved quantum circuit for the preparation of spin symmetry-adapted configuration state function is given. • The quantum circuit contains one-qubit rotations and controlled-NOT operations acting to adjacent two qubits. • The quantum circuit is fully parallelizable. • The depth of the quantum circuit is constant and independent to the number of unpaired electrons. Full configuration interaction (full-CI) calculations can be executed efficiently on quantum computers (QCs) by utilizing a quantum phase estimation algorithm (QPEA). In the QPEA-based full-CI on QCs, the preparation of the initial guess wave functions having large overlap with the full-CI root is crucial. Recently, we proposed a quantum circuit to prepare spin symmetry-adapted configuration state functions (CSFs) toward open shell electronic structure calculations of molecules on QCs. Here, we propose an improved quantum circuit, based on Serber construction of spin eigenfunctions, enabling us to prepare CSFs with much less and easier-to-implement quantum gates than the previously proposed one.
Unlike fixed designs, programmable circuit designs support an infinite number of operators. The functionality of a programmable circuit can be altered by simply changing the angle values of the rotation gates in the circuit. Here, we present a new quantum circuit design technique resulting in two general programmable circuit schemes. The circuit schemes can be used to simulate any given operator by setting the angle values in the circuit. This provides a fixed circuit design whose angles are determined from the elements of the given matrix-which can be non-unitary-in an efficient way. We also give both the classical and quantum complexity analysis for these circuits and show that the circuits require a few classical computations. For the electronic structure simulation on a quantum computer, one has to perform the following steps: prepare the initial wave function of the system; present the evolution operator U = e(-iHt) for a given atomic and molecular Hamiltonian H in terms of quantum gates array and apply the phase estimation algorithm to find the energy eigenvalues. Thus, in the circuit model of quantum computing for quantum chemistry, a crucial step is presenting the evolution operator for the atomic and molecular Hamiltonians in terms of quantum gate arrays. Since the presented circuit designs are independent from the matrix decomposition techniques and the global optimization processes used to find quantum circuits for a given operator, high accuracy simulations can be done for the unitary propagators of molecular Hamiltonians on quantum computers. As an example, we show how to build the circuit design for the hydrogen molecule.