Special Issue: Commemorating the 110th Anniversary of TANG Au-chin's Birthday Calculation of the Green's function on near-term quantum computers via Cartan decomposition

• URL: http://arxiv.org/abs/2509.09248v1
• Date: Thu, 11 Sep 2025 08:33:12 GMT
• Title: Special Issue: Commemorating the 110th Anniversary of TANG Au-chin's Birthday Calculation of the Green's function on near-term quantum computers via Cartan decomposition
• Authors: Lingyun Wan, Jie Liu, Jinlong Yang,
• Abstract summary: We introduce an efficient algorithm for computing Green's functions via Cartan decomposition.<n>The new algorithm is applied to simulate long-time Green's functions for the Fermi-Hubbard and transverse-field Ising models.
• Score: 7.389215400072566
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Accurate computation of the Green's function is crucial for connecting experimental observations to the underlying quantum states. A major challenge in evaluating the Green's function in the time domain lies in the efficient simulation of quantum state evolution under a given Hamiltonian-a task that becomes exponentially complex for strongly correlated systems on classical computers. Quantum computing provides a promising pathway to overcome this barrier by enabling efficient simulation of quantum dynamics. However, for near-term quantum devices with limited coherence times and fidelity, the deep quantum circuits required to implement time-evolution operators present a significant challenge for practical applications. In this work, we introduce an efficient algorithm for computing Green's functions via Cartan decomposition, which requires only fixed-depth quantum circuits for arbitrarily long time simulations. Additionally, analytical gradients are formulated to accelerate the Cartan decomposition by leveraging a unitary transformation in a factorized form. The new algorithm is applied to simulate long-time Green's functions for the Fermi-Hubbard and transverse-field Ising models, extracting the spectral functions through Fourier transformation.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Quantum algorithm for imaginary-time Green's functions [0.0]
  We present a hybrid quantum-classical algorithm to calculate the imaginary-time one-particle Green's function. The proposed algorithm combines variational quantum eigensolver and quantum subspace expansion to calculate Green's function.
  arXiv  Detail & Related papers  (2023-09-18T16:28:11Z)
• Quantum Thermal State Preparation [39.91303506884272]
  We introduce simple continuous-time quantum Gibbs samplers for simulating quantum master equations. We construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states. Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time.
  arXiv  Detail & Related papers  (2023-03-31T17:29:56Z)
• Computation of Green's function by local variational quantum compilation [0.0]
  We propose an efficient method to compute the real-time Green's function based on the local variational quantum compilation algorithm. Our method requires shallow quantum circuits to calculate the Green's function and can be utilized on both near-term noisy intermediate-scale and long-term fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2023-03-28T01:23:15Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Computing the many-body Green's function with adaptive variational quantum dynamics [0.0]
  We present a method to compute the many-body real-time Green's function using an adaptive variational quantum dynamics simulation approach. We demonstrate the evaluation of Green's function on an IBM Q quantum computer.
  arXiv  Detail & Related papers  (2023-02-06T19:49:16Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• One-particle Green's functions from the quantum equation of motion algorithm [0.0]
  We introduce a novel near-term quantum algorithm for computing one-particle Green's functions via their Lehmann representation. We demonstrate the validity of the present proposal by computing the Green's function of a two-site Fermi-Hubbard model on a IBM quantum processor.
  arXiv  Detail & Related papers  (2022-01-05T21:13:19Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Hybrid quantum-classical algorithm for computing imaginary-time correlation functions [0.0]
  We propose a hybrid algorithm for computing imaginary-time Green's functions on quantum devices with limited hardware resources. Using a quantum circuit simulator, we verified this algorithm by computing Green's functions for a dimer model and a four-site impurity model.
  arXiv  Detail & Related papers  (2021-12-06T03:40:02Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.