Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

EPJ Quantum Technology

Application of the QDST algorithm for the Schrödinger particle simulation in the infinite potential well

Marcin Ostrowski

Published Feb 22, 2024• 2 citations
Publisher

Abstract

Abstract This paper examines whether a quantum computer can efficiently simulate the time evolution of the Schrödinger particle in a one-dimensional infinite potential well. In order to solve the Schrödinger equation in the quantum register, an algorithm based on the Quantum Discrete Sine Transform (QDST) is applied. The paper compares the results obtained in this way with the results given by the previous method (based on the QFT algorithm).

DOI
10.1140/epjqt/s40507-024-00223-3

Related papers

Simulation of Diffusion of a Single Schrödinger Particle in the Quantum Register

Marcin Ostrowski

This paper examines whether a quantum computer can efficiently simulate the evolution of the Schrödinger particle in a one-dimensional infinite potential well.The present study involves simulation of the change of the particle's state due to instant enlarging of the well's size.In order to solve the Schrödinger equation in the quantum register, an algorithm based on the Quantum Fourier Transform is applied.The paper presents an algorithm for simulating time evolution of such a system, implemented on standard two-input gates.

Acta Physica Polonica A•Jun 1, 2020•2 citations

Quantum simulations of particle scattered by a rectangular potential

Marcin Ostrowski

In this paper we examine whether a quantum computer can efficiently simulate time evolution of a one dimensional Schrödinger particle. Two cases are considered: free particle and particle dispersed on a rectangular potential. In order to simulate the Schrödinger particle, we use a quantum algorithm based on the procedure of diagonalisation of time evolution operator. The procedure of diagonalisation is based on the Quantum Fourier Transform (QFT) algorithm. The effects of simulation are presented in the form of figures. We also compare the results obtained from quantum algorithm with the results of classical simulations (Cayley's method).

Journal of Applied Computer Science•Jan 1, 2012•1 citation

Quantum Simulation of Two Interacting Schrödinger Particles

Marcin Ostrowski

In this paper, we examine whether a quantum computer can efficiently simulate time evolution of two Schrödinger particles. We consider particles interacting with each other and with an external potential. In order to solve the Schrödinger equation in the quantum register, we use an algorithm based on the quantum Fourier transform.

Open Systems & Information Dynamics•Dec 1, 2016•4 citations

Modeling Time-Independent Schrödinger Equation for an Infinite Potential Well Using Numerov and Matrix Methods

Dalal Y. Saad, Fawzi A. Ikraiam

The objective of this study is to numerically solve and apply two approximate methods to investigate the Time Independent Schrödinger Equation (TISE) in one dimension for an infinite potential square well. These two numerical methods are the Numerov Method (NM) and Matrix Method (MM). As a simulation tool, MATLAB, a high-level programming language and an efficient simulation tool, is used for modeling and solving TISE in one dimension. Exact analytical solutions for these potential functions are obtained and compared with numerical solutions and computational techniques. The energy eigenvalues and Eigen functions of a particle (such as an electron) restricted to move inside this potential are discussed as an illustration. The numerically calculated energies of several states with increasing numbers of points were obtained from both methods and compared with the simulation results of the exact solution. As an exemplary case, the first five wave functions are accurately determined numerically where the discreteness is found since the wave function vanishes at the boundary. The obtained results show very good agreement and the similarity is clearly confirmed between the three cases. This agreement confirms that this approach was highly accurate and efficient. The accuracy and the convergence of the numerical obtained results were easily checked. The stability of these methods is due to the fact that there are no restrictions on the time steps to be taken. The merits of these numerical methods are to avoid a huge expense in time when solving Schrödinger equation.

Libyan Journal of Science &Technology•Mar 1, 2025•0 citations

Quantum simulation of real-space dynamics

Andrew M. Childs, Jiaqi Leng, Tongyang Li +2 more

Quantum simulation is a prominent application of quantum computers. While there is extensive previous work on simulating finite-dimensional systems, less is known about quantum algorithms for real-space dynamics. We conduct a systematic study of such algorithms. In particular, we show that the dynamics of a d -dimensional Schrödinger equation with η particles can be simulated with gate complexity O~(ηdFpoly(log⁡(g′/ϵ))) , where ϵ is the discretization error, g′ controls the higher-order derivatives of the wave function, and F measures the time-integrated strength of the potential. Compared to the best previous results, this exponentially improves the dependence on ϵ and g′ from poly(g′/ϵ) to poly(log⁡(g′/ϵ)) and polynomially improves the dependence on T and d , while maintaining best known performance with respect to η . For the case of Coulomb interactions, we give an algorithm using η3(d+η)Tpoly(log⁡(ηdTg′/(Δϵ)))/Δ one- and two-qubit gates, and another using η3(4d)d/2Tpoly(log⁡(ηdTg′/(Δϵ)))/Δ one- and two-qubit gates and QRAM operations, where T is the evolution time and the parameter Δ regulates the unbounded Coulomb interaction. We give applications to several computational problems, including faster real-space simulation of quantum chemistry, rigorous analysis of discretization error for simulation of a uniform electron gas, and a quadratic improvement to a quantum algorithm for escaping saddle points in nonconvex optimization.

arXiv:2203.17006•Quantum•Nov 17, 2022•55 citations

Simulation of the Schrödinger particle non-elastic scattering with emission of photon in the quantum register

Marcin Ostrowski

This paper investigates whether a quantum computer can efficiently simulate the non-elastic scattering of the Schrödinger particle on a stationary excitable shield. The return of the shield to the ground state is caused by photon emission. An algorithm is presented for simulating the time evolution of such a process, implemented on standard two-input gates. The algorithm is used for the computation of elastic and non-elastic scattering probabilities. The results obtained by our algorithm are compared with those obtained using the standard Cayley’s method.

Bulletin of the Polish Academy of Sciences Technical Sciences•Oct 31, 2020•1 citation
Abstract This paper examines whether a quantum computer can efficiently simulate the time evolution of the Schrödinger particle in a one-dimensional infinite potential well. In order to solve the Schrödinger equation in the quantum register, an algorithm based on the Quantum Discrete Sine Transform (QDST) is applied. The paper compares the results obtained in this way with the results given by the previous method (based on the QFT algorithm).
This paper examines whether a quantum computer can efficiently simulate the evolution of the Schrödinger particle in a one-dimensional infinite potential well.The present study involves simulation of the change of the particle's state due to instant enlarging of the well's size.In order to solve the Schrödinger equation in the quantum register, an algorithm based on the Quantum Fourier Transform is applied.The paper presents an algorithm for simulating time evolution of such a system, implemented on standard two-input gates.
In this paper we examine whether a quantum computer can efficiently simulate time evolution of a one dimensional Schrödinger particle. Two cases are considered: free particle and particle dispersed on a rectangular potential. In order to simulate the Schrödinger particle, we use a quantum algorithm based on the procedure of diagonalisation of time evolution operator. The procedure of diagonalisation is based on the Quantum Fourier Transform (QFT) algorithm. The effects of simulation are presented in the form of figures. We also compare the results obtained from quantum algorithm with the results of classical simulations (Cayley's method).
The objective of this study is to numerically solve and apply two approximate methods to investigate the Time Independent Schrödinger Equation (TISE) in one dimension for an infinite potential square well. These two numerical methods are the Numerov Method (NM) and Matrix Method (MM). As a simulation tool, MATLAB, a high-level programming language and an efficient simulation tool, is used for modeling and solving TISE in one dimension. Exact analytical solutions for these potential functions are obtained and compared with numerical solutions and computational techniques. The energy eigenvalues and Eigen functions of a particle (such as an electron) restricted to move inside this potential are discussed as an illustration. The numerically calculated energies of several states with increasing numbers of points were obtained from both methods and compared with the simulation results of the exact solution. As an exemplary case, the first five wave functions are accurately determined numerically where the discreteness is found since the wave function vanishes at the boundary. The obtained results show very good agreement and the similarity is clearly confirmed between the three cases. This agreement confirms that this approach was highly accurate and efficient. The accuracy and the convergence of the numerical obtained results were easily checked. The stability of these methods is due to the fact that there are no restrictions on the time steps to be taken. The merits of these numerical methods are to avoid a huge expense in time when solving Schrödinger equation.
Quantum simulation is a prominent application of quantum computers. While there is extensive previous work on simulating finite-dimensional systems, less is known about quantum algorithms for real-space dynamics. We conduct a systematic study of such algorithms. In particular, we show that the dynamics of a d -dimensional Schrödinger equation with η particles can be simulated with gate complexity O~(ηdFpoly(log⁡(g′/ϵ))) , where ϵ is the discretization error, g′ controls the higher-order derivatives of the wave function, and F measures the time-integrated strength of the potential. Compared to the best previous results, this exponentially improves the dependence on ϵ and g′ from poly(g′/ϵ) to poly(log⁡(g′/ϵ)) and polynomially improves the dependence on T and d , while maintaining best known performance with respect to η . For the case of Coulomb interactions, we give an algorithm using η3(d+η)Tpoly(log⁡(ηdTg′/(Δϵ)))/Δ one- and two-qubit gates, and another using η3(4d)d/2Tpoly(log⁡(ηdTg′/(Δϵ)))/Δ one- and two-qubit gates and QRAM operations, where T is the evolution time and the parameter Δ regulates the unbounded Coulomb interaction. We give applications to several computational problems, including faster real-space simulation of quantum chemistry, rigorous analysis of discretization error for simulation of a uniform electron gas, and a quadratic improvement to a quantum algorithm for escaping saddle points in nonconvex optimization.
This paper investigates whether a quantum computer can efficiently simulate the non-elastic scattering of the Schrödinger particle on a stationary excitable shield. The return of the shield to the ground state is caused by photon emission. An algorithm is presented for simulating the time evolution of such a process, implemented on standard two-input gates. The algorithm is used for the computation of elastic and non-elastic scattering probabilities. The results obtained by our algorithm are compared with those obtained using the standard Cayley’s method.