Fast inversion, preconditioned quantum linear system solvers, and fast
evaluation of matrix functions
- URL: http://arxiv.org/abs/2008.13295v2
- Date: Tue, 28 Sep 2021 17:41:56 GMT
- Title: Fast inversion, preconditioned quantum linear system solvers, and fast
evaluation of matrix functions
- Authors: Yu Tong, Dong An, Nathan Wiebe, Lin Lin
- Abstract summary: We introduce a quantum primitive called fast inversion, which can be used as a preconditioner for solving quantum linear systems.
We demonstrate the application of preconditioned linear system solvers for computing single-particle Green's functions of quantum many-body systems.
- Score: 4.327821619134312
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Preconditioning is the most widely used and effective way for treating
ill-conditioned linear systems in the context of classical iterative linear
system solvers. We introduce a quantum primitive called fast inversion, which
can be used as a preconditioner for solving quantum linear systems. The key
idea of fast inversion is to directly block-encode a matrix inverse through a
quantum circuit implementing the inversion of eigenvalues via classical
arithmetics. We demonstrate the application of preconditioned linear system
solvers for computing single-particle Green's functions of quantum many-body
systems, which are widely used in quantum physics, chemistry, and materials
science. We analyze the complexities in three scenarios: the Hubbard model, the
quantum many-body Hamiltonian in the planewave-dual basis, and the Schwinger
model. We also provide a method for performing Green's function calculation in
second quantization within a fixed particle manifold and note that this
approach may be valuable for simulation more broadly. Besides solving linear
systems, fast inversion also allows us to develop fast algorithms for computing
matrix functions, such as the efficient preparation of Gibbs states. We
introduce two efficient approaches for such a task, based on the contour
integral formulation and the inverse transform respectively.
Related papers
- A Catalyst Framework for the Quantum Linear System Problem via the Proximal Point Algorithm [9.804179673817574]
We propose a new quantum algorithm for the quantum linear system problem (QLSP) inspired by the classical proximal point algorithm (PPA)
Our proposed method can be viewed as a meta-algorithm that allows inverting a modified matrix via an existing texttimattQLSP_solver.
By carefully choosing the step size $eta$, the proposed algorithm can effectively precondition the linear system to mitigate the dependence on condition numbers that hindered the applicability of previous approaches.
arXiv Detail & Related papers (2024-06-19T23:15:35Z) - Quantum Iterative Methods for Solving Differential Equations with Application to Computational Fluid Dynamics [14.379311972506791]
We propose quantum methods for solving differential equations based on a gradual improvement of the solution via an iterative process.
We benchmark the approach on paradigmatic fluid dynamics problems.
arXiv Detail & Related papers (2024-04-12T17:08:27Z) - Hybrid quantum-classical and quantum-inspired classical algorithms for
solving banded circulant linear systems [0.8192907805418583]
We present an efficient algorithm based on convex optimization of combinations of quantum states to solve for banded circulant linear systems.
By decomposing banded circulant matrices into cyclic permutations, our approach produces approximate solutions to such systems with a combination of quantum states linear to $K$.
We validate our methods with classical simulations and actual IBM quantum computer implementation, showcasing their applicability for solving physical problems such as heat transfer.
arXiv Detail & Related papers (2023-09-20T16:27:16Z) - 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) - Quantum algorithms for matrix operations and linear systems of equations [65.62256987706128]
We propose quantum algorithms for matrix operations using the "Sender-Receiver" model.
These quantum protocols can be used as subroutines in other quantum schemes.
arXiv Detail & Related papers (2022-02-10T08:12:20Z) - A Quantum Computer Amenable Sparse Matrix Equation Solver [0.0]
We study problems involving the solution of matrix equations, for which there currently exists no efficient, general quantum procedure.
We develop a generalization of the Harrow/Hassidim/Lloyd algorithm by providing an alternative unitary for eigenphase estimation.
This unitary has the advantage of being well defined for any arbitrary matrix equation, thereby allowing the solution procedure to be directly implemented on quantum hardware.
arXiv Detail & Related papers (2021-12-05T15:42:32Z) - 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) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z) - Linear embedding of nonlinear dynamical systems and prospects for
efficient quantum algorithms [74.17312533172291]
We describe a method for mapping any finite nonlinear dynamical system to an infinite linear dynamical system (embedding)
We then explore an approach for approximating the resulting infinite linear system with finite linear systems (truncation)
arXiv Detail & Related papers (2020-12-12T00:01:10Z) - Autoregressive Transformer Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation [5.668795025564699]
We present an approach for tackling open quantum system dynamics.
We compactly represent quantum states with autoregressive transformer neural networks.
Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator.
arXiv Detail & Related papers (2020-09-11T18:00:00Z) - Electronic structure with direct diagonalization on a D-Wave quantum
annealer [62.997667081978825]
This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer.
We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
arXiv Detail & Related papers (2020-09-02T22:46:47Z)
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.