Quantum subspace expansion algorithm for Green's functions

• URL: http://arxiv.org/abs/2205.00094v3
• Date: Tue, 6 Dec 2022 09:49:25 GMT
• Title: Quantum subspace expansion algorithm for Green's functions
• Authors: Francois Jamet, Abhishek Agarwal and Ivan Rungger
• Abstract summary: We present an algorithm to compute Green's functions on quantum computers for interacting electron systems. It uses a continued fraction representation based on the Lanczos method, where the wave functions are expanded as linear combination of basis states. We propose a two-level multigrid Trotter time evolution for an efficient preparation of the basis states in a quantum circuit.
• Score: 3.3946853660795884
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present an algorithm to compute Green's functions on quantum computers for interacting electron systems, which is a challenging task on conventional computers. It uses a continued fraction representation based on the Lanczos method, where the wave functions are expanded as linear combination of basis states within a quantum subspace. While on conventional computers the cost of the computation grows exponentially with system size, limiting the method to small systems, by representing the basis states on a quantum computer one may overcome this exponential scaling barrier. We propose a two-level multigrid Trotter time evolution for an efficient preparation of the basis states in a quantum circuit, which takes advantage of the robustness of the subspace expansion against Trotter errors. Using a quantum emulator we demonstrate the algorithm for the Hubbard model on a Bethe lattice with infinite coordination, which we map to a 16 qubit Anderson impurity model within the dynamical mean field theory. Our algorithm computes the Green's function accurately for both the metallic and Mott insulating regimes, with a circuit depth several orders of magnitude below what has been proposed using time evolution. The two-level multigrid time evolution reduces the number of Trotter steps required to compute the Green's function to about four to six. We therefore expect that the method can be used on near term quantum computers for moderate system sizes, while allowing for scalability to larger circuit depths and qubit numbers on future fault tolerant quantum computers.

Related papers

• Entropy-driven entanglement forging [0.0]
  We show how entropy-driven entanglement forging can be used to adjust quantum simulations to the limitations of noisy intermediate-scale quantum devices. Our findings indicate that our method, entropy-driven entanglement forging, can be used to adjust quantum simulations to the limitations of noisy intermediate-scale quantum devices.
  arXiv  Detail & Related papers  (2024-09-06T16:54:41Z)
• 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)
• 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)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• Variance minimisation on a quantum computer for nuclear structure [0.0]
  We present a variance based method of finding the excited state spectrum of a small nuclear system using a quantum computer. Our aim is to develop quantum computing algorithms which can reproduce and predict nuclear structure.
  arXiv  Detail & Related papers  (2022-09-16T09:38:07Z)
• 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)
• 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)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Quantum Algorithms and Simulation for Parallel and Distributed Quantum Computing [0.0]
  A viable approach for building large-scale quantum computers is to interlink small-scale quantum computers with a quantum network. We present our software framework called Interlin-q, a simulation platform that aims to simplify designing and verifying parallel and distributed quantum algorithms.
  arXiv  Detail & Related papers  (2021-06-12T19:41:48Z)
• Krylov variational quantum algorithm for first principles materials simulations [2.432166214112399]
  We propose an algorithm to obtain Green's functions as a continued fraction on quantum computers. This allows the integration of quantum algorithms with first principles material science simulations.
  arXiv  Detail & Related papers  (2021-05-27T16:47:43Z)
• 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.