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

The Japan Society of Applied Physics

Quantum algorithms for Green’s functions and linear response functions on quantum computers

Taichi Kosugi, Yu‐ichiro Matsushita

Published Jan 28, 2020• 0 citations
OpenAlex

Related papers

Green functions for nonlinear operators and application to quantum computing

Bi Qiao, Harry E. Ruda

Physica A Statistical Mechanics and its Applications•Dec 6, 2003•3 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•49 citations

Algorithms for Quantum Computers

Jamie Smith, Michele Mosca

arXiv:1001.0767•Springer eBooks•Jan 1, 2012•23 citations

A linear response framework for simulating bosonic and fermionic correlation functions illustrated on quantum computers

Efekan Kökcü, Heba A. Labib, James K. Freericks +1 more

Response functions are a fundamental aspect of physics; they represent the link between experimental observations and the underlying quantum many-body state. However, this link is often under-appreciated, as the Lehmann formalism for obtaining response functions in linear response has no direct link to experiment. Within the context of quantum computing, and by using a linear response framework, we restore this link by making the experiment an inextricable part of the quantum simulation. This method can be frequency- and momentum-selective, avoids limitations on operators that can be directly measured, and is ancilla-free. As prototypical examples of response functions, we demonstrate that both bosonic and fermionic Green's functions can be obtained, and apply these ideas to the study of a charge-density-wave material on ibm_auckland. The linear response method provides a robust framework for using quantum computers to study systems in physics and chemistry. It also provides new paradigms for computing response functions on classical computers.

arXiv:2302.10219•Feb 20, 2023•1 citation

Efficient Calculation of Equilibrium Correlation Functions

Yizhi Shen, Roel Van Beeumen, Wibe A. de Jong +1 more

A majority of measurable dynamic quantities of a physical system is described as an equilibrium correlation function of the form $G_{AB}(t-t') = \left<A(t)B(t')\right>$, where $t'$ represents the impact time and $t$ represents the response time. Conventional quantum algorithms to compute such quantities via Hamiltonian simulation such as the Hadamard test, variational methods, or linear-response-based algorithms share one feature in common: each time point $t-t'$ is calculated by a different quantum circuit, leading to at least $O(N_t)$ total shots, and at least $O(N_t^2)$ total quantum gates. Here, we provide a different approach: utilizing $O(\log N_t)$ ancilla qubits to store time as a quantum variable, and effectively parallelize the computation of an equilibrium correlation function by requiring only a single quantum circuit for all time points. We show that this circuit needs to be run only $O(\log N_t)$ times, which in total requires $O(N_t \log N_t)$ quantum resources in the large system size limits. We prove that this scaling is optimal, and demonstrate our algorithm calculating the Green's function of a one-dimensional spinless Hubbard model.

quant-pharXiv:2609.40349•Oct 1, 2026•0 citations

Quantum Algorithms from a Linear Algebra Perspective

Liam Michael Ogren, Lauren Michelle Baker

•Apr 27, 2017•0 citations
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.
Response functions are a fundamental aspect of physics; they represent the link between experimental observations and the underlying quantum many-body state. However, this link is often under-appreciated, as the Lehmann formalism for obtaining response functions in linear response has no direct link to experiment. Within the context of quantum computing, and by using a linear response framework, we restore this link by making the experiment an inextricable part of the quantum simulation. This method can be frequency- and momentum-selective, avoids limitations on operators that can be directly measured, and is ancilla-free. As prototypical examples of response functions, we demonstrate that both bosonic and fermionic Green's functions can be obtained, and apply these ideas to the study of a charge-density-wave material on ibm_auckland. The linear response method provides a robust framework for using quantum computers to study systems in physics and chemistry. It also provides new paradigms for computing response functions on classical computers.
A majority of measurable dynamic quantities of a physical system is described as an equilibrium correlation function of the form GAB(t−t′)=<A(t)B(t′)>G_{AB}(t-t') = \left<A(t)B(t')\right>GAB​(t−t′)=⟨A(t)B(t′)⟩, where t′t't′ represents the impact time and ttt represents the response time. Conventional quantum algorithms to compute such quantities via Hamiltonian simulation such as the Hadamard test, variational methods, or linear-response-based algorithms share one feature in common: each time point t−t′t-t't−t′ is calculated by a different quantum circuit, leading to at least O(Nt)O(N_t)O(Nt​) total shots, and at least O(Nt2)O(N_t^2)O(Nt2​) total quantum gates. Here, we provide a different approach: utilizing O(log⁡Nt)O(\log N_t)O(logNt​) ancilla qubits to store time as a quantum variable, and effectively parallelize the computation of an equilibrium correlation function by requiring only a single quantum circuit for all time points. We show that this circuit needs to be run only O(log⁡Nt)O(\log N_t)O(logNt​) times, which in total requires O(Ntlog⁡Nt)O(N_t \log N_t)O(Nt​logNt​) quantum resources in the large system size limits. We prove that this scaling is optimal, and demonstrate our algorithm calculating the Green's function of a one-dimensional spinless Hubbard model.