Lanczos recursion on a quantum computer for the Green's function and ground state

• URL: http://arxiv.org/abs/2008.05593v4
• Date: Mon, 1 Mar 2021 23:29:54 GMT
• Title: Lanczos recursion on a quantum computer for the Green's function and ground state
• Authors: Thomas E. Baker
• Abstract summary: A state-preserving quantum counting algorithm is used to obtain coefficients of a Lanczos recursion from a single ground state wavefunction on the quantum computer. This is used to compute the continued fraction representation of an interacting Green's function for use in condensed matter, particle physics, and other areas.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A state-preserving quantum counting algorithm is used to obtain coefficients of a Lanczos recursion from a single ground state wavefunction on the quantum computer. This is used to compute the continued fraction representation of an interacting Green's function for use in condensed matter, particle physics, and other areas. The wavefunction does not need to be re-prepared at each iteration. The quantum algorithm represents an exponential reduction in memory over known classical methods. An extension of the method to determining the ground state is also discussed.

Related papers

• Computing Green's functions and improving ground state energy estimation on quantum computers with Liouvillian recursion [35.18016233072556]
  We present a quantum-classical hybrid implementation of the Liouvillian recursion method compute many-body Green functions using a quantum computer.<n>From an approximate ground state preparation circuit, this algorithm produces the local ($r=r'$) and inter-site ($rneq r'$) Green's functions.
  arXiv  Detail & Related papers  (2026-03-05T16:28:48Z)
• 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 [7.389215400072566]
  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.
  arXiv  Detail & Related papers  (2025-09-11T08:33:12Z)
• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• A quantum implementation of high-order power method for estimating geometric entanglement of pure states [39.58317527488534]
  This work presents a quantum adaptation of the iterative higher-order power method for estimating the geometric measure of entanglement of multi-qubit pure states.<n>It is executable on current (hybrid) quantum hardware and does not depend on quantum memory.<n>We study the effect of noise on the algorithm using a simple theoretical model based on the standard depolarising channel.
  arXiv  Detail & Related papers  (2024-05-29T14:40:24Z)
• Solving reaction dynamics with quantum computing algorithms [42.408991654684876]
  We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response. We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations.
  arXiv  Detail & Related papers  (2024-03-30T00:21:46Z)
• Quantum state tomography with disentanglement algorithm [0.0]
  We use variational quantum circuits to disentangle the quantum state to a product of computational zero states. Inverse evolution of the zero states reconstructs the quantum state up to an overall phase. Our method is universal and imposes no specific ansatz or constrain on the quantum state.
  arXiv  Detail & Related papers  (2023-10-10T03:11:12Z)
• 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 Computed Green's Functions using a Cumulant Expansion of the Lanczos Method [0.0]
  We present a quantum computational method to calculate the many-body Green's function matrix in a spin orbital basis. We demonstrate the calculation of Green's functions on Quantinuum's H1-1 trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2023-09-18T11:45:04Z)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• Near-term quantum algorithm for computing molecular and materials properties based on recursive variational series methods [44.99833362998488]
  We propose a quantum algorithm to estimate the properties of molecules using near-term quantum devices. We test our method by computing the one-particle Green's function in the energy domain and the autocorrelation function in the time domain.
  arXiv  Detail & Related papers  (2022-06-20T16:33:23Z)
• Quantum Algorithm to Estimate the Mean Value of a Function [0.0]
  This paper proposes a quantum circuit for computing the mean value from a given set of numbers or function evaluations. The proposed quantum algorithm estimate the mean value of the function by using superposition, interference, and entanglement phenomena.
  arXiv  Detail & Related papers  (2022-03-06T19:30:57Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• Variational Quantum Algorithms for Steady States of Open Quantum Systems [2.740982822457262]
  We propose a variational quantum algorithm to find the steady state of open quantum systems. The fidelity between the optimal mixed state and the true steady state is over 99%. This algorithm is derived from the natural idea of expressing mixed states with purification.
  arXiv  Detail & Related papers  (2020-01-08T14:47:36Z)

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.