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

Open Systems & Information Dynamics

Quantum Simulation of the Dirac Particle

Marcin Ostrowski

Published Mar 1, 2015• 3 citations
Publisher

Abstract

In this paper, we examine whether a quantum computer can efficiently simulate time evolution of the Dirac particle. We consider a Gaussian wave packet scattered by a step potential. We compare the results obtained from a quantum algorithm with the results of classical simulations (Cayley's method) and analytical calculations.
DOI
10.1142/s123016121550002x

Related papers

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 the tunnel effect

Marcin Ostrowski

Abstract In this paper, we examine whether a quantum computer can efficiently simulate quantum processes such as the tunnel effect. We examine a quantum algorithm that calculates the value of transition and reflection coefficients for the Gaussian wave packet scattered on a rectangular potential. We compare the results obtained in this way with the results of classical simulations and analytical calculations

Bulletin of the Polish Academy of Sciences Technical Sciences•Jun 1, 2015•5 citations

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

Simulation of quantum dynamics of a wave packet in a semiclassical limit

K. S. Arakelov

A new algorithm for modeling quantum dynamics of wave packets in a semiclassical limit was formulated and justified. The algorithm is valid in the case of two-particle systems and in the case of a single particle in any arbitrary central potential. The profile of the wave packet depending on the time for a single wave packet evolving in a one-dimensional (1D) Morse potential was obtained by direct computer simulations using the new algorithm. The results were compared with the calculation which was previously performed using the Initial Value Representation (IVR) method.

Mathematical Models and Computer Simulations•Sep 16, 2011•0 citations

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•2 citations

A strategy for time dependent quantum mechanical calculations using a Gaussian wave packet representation of the wave function

Shin‐ichi Sawada, Robert Heather, Bret Jackson +1 more

We develop methodology for performing time dependent quantum mechanical calculations by representing the wave function as a sum of Gaussian wave packets (GWP) each characterized by a set of parameters such as width, position, momentum, and phase. The problem of computing the time evolution of the wave function is thus reduced to that of finding the time evolution of the parameters in the Gaussians. This parameter motion is determined by minimizing the error made by replacing the exact wave function in the time dependent Schrödinger equation with its Gaussian representation approximant. This leads to first order differential equations for the time dependence of the parameters, and those describing the packet position and the momentum of each packet have some resemblance with the classical equations of motion. The paper studies numerically the strategy needed to achieve the best GWP representation of time dependent processes. The issues discussed are the representation of the initial wave function, the numerical stability and the solution of the differential equations giving the evolution of the parameters, and the analysis of the final wave function. Extensive comparisons are made with an approximate method which assumes that the Gaussians are independent and their width is smaller than the length scale over which the potential changes. This approximation greatly simplifies the calculations and has the advantage of a greater resemblance to classical mechanics, thus being more intuitive. We find, however, that its range of applications is limited to problems involving localized degrees of freedom that participate in the dynamic process for a very short time. Finally we give particular attention to the notion that the GWP representation of the wave function reduces the dynamics of one quantum degree of freedom to that of a set of pseudoparticles (each represented by one packet) moving according to a pseudoclassical (i.e., classical-like) mechanics whose ‘‘phase space’’ is described by a position and momentum as well as a complex phase and width.

The Journal of Chemical Physics•Sep 15, 1985•207 citations
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).
A new algorithm for modeling quantum dynamics of wave packets in a semiclassical limit was formulated and justified. The algorithm is valid in the case of two-particle systems and in the case of a single particle in any arbitrary central potential. The profile of the wave packet depending on the time for a single wave packet evolving in a one-dimensional (1D) Morse potential was obtained by direct computer simulations using the new algorithm. The results were compared with the calculation which was previously performed using the Initial Value Representation (IVR) method.
We develop methodology for performing time dependent quantum mechanical calculations by representing the wave function as a sum of Gaussian wave packets (GWP) each characterized by a set of parameters such as width, position, momentum, and phase. The problem of computing the time evolution of the wave function is thus reduced to that of finding the time evolution of the parameters in the Gaussians. This parameter motion is determined by minimizing the error made by replacing the exact wave function in the time dependent Schrödinger equation with its Gaussian representation approximant. This leads to first order differential equations for the time dependence of the parameters, and those describing the packet position and the momentum of each packet have some resemblance with the classical equations of motion. The paper studies numerically the strategy needed to achieve the best GWP representation of time dependent processes. The issues discussed are the representation of the initial wave function, the numerical stability and the solution of the differential equations giving the evolution of the parameters, and the analysis of the final wave function. Extensive comparisons are made with an approximate method which assumes that the Gaussians are independent and their width is smaller than the length scale over which the potential changes. This approximation greatly simplifies the calculations and has the advantage of a greater resemblance to classical mechanics, thus being more intuitive. We find, however, that its range of applications is limited to problems involving localized degrees of freedom that participate in the dynamic process for a very short time. Finally we give particular attention to the notion that the GWP representation of the wave function reduces the dynamics of one quantum degree of freedom to that of a set of pseudoparticles (each represented by one packet) moving according to a pseudoclassical (i.e., classical-like) mechanics whose ‘‘phase space’’ is described by a position and momentum as well as a complex phase and width.