Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFast inversion, preconditioned quantum linear system solvers, and fast evaluation of matrix functions
185
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic 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 Greens 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 Greens 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.
rate research
Read More
We consider the problem of computing the rank of an m x n matrix A over a field. We present a randomized algorithm to find a set of r = rank(A) linearly independent columns in ~O(|A| + r^omega) field operations, where |A| denotes the number of nonzero entries in A and omega < 2.38 is the matrix multiplication exponent. Previously the best known algorithm to find a set of r linearly independent columns is by Gaussian elimination, with running time O(mnr^{omega-2}). Our algorithm is faster when r < max(m,n), for instance when the matrix is rectangular. We also consider the problem of computing the rank of a matrix dynamically, supporting the operations of rank one updates and additions and deletions of rows and columns. We present an algorithm that updates the rank in ~O(mn) field operations. We show that these algorithms can be used to obtain faster algorithms for various problems in numerical linear algebra, combinatorial optimization and dynamic data structure.
We describe a numerical scheme for evaluating the posterior moments of Bayesian linear regression models with partial pooling of the coefficients. The principal analytical tool of the evaluation is a change of basis from coefficient space to the space of singular vectors of the matrix of predictors. After this change of basis and an analytical integration, we reduce the problem of finding moments of a density over k + m dimensions, to finding moments of an m-dimensional density, where k is the number of coefficients and k + m is the dimension of the posterior. Moments can then be computed using, for example, MCMC, the trapezoid rule, or adaptive Gaussian quadrature. An evaluation of the SVD of the matrix of predictors is the dominant computational cost and is performed once during the precomputation stage. We demonstrate numerical results of the algorithm. The scheme described in this paper generalizes naturally to multilevel and multi-group hierarchical regression models where normal-normal parameters appear.
We prove quantitative norm bounds for a family of operators involving impedance boundary conditions on convex, polygonal domains. A robust numerical construction of Helmholtz scattering solutions in variable media via the Dirichlet-to-Neumann operator involves a decomposition of the domain into a sequence of rectangles of varying scales and constructing impedance-to-impedance boundary operators on each subdomain. Our estimates in particular ensure the invertibility, with quantitative bounds in the frequency, of the merge operators required to reconstruct the original Dirichlet-to-Neumann operator in terms of these impedance-to-impedance operators of the sub-domains. A key step in our proof is to obtain Neumann and Dirichlet boundary trace estimates on solutions of the impedance problem, which are of independent interest. In addition to the variable media setting, we also construct bounds for similar merge operators in the obstacle scattering problem.
Graph representation learning has many real-world applications, from super-resolution imaging, 3D computer vision to drug repurposing, protein classification, social networks analysis. An adequate representation of graph data is vital to the learning performance of a statistical or machine learning model for graph-structured data. In this paper, we propose a novel multiscale representation system for graph data, called decimated framelets, which form a localized tight frame on the graph. The decimated framelet system allows storage of the graph data representation on a coarse-grained chain and processes the graph data at multi scales where at each scale, the data is stored at a subgraph. Based on this, we then establish decimated G-framelet transforms for the decomposition and reconstruction of the graph data at multi resolutions via a constructive data-driven filter bank. The graph framelets are built on a chain-based orthonormal basis that supports fast graph Fourier transforms. From this, we give a fast algorithm for the decimated G-framelet transforms, or FGT, that has linear computational complexity O(N) for a graph of size N. The theory of decimated framelets and FGT is verified with numerical examples for random graphs. The effectiveness is demonstrated by real-world applications, including multiresolution analysis for traffic network, and graph neural networks for graph classification tasks.
Here we consider the speed at which quantum information can be transferred between the nodes of a linear network. Because such nodes are linear oscillators, this speed is also important in the cooling and state preparation of mechanical oscillators, as well as frequency conversion. We show that if there is no restriction on the size of the linear coupling between two oscillators, then there exist control protocols that will swap their respective states with high fidelity within a time much less than a single oscillation period. Standard gradient search methods fail to find these fast protocols. We were able to do so by augmenting standard search methods with a path-tracing technique, demonstrating that this technique has remarkable power to solve time-optimal control problems, as well as confirming the highly challenging nature of these problems. As a further demonstration of the power of path-tracing, first introduced by Moore-Tibbets et al. [Phys. Rev. A 86, 062309 (2012)], we apply it to the generation of entanglement in a linear network.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
