Related papers: Improved performance in quantum transport calculat…

We investigate nonlinear transport properties of quantum conductors in response to both electrical and thermal driving forces. Within scattering approach, we determine the nonequilibrium screening potential of a generic mesoscopic system…

This note proposes rapidly convergent computational formulae for evaluating scattering kernels from radiative transfer theory. The approach used here does not rely on Legendre expansions, but rather uses exponentially convergent numerical…

We have developed a scattering-matrix approach for numerical calculation of resonant states and Q-values of a nonideal optical disk cavity of an arbitrary shape and of an arbitrary varying refraction index. The developed method has been…

The development of small-angle scattering tensor tomography has enabled the study of anisotropic nanostructures in a volume-resolved manner. It is of great value to have reconstruction methods that can handle many different nanostructural…

A general method for solving the so-called quantum inverse scattering problem (namely the reconstruction of local quantum (field) operators in term of the quantum monodromy matrix satisfying a Yang-Baxter quadratic algebra governed by an…

Spectral compressed sensing involves reconstructing a spectral-sparse signal from a subset of uniformly spaced samples, with applications in radar imaging and wireless channel estimation. By fully exploiting the signal structures, this…

The aim of the lecture is to briefly describe the mathematical background of scattering theory for two- and three-particle quantum systems. We discuss basic objects of the theory: wave and scattering operators and the corresponding…

We present a refined semiclassical approach to the Landauer conductance and Kubo conductivity of clean chaotic mesoscopic systems. We demonstrate for systems with uniformly hyperbolic dynamics that including off-diagonal contributions to…

This paper introduces an efficient algorithm for computing the general oscillatory matrix functions. These computations are crucial for solving second-order semi-linear initial value problems. The method is exploited using the scaling and…

A new O(N) algorithm based on a recursion method, in which the computational effort is proportional to the number of atoms N, is presented for calculating the inverse of an overlap matrix which is needed in electronic structure calculations…

Tensor networks are a powerful tool for many-body ground states with limited entanglement. These methods can nonetheless fail for certain time-dependent processes - such as quantum transport or quenches - where entanglement growth is linear…

We present a general mechanism to establish the existence of diffusing orbits in a large class of nearly integrable Hamiltonian systems. Our approach relies on successive applications of the `outer dynamics' along homoclinic orbits to a…

We consider the method of infinite matrix inversion in the context of quantum state reconstruction. Using this method we give rigorous proofs for reconstruction formulas for the Cahill-Glauber s-parametrized distributions and the rotated…

We develop a scattering-matrix formalism to numerically study the resonant scattering of light on generic assemblies of atoms. Protocols to eliminate the artifacts of the method and extract physical information from the numerical data are…

We investigate electron transport through clean open quantum dots (quantum billiards). We present a semiclassical theory that allows to accurately reproduce quantum transport calculations. Quantitative agreement is reached for individual…

The lack of a mechanistic framework for chemical reactions forming inorganic extended solids presents a challenge to accelerated materials discovery. We demonstrate here a combined computational and experimental methodology to tackle this…

It was recently shown that a generalization of quantum Turing machines (QTMs), in which potentials are associated with elementary steps or transitions of the computation, generates potential distributions along computation paths of states…

Efficient comparison of spherical probability distributions becomes important in fields such as computer vision, geosciences, and medicine. Sliced optimal transport distances, such as spherical and stereographic spherical sliced Wasserstein…

Combinatorial optimization is considered a promising class of problems in which quantum computers can show significant advantages. However, problems of practical relevance typically have more variables than current or foreseeable quantum…

The Gromov-Wasserstein distance is a notable extension of optimal transport. In contrast to the classic Wasserstein distance, it solves a quadratic assignment problem that minimizes the pair-wise distance distortion under the transportation…