Related papers: Evaluating matrix power series with the Cayley-Ham…
We consider the extension of the method of Gauss-Newton from complex floating-point arithmetic to the field of truncated power series with complex floating-point coefficients. With linearization we formulate a linear system where the…
We present an approach to construct appropriate and efficient emulators for Hamiltonian flow maps. Intended future applications are long-term tracing of fast charged particles in accelerators and magnetic plasma confinement configurations.…
Tensor-network methods enable probing dynamics of strongly interacting quantum many-body systems, including gauge theories, via Hamiltonian simulation, hence bypassing sign problems. They also have the potential to inform efficient…
Let $[A]: Y'=AY$ with $A\in \mathrm{M}_n (k)$ be a differential linear system. We say that a matrix $R\in {\cal M}_{n}(\bar{k})$ is a {\em reduced form} of $[A]$ if $R\in \mathfrak{g}(\bar{k})$ and there exists $P\in GL_n (\bar{k})$ such…
The general forms of Quantum Hamilton Jacobi Equation for a particle of constant mass, position dependent effective mass and non-Hermitian Effective mass Swanson model have been considered. It has been found that the said equations can be…
In this short note we collect together known results on the use of Random Matrix Theory in lattice statistical mechanics. The purpose here is two fold. Firstly the RMT analysis provides an intrinsic characterization of integrability, and…
Finding the Lie-algebraic closure of a handful of matrices has important applications in quantum computing and quantum control. For most realistic cases, the closure cannot be determined analytically, necessitating an explicit numerical…
Matrix powering is a fundamental computational primitive in linear algebra. It has widespread applications in scientific computing and engineering, and underlies the solution of time-homogeneous linear ordinary differential equations,…
Implicit score matching provides a computationally efficient approach for training diffusion models and generating high-quality samples from complex distributions. In this work, we develop a score-matching framework for SU(N) lattice gauge…
We develop a theory of semialgebra Grassmann triples via Hasse-Schmidt derivations, which formally generalizes results such as the Cayley-Hamilton theorem in linear algebra, thereby providing a unified approach to classical linear algebra…
We propose a general formulation of simplicial lattice gauge theory inspired by the finite element method. Numerical tests of convergence towards continuum results are performed for several SU(2) gauge fields. Additionaly, we perform…
We present an efficient numerical method for computing Hamiltonian matrix elements between non-orthogonal Slater determinants, focusing on the most time-consuming component of the calculation that involves a sparse array. In the usual case…
In this paper, we formally introduce the concept of a row-sum matrix over an arbitrary group $G$. When $G$ is cyclic, these types of matrices have been widely used to build uniform 2-factorizations of small Cayley graphs (or, Cayley…
Quantum simulations of lattice gauge theories offer the potential to directly study the non-perturbative dynamics of quantum chromodynamics, but naive analyses suggest that they require large computational resources. Large $N_c$ expansions…
We show that Csanky's fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LAP from the principle of linear independence. LAP is a natural…
The power method (or iteration) is a well-known classical technique that can be used to find the dominant eigenpair of a matrix. Here, we present a variational quantum circuit method for the power iteration, which can be used to find the…
The main problem in the Hamiltonian formulation of Lattice Gauge Theories is the determination of an appropriate basis avoiding the over-completeness arising from Mandelstam relations. We short-cut this problem using Harmonic analysis on…
We show how the Hamiltonian lattice loop representation can be cast straightforwardly in the path integral formalism. The procedure is general for any gauge theory. Here we present in detail the simplest case: pure compact QED. We also…
We show that in the spin-network basis it is possible to compute the matrix elements of any given operator of the Hamiltonian formulation of Lattice Gauge Theory (LGT). We give the explicit calculation for the case of the plaquette…
A novel efficient method to calculate the scattering matrix (SM) of arbitrary tight-binding Hamiltonians is proposed, including cases with multiterminal structures. In particular, the SM of two kind of fundamental structures are given,…