Related papers: Efficient Computation of the Permanent of Block Fa…
Achieving chemical accuracy for strongly correlated molecules is a defining milestone for first-generation, fault-tolerant quantum computers, yet the factorial growth of three, four, and six-index tensor contractions in coupled-cluster…
We prove that every element of the special linear group can be represented as the product of at most six block unitriangular matrices, and that there exist matrices for which six products are necessary, independent of indexing. We present…
The Erlangian approximation of Markovian fluid queues leads to the problem of computing the matrix exponential of a subgenerator having a block-triangular, block-Toeplitz structure. To this end, we propose some algorithms which exploit the…
We investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is #P-hard in general, we show that if the rank of the Lie algebra is assumed fixed, then there…
Quantum block encoding (QBE) is a crucial step in the development of most quantum algorithms, as it provides an embedding of a given matrix into a suitable larger unitary matrix. Historically, the development of efficient techniques for QBE…
This paper presents an adaptive randomized algorithm for computing the butterfly factorization of a $m\times n$ matrix with $m\approx n$ provided that both the matrix and its transpose can be rapidly applied to arbitrary vectors. The…
Distributed sparse block codes (SBCs) exhibit compact representations for encoding and manipulating symbolic data structures using fixed-width vectors. One major challenge however is to disentangle, or factorize, the distributed…
We investigate the continuous-time dynamics of highly-entangling intermediate-scale quantum circuits in the presence of dissipation and decoherence. By compressing the Hilbert space to a time-dependent "corner" subspace that supports…
We offer a consistent dynamical formulation of stationary scattering in two and three dimensions that is based on a suitable multidimensional generalization of the transfer matrix. This is a linear operator acting in an infinite-dimensional…
A model for quantum tunnelling of a cluster comprising A identical particles, coupled by oscillator-type potential, through short-range repulsive potential barriers is introduced for the first time in the new symmetrized-coordinate…
Randomized sampling has recently been proven a highly efficient technique for computing approximate factorizations of matrices that have low numerical rank. This paper describes an extension of such techniques to a wider class of matrices…
A spectral Favard theorem for bounded banded lower Hessenberg matrices that admit a positive bidiagonal factorization is found. The large knowledge on the spectral and factorization properties of oscillatory matrices leads to this spectral…
We show that the integrable Lindblad superoperators found recently can be used to build integrable nonunitary quantum circuits with two-site gates by demonstrating that the $\check{R}$-matrices are completely positive and trace preserving.…
We introduce a simple algorithm that efficiently computes tensor products of Pauli matrices. This is done by tailoring the calculations to this specific case, which allows to avoid unnecessary calculations. The strength of this strategy is…
We present a quantum algorithm for the calculation of scattering amplitudes of massive charged scalar particles in scalar quantum electrodynamics. Our algorithm is based on continuous-variable quantum computing architecture resulting in…
We present a nonperturbative recipe for directly computing the $S$-matrix in strongly-coupled QFTs. The method makes use of spectral data obtained in a Hamiltonian framework and can be applied to a wide range of theories, including…
Let $A$ be an $n \times n$ positive definite Hermitian matrix with all eigenvalues between 1 and 2. We represent the permanent of $A$ as the integral of some explicit log-concave function on ${\Bbb R}^{2n}$. Consequently, there is a fully…
A second order accurate numerical scheme is proposed and implemented for the Landau-Lifshitz-Gilbert equation, which models magnetization dynamics in ferromagnetic materials, with large damping parameters. The main advantages of this method…
Matrix factorization techniques compute low-rank product approximations of high dimensional data matrices and as a result, are often employed in recommender systems and collaborative filtering applications. However, many algorithms for this…
We construct matrix product steady state for a class of interacting particle systems where particles do not obey hardcore exclusion, meaning each site can occupy any number of particles subjected to the global conservation of total number…