Related papers: Optimal block-tridiagonalization of matrices for c…
We present quantum algorithms, for Hamiltonians of linear combinations of local unitary operators, for Hamiltonian matrix-vector products and for preconditioning with the inverse of shifted reduced Hamiltonian operator that contributes to…
Electric vehicles (EVs) play a significant role in enhancing the sustainability of transportation systems. However, their widespread adoption is hindered by inadequate public charging infrastructure, particularly to support long-distance…
We establish a general mechanism for highly efficient quantum transport through finite, disordered 3D networks. It relies on the interplay of disorder with centro-symmetry and a dominant doublet spectral structure, and can be controlled by…
Despite extensive research efforts, few quantum algorithms for classical optimization demonstrate realizable quantum advantage. The utility of many quantum algorithms is limited by high requisite circuit depth and nonconvex optimization…
An efficient computational methodology is used to explore charge transport properties in chemically-modified (and randomly disordered) graphene-based materials. The Hamiltonians of various complex forms of graphene are constructed using…
Feedback-based quantum algorithms have recently emerged as potential methods for approximating the ground states of Hamiltonians. One such algorithm, the feedback-based algorithm for quantum optimization (FALQON), is specifically designed…
The calculations of electronic transport coefficients and optical properties require a very dense interpolation of the electronic band structure in reciprocal space that is computationally expensive and may have issues with band crossing…
We study the transport efficiency of excitations on complex quantum networks with loops. For this we consider sequentially growing networks with different topologies of the sequential subgraphs. This can lead either to a universal complete…
A quantum algorithm for simulating multidimensional scalar transport problems using a time-marching strategy is presented. A direct unitary block encoding of the explicit time-marching operator is constructed, resulting in the intrinsic…
Previously, transport networks are usually treated as homogeneous networks, that is, every node has the same function, simultaneously providing and requiring resources. However, some real networks, such as power grid and supply chain…
By using the properties of orthogonal polynomials, we present an exact unitary transformation that maps the Hamiltonian of a quantum system coupled linearly to a continuum of bosonic or fermionic modes to a Hamiltonian that describes a…
The exponential of block triangular matrices arises in a wide range of scientific computing applications, including exponential integrators for solving systems of ordinary differential equations, Hamiltonian systems in control theory,…
In recent years, Chebyshev polynomial expansions of tight-binding Green's functions have been successfully applied to the study of a wide range of spectral and transport properties of materials. However, the application of the Chebyshev…
We present a diagonalization method for generic matrix valued Hamiltonians based on a formal expansion in power of $\hbar $. Considering $\hbar $ as a running parameter, a differential equation connecting two diagonalization processes for…
We present a general treatment to study transport phenomena in systems described by tight-binding Hamiltonians coupled to reservoirs and with one or more time-periodic potentials. We apply this treatment to the study of transport phenomena…
We present an efficient quantum circuit for block encoding pairing Hamiltonian often studied in nuclear physics. Our block encoding scheme does not require mapping the creation and annihilation operators to the Pauli operators and…
One of the challenging scientific computing problems is topology optimization, where searching through the combinatorially complex configurations and solving the constraints of partial differential equations need to be done simultaneously.…
Building on the many existing algorithms for calculating the DC transport properties of quantum tight-binding models, we develop a systematic approach that expresses finite frequency observables in terms of the stationary Green's function…
A new approximate computational framework is proposed for computing the non-equilibrium charge density in the context of the non-equilibrium Green's function (NEGF) method for quantum mechanical transport problems. The framework consists of…
Efficient quantum circuit optimization schemes are central to quantum simulation of strongly interacting quantum many body systems. Here, we present an optimization algorithm which combines machine learning techniques and tensor network…