REVIEW 9 cited by
Quantum subspace expansion algorithm for Green's functions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Quantum subspace expansion algorithm for Green's functions
read the original 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.
Forward citations
Cited by 9 Pith papers
-
Spectral functions on a quantum computer through system-environment interaction
A new quantum circuit method computes spectral functions A(k,ω) by simulating ARPES-like system-environment coupling, cutting sampling overhead by O(N) and demonstrated on a 54-qubit ion-trap processor for a 27-site chain.
-
Quantum Finite Temperature Lanczos Method
QFTLM computes thermal expectation values on quantum computers by merging quantum Krylov methods with efficient typical-state preparation for trace estimation.
-
Quantum simulations of Green's functions for small superfluid systems
A hybrid quantum-classical method computes accurate Green's functions for the pairing model across the normal-to-superfluid transition by combining variational ground-state preparation with quantum subspace expansion ...
-
Channel-agnostic finite-temperature phase estimation averaged over variable grids: reconstruction of Green's function for dynamical mean-field theory
A hybrid scheme combines channel-agnostic finite-temperature QPE with QAVG reconstruction to obtain the one-particle Green's function for DMFT, shown via numerical simulation on SrVO3.
-
A Critical Assessment of the Sample-Based Quantum Diagonalization for Heisenberg and Hubbard Models
SQD needs an exponentially increasing number of computational-basis configurations to approximate ground-state energies of Heisenberg and Hubbard models within fixed accuracy, even when configurations are chosen optim...
-
A circuit-differentiation framework for Green's functions on quantum computers
Framework maps retarded Green's function evaluation to differentiation of real-time evolution quantum circuits using circuit perturbations.
-
Interaction geometry and ground-state properties of sparse quantum lattice models
Symmetry and frustration in power-of-p and Fibonacci graphs drive distinct ground-state phase behaviors in sparse long-range quantum models, unified by an effective-geometry principle.
-
Ground-state energies of Ising models calculated using the samples from a quantum computer that simulates short-time evolution
Ground-state energies of homogeneous and random-coupling Ising models are obtained via CVQE with GSA on quantum hardware up to 63 qubits, with error-boundary, entropic, and subspace analyses indicating suitability for...
-
Hybrid VQE-CVQE algorithm using diabatic state preparation
A hybrid VQE-CVQE scheme using a few-step 'diabatic' evolution to build a guiding state, followed by classical diagonalization in the sampled subspace, yields chemically accurate ground-state energies in toy-model and...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.