Related papers: Efficient solution of the non-unitary time-depende…
The aim of this paper is to develop new optimized Schwarz algorithms for the one dimensional Schr{\"o}dinger equation with linear or nonlinear potential. After presenting the classical algorithm which is an iterative process, we propose a…
The Imaginary Time Step (ITS) method is applied to solve the Dirac equation with the nonlocal potential in coordinate space by the ITS evolution for the corresponding Schr\"odinger-like equation for the upper component. It is demonstrated…
This paper investigates quantum simulation algorithms for the Liouville equation in geometrical optics with partial transmission and reflection at sharp interfaces, based on the Schr\"odingerization method. By means of a warped phase…
In this work we apply a procedure based on the quantum imaginary time evolution method to solve the unit-disk maximum independent set problem. Numerical simulations were performed for instances of 6, 8 and 10-qubits graphs. We have found…
We present an ab initio approach to solve the time-dependent Schr\"odinger equation to treat electron and photon impact multiple ionization of atoms or molecules. It combines the already known time scaled coordinate method with a new high…
Quantum machines are among the most promising technologies expected to provide significant improvements in the following years. However, bridging the gap between real-world applications and their implementation on quantum hardware is still…
We propose an adaptive approach in picking the wave-number parameter of absorbing boundary conditions for Schr\"{o}dinger-type equations. Based on the Gabor transform which captures local frequency information in the vicinity of artificial…
We present an efficient method to prepare states of a many-body system on quantum hardware, first isolating individual quantum numbers and then using time evolution to isolate the energy. Our method in its simplest form requires only one…
Digital quantum simulation is a promising application for quantum computers. Their free programmability provides the potential to simulate the unitary evolution of any many-body Hamiltonian with bounded spectrum by discretizing the time…
We consider the problem of learning the evolution operator for the time-dependent Schr\"{o}dinger equation, where the Hamiltonian may vary with time. Existing neural network-based surrogates often ignore fundamental properties of the…
Dirac particle dynamics is encoded as a unitary path summation rule and implemented on a qubit array, where the qubit array represents both spacetime and the fermions contained therein. The unitary path summation rule gives a quantum…
Quantum computing has emerged as a promising avenue for achieving significant speedup, particularly in large-scale PDE simulations, compared to classical computing. One of the main quantum approaches involves utilizing Hamiltonian…
In the era of quantum computing, the emergence of quantum computers and subsequent advancements have led to the development of various quantum algorithms capable of solving linear equations and eigenvalues, surpassing the pace of classical…
Simulating nonlinear classical dynamics on a quantum computer is an inherently challenging task due to the linear operator formulation of quantum mechanics. In this work, we provide a systematic approach to alleviate this difficulty by…
This report discusses two new ideas for using perturbation methods to solve the time-independent Schr\"odinger equation. The first concept begins with rewriting the perturbation equations in a form that is closely related to matrix…
We present a family of algorithms for the numerical approximation of the Schr\"odinger equation with potential concentrated at a finite set of points. Our methods belong to the so-called fast and oblivious convolution quadrature algorithms.…
We present an efficient quantum algorithm for simulating the evolution of a sparse Hamiltonian H for a given time t in terms of a procedure for computing the matrix entries of H. In particular, when H acts on n qubits, has at most a…
We use variable transformation from the real line to finite or semi-infinite spaces where we expand the regular solution of the 1D time-independent Schrodinger equation in terms of square integrable bases. We also require that the basis…
In order to exploit quantum advantages, quantum algorithms are indispensable for operating machine learning with quantum computers. We here propose an intriguing hybrid approach of quantum information processing for quantum linear…
We consider the natural generalization of the Schr\"{o}dinger equation to Markovian open system dynamics: the so-called the Lindblad equation. We give a quantum algorithm for simulating the evolution of an $n$-qubit system for time $t$…