Related papers: Efficient Computation of the Permanent of Block Fa…
A factorization of the inverse of a Hermetian positive definite matrix based on a diagonal by diagonal recurrence formulae permits the inversion of Toeplitz Block Toeplitz matrices using minimized matrix-vector products, with a complexity…
Image-based data is a popular arena for testing quantum machine learning algorithms. A crucial factor in realizing quantum advantage for these applications is the ability to efficiently represent images as quantum states. Here we present a…
We present new efficient (O(N log N)) methods for computing three quantities crucial to electronic structure calculations: the ionic potential, the electron-ion contribution to the Born-Oppenheimer forces, and the electron-ion contribution…
Partition functions of N=2 theories on the squashed 3-sphere have been recently shown to localise to matrix integrals. By explicitly evaluating the matrix integral we show that abelian partition functions can be expressed as a sum of…
One of the most promising applications of quantum computers is solving partial differential equations (PDEs). By using the Schrodingerisation technique - which converts non-conservative PDEs into Schrodinger equations - the problem can be…
A novel algorithm for producing smooth nonlinearities on digital hardware is presented. The non-linearities are inherently quadratic and have both symmetrical and asymmetrical variants. The integer (and fixed point) implementation is highly…
Analysis of quantum processes, especially in the context of noise, errors, and decoherence is essential for the improvement of quantum devices. An intuitive representation of those processes modeled by quantum channels are Pauli transfer…
Large-scale quantum computation is likely to require massive quantum error correction (QEC). QEC codes and circuits are described via the stabilizer formalism, which represents stabilizer states by keeping track of the operators that…
We consider a one-parameter family of matrix product states of spin one particles on a periodic chain and study in detail the entanglement properties of such a state. In particular we calculate exactly the entanglement of one site with the…
Complex valued systems with an indefinite matrix term arise in important applications such as for certain time-harmonic partial differential equations such as the Maxwell's equation and for the Helmholtz equation. Complex systems with…
A decision diagram (DD) is a graph-like data structure for homomorphic compression of Boolean and pseudo-Boolean functions. Over the past decades, decision diagrams have been successfully applied to verification, linear algebra, stochastic…
Square matrices appear in many machine learning problems and models. Optimization over a large square matrix is expensive in memory and in time. Therefore an economic approximation is needed. Conventional approximation approaches factorize…
We present a general formalism for the calculation of finite-width contributions to the differential production cross sections of unstable particles at hadron colliders. In this formalism, which employs an effective-theory description of…
Circulant matrices are an important family of operators, which have a wide range of applications in science and engineering related fields. They are in general non-sparse and non-unitary. In this paper, we present efficient quantum circuits…
The Fast Approximate BLock-Encoding algorithm (FABLE) is a technique to block-encode arbitrary $N\times N$ dense matrices into quantum circuits using at most $O(N^2)$ one and two-qubit gates and $\mathcal{O}(N^2\log{N})$ classical…
In [2] a new factorization for infinite Hessenberg banded matrices was introduced. In this note we prove that this kind of factorization can also be used for finite matrices. In addition, a new method for solving banded linear systems is…
We consider the quantum processor based on a chain of trapped ions to propose an architecture wherein the motional degrees of freedom of trapped ions (position and momentum) could be exploited as the computational Hilbert space. We adopt a…
The Functional Machine Calculus (FMC, Heijltjes 2022) extends the lambda-calculus with the computational effects of global mutable store, input/output, and probabilistic choice while maintaining confluent reduction and simply-typed strong…
In many problems in Computational Physics and Chemistry, one finds a special kind of sparse matrices, termed "banded matrices". These matrices, which are defined as having non-zero entries only within a given distance from the main…
In this paper we generalize N-fold integer programs and two-stage integer programs with N scenarios to N-fold 4-block decomposable integer programs. We show that for fixed blocks but variable N, these integer programs are polynomial-time…