Related papers: Solving the Transient Dyson Equation with Quasilin…
Recently, a nonlinear Poisson equation has been introduced to model nonlinear and nonlocal hyperpolarization effects in electrostatic solute-solvent interaction for biomolecular solvation analysis. Due to a strong nonlinearity associated…
A numerical technique used to solve boundary value problems is modified to find periodic steady-state solutions of nonautonomous dynamical systems. The technique uses a matrix representation of the time derivative obtained through…
Correspondence problems are often modelled as quadratic optimization problems over permutations. Common scalable methods for approximating solutions of these NP-hard problems are the spectral relaxation for non-convex energies and the…
A novel tensor-based formula for solving the linear systems involving Kronecker sum is proposed. Such systems are directly related to the matrix and tensor forms of Sylvester equation. The new tensor-based formula demonstrates the…
Building on the established methods for superconducting circuit quantization, we present a new theoretical framework for approximate numerical simulation of Josephson quantum circuits. Simulations based on this framework provide access to a…
Many methods solve Poisson equations by using grid techniques which discretize the problem in each dimension. Most of these algorithms are subject to the curse of dimensionality, so that they need exponential runtime. In the paper "Quantum…
We present a hybrid numerical-quantum method for solving the Poisson equation under homogeneous Dirichlet boundary conditions, leveraging the Quantum Fourier Transform (QFT) to enhance computational efficiency and reduce time and space…
For one-dimensional linear kinetic equations analytical solutions of problems about moderately strong evaporation (condensation), when frequency of collisions of molecules is constant, are received . The equation and distribution function…
Kinetic simulations of collisionless (or weakly collisional) plasmas using the Vlasov equation are often infeasible due to high resolution requirements and the exponential scaling of computational cost with respect to dimension. Recently,…
We present a semi-classical method for determining the effective low-energy quantum Hamiltonian of weakly anharmonic superconducting circuits containing mesoscopic Josephson junctions coupled to electromagnetic environments made of an…
We consider the solution of Matrix Dyson Equation $-M\left(z\right)^{-1} = z + \mathcal{S}\left(M\left(z\right)\right)$, where entries of the linear operator $\mathcal{S}: \mathbb{C}^{N\times N} \rightarrow \mathbb{C}^{N\times N}$ decay…
By their very nature, field-theoretical Hamiltonians are derived in momentum representation. To solve the corresponding integro-differential equations is more difficult than to solve the simpler differential equations in configuration space…
Nonequilibrium electrons in superconductors relax and eventually recombine into Cooper pairs. Relaxation is facilitated by electron-boson interaction and is accompanied by emission of nonequilibrium bosons. Here I solve numerically a full…
Time-dependent linear differential equations are a common type of problem that needs to be solved in classical physics. Here we provide a quantum algorithm for solving time-dependent linear differential equations with logarithmic dependence…
We consider waveform iterations for dynamical coupled problems, or more specifically, PDEs that interact through a lower dimensional interface. We want to allow for the reuse of existing codes for the subproblems, called a partitioned…
We present a derivative-based algorithm for nonlinearly constrained optimization problems that is tolerant of inaccuracies in the data. The algorithm solves a semi-smooth set of nonlinear equations that are equivalent to the first-order…
We are interested in finding a solution to the tensor complementarity problem with a strong M-tensor, which we call the M-tensor complementarity problem. We propose a lower dimensional linear equation approach to solve that problem. At each…
This paper studies the copositive optimization problem whose objective is a sparse polynomial, with linear constraints over the nonnegative orthant. We propose sparse Moment-SOS relaxations to solve it. Necessary and sufficient conditions…
A domain decomposition method for the solution of general variable-coefficient elliptic partial differential equations on regular domains is introduced. The method is based on tessellating the domain into overlapping thin slabs or shells,…
The model reduction problem for high-order multi-input, multi-output (MIMO) polynomial nonlinear systems based on moment matching is addressed. The technique of power-series decomposition is exploited: this decomposes the solution of the…