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

Acta Physica Polonica A

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

Marcin Ostrowski

Published Jun 1, 2020• 2 citations
Publisher

Abstract

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.

DOI
10.12693/aphyspola.137.1182

Related papers

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

Marcin Ostrowski

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).

EPJ Quantum Technology•Feb 22, 2024•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

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

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

Simulation of Quantum Resonance in the Quantum Register

Marcin Ostrowski

In this paper, we examine whether a quantum computer can efficiently simulate resonant interaction between a pair of two-level quantum systems. We present an algorithm for simulating time evolution of such a system, implemented on standard two-input gates. We study the influence of accuracy of gates and decoherence on the quality of results.

Journal of Applied Computer Science•Oct 31, 2019•0 citations

Quantum simulation of the single-particle Schrödinger equation

Giuliano Benenti, G. Strini

The nature of a quantum computer is described in the concrete context of a quantum simulator of the single-particle Schrödinger equation. We show that a register of 6–10 qubits is sufficient to realize a useful quantum simulator capable of efficiently solving standard quantum mechanical problems.

arXiv:0709.1704•American Journal of Physics•Jun 10, 2008•96 citations
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).
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.