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

arXiv:2311.15859 · Quantum

Efficient solution of the non-unitary time-dependent Schrodinger equation on a quantum computer with complex absorbing potential

M. Mangin-Brinet, Jing Zhang, Denis Lacroix A, Edgar Andres Ruiz Guzman

Published Apr 8, 2024• 10 citations
arXivHTMLPDF

Abstract

We explore the possibility of adding complex absorbing potential at the boundaries when solving the one-dimensional real-time Schrödinger evolution on a grid using a quantum computer with a fully quantum algorithm described on a n qubit register. Due to the complex potential, the evolution mixes real- and imaginary-time propagation and the wave function can potentially be continuously absorbed during the time propagation. We use the dilation quantum algorithm to treat the imaginary-time evolution in parallel to the real-time propagation. This method has the advantage of using only one reservoir qubit at a time, that is measured with a certain success probability to implement the desired imaginary-time evolution. We propose a specific prescription for the dilation method where the success probability is directly linked to the physical norm of the continuously absorbed state evolving on the mesh. We expect that the proposed prescription will have the advantage of keeping a high probability of success in most physical situations. Applications of the method are made on one-dimensional wave functions evolving on a mesh. Results obtained on a quantum computer identify with those obtained on a classical computer. We finally give a detailed discussion on the complexity of implementing the dilation matrix. Due to the local nature of the potential, for n qubits, the dilation matrix only requires 2 n CNOT and 2 n unitary rotation for each time step, whereas it would require of the order of 4 n + 1 C-NOT gates to implement it using the best-known algorithm for general unitary matrices.

DOI
10.22331/q-2024-04-08-1311

Related papers

Alternative approach to quantum imaginary time evolution

Pejman Jouzdani, Calvin W. Johnson, Eduardo R. Mucciolo +1 more

There is increasing interest in quantum algorithms (QAs) that are based on the imaginary time evolution (ITE), a successful classical numerical approach to obtain ground states. However, most of the proposals so far require heavy postprocessing computational steps on a classical computer, such as solving linear equations. Here we provide an alternative approach to implement ITE. A key feature in our approach is the use of an orthogonal basis set: the propagated state is efficiently expressed in terms of orthogonal basis states at every step of the evolution. We argue that the number of basis states needed at those steps to achieve an accurate solution can be kept on the order of $n$, the number of qubits, by controlling the precision (number of significant digits) and the imaginary time increment. The number of quantum gates per imaginary time step is estimated to be polynomial in $n$. Additionally, while in many QAs the locality of the Hamiltonian is a key assumption, in our algorithm this restriction is not required. This characteristic of our algorithm renders it useful for studying highly nonlocal systems, such as the occupation-representation nuclear shell model. We illustrate our algorithm through numerical implementation on an IBM quantum simulator.

arXiv:2208.10535•Physical Review A•Dec 26, 2022•25 citations

Matrix Inverse Free Method for Solving Quantum Electron Dynamics on Unstructured Grid

Katsuhiro Watanabe, Akihito Kikuchi

A matrix inverse free method to solve time-dependent Schrodinger equation is presented. The method is not subject to form of Hamiltonian and adopting real space grid system such as structured and unstructured grid, and achieves the order N algorithm even if we adopt unstructured grid systems to adjust complex regions. We have demonstrated some error evaluation problems that have exact solution and application in which it has non-Schrodinger type Hamiltonian, and we have successfully simulated the time-evolution of wave function for all of the case.

arXiv:physics/0206010•Jun 4, 2002•0 citations

Iteration-free digital quantum simulation of imaginary-time evolution based on the approximate unitary expansion

Jingwei Wen, Chao Zheng, Zhiguo Huang +1 more

Abstract Imaginary-time evolution plays an important role in many areas of quantum physics and has been widely applied to the ground-state determination of various Hamiltonian in the quantum computation field. In this work, we propose an iteration-free quantum algorithm in a full gate-based frame using the approximate unitary expansion to simulate the imaginary-time evolution operator, avoiding the resource overhead caused by repeated measurement for state reconstruction or complex pre-calculations in the classical computers. We detail the algorithm and analyze the complexity and related characteristics including a lower bound for ancillary qubits at a given success probability. Then an application demonstration of the algorithm in quantum chemistry with hydrogen molecule under noiseless and noisy conditions is offered. In addition, we present another imaginary-time evolution simulation method based on similar construction schemes. Our algorithms can serve as the alternative proposals for the imaginary-time evolution realization in the future fault-tolerant quantum computers.

Europhysics Letters (EPL)•Mar 1, 2023•4 citations

Imaginary time evolution of a quantum system through analytic continuation from real-time quantum simulation

Peng Guo, Anto Shibu, Joshua Lin +1 more

Though quantum computing naturally offers an advantage for simulations of real-time quantum systems, implementing Imaginary-Time Evolution (ITE) is comparatively more difficult. Nevertheless, quantum implementations of ITE are useful both in cases where classical implementations have associated sign problems, and also as an exact method of preparing eigenstates on quantum computers. In this work we present an algorithm to obtain ITE of a generic quantum Hamiltonian by performing analytic continuation of measured real-time correlation functions. We present simulations and demonstrations on IBM quantum hardware of 1D Fokker-Planck equations for classical diffusion process and imaginary-time evolution of integrated correlation functions in 1D quantum mechanical scattering as examples to demonstrate the effectiveness of the method.

quant-pharXiv:2608.19943•Aug 21, 2026•1 citation

Scattering using real-time path integrals

Wayne Nicholas Polyzou, Ekaterina S. Nathanson

Background: Path integrals are a powerful tool for solving problems in quantum theory that are not amenable to a treatment by perturbation theory. Most path integral computations require an analytic continuation to imaginary time. While imaginary time treatments of scattering are possible, imaginary time is not a natural framework for treating scattering problems. More importantly, quantum algorithms for calculating path integrals require real-time evolution.Purpose: We test a recently introduced method for performing direct calculations of scattering observables using real-time path integrals in order to understand the challenges facing real-time path integral calculations of scattering observables.Method: The computations are based on a new interpretation of the path integral as the expectation value of a potential functional on cylinder sets of continuous paths with respect to a complex probability distribution. The method can in principle be applied to arbitrary short-range potentials.Results: The method is applied to compute matrix elements of M\o{}ller wave operators applied to narrow wave packets. These are used to calculate half-shell sharp-momentum transition matrix elements for one-dimensional potential scattering. The calculations for half-shell transition operator matrix elements converge to the numerical solution of the Lippmann-Schwinger equation.Conclusions: This work presents a proof in principle that scattering observables can be computed using real-time Feynman path integrals. While the computational method is not efficient, it can be improved. It provides a laboratory for studying quantum computational algorithms that are applicable to scattering problems.

arXiv:1712.00046•Physical Review C•Jun 4, 2020•6 citations

Probabilistic imaginary-time evolution algorithm based on nonunitary quantum circuits

Hao-Nan Xie, Shi-Jie Wei, Fan Yang +4 more

Imaginary-time evolution is a powerful tool in the study of quantum physics. However, existing classical algorithms for simulating imaginary-time evolution suffer from high computational complexity as the dimension of the quantum system increases. In this study we propose a quantum algorithm for implementing imaginary-time evolution using nonunitary quantum circuits with one ancillary qubit. The success probability of our algorithm is a polynomial function of the output error and can be enhanced by reorganizing the terms of the Hamiltonian. To illustrate the practicality of our algorithm on current quantum devices, we conduct a demonstration on superconducting and trapped-ion quantum processors to calculate the ground-state energy and determine the most stable molecular structure of ${\mathrm{H}}_{2}$. Additionally, we validate the feasibility of our algorithm by numerically simulating the ground-state energies of LiH molecules and the quantum Ising chain. In contrast to existing algorithms, our method provides a systematic approach to construct the required nonunitary circuits using universal quantum gates, making it suitable for experimental implementation. Our algorithm opens up possibilities for exploring other physical phenomena such as finite-temperature properties and non-Hermitian systems.

arXiv:2210.05293•Physical Review A•May 9, 2024•19 citations
We explore the possibility of adding complex absorbing potential at the boundaries when solving the one-dimensional real-time Schrödinger evolution on a grid using a quantum computer with a fully quantum algorithm described on a n qubit register. Due to the complex potential, the evolution mixes real- and imaginary-time propagation and the wave function can potentially be continuously absorbed during the time propagation. We use the dilation quantum algorithm to treat the imaginary-time evolution in parallel to the real-time propagation. This method has the advantage of using only one reservoir qubit at a time, that is measured with a certain success probability to implement the desired imaginary-time evolution. We propose a specific prescription for the dilation method where the success probability is directly linked to the physical norm of the continuously absorbed state evolving on the mesh. We expect that the proposed prescription will have the advantage of keeping a high probability of success in most physical situations. Applications of the method are made on one-dimensional wave functions evolving on a mesh. Results obtained on a quantum computer identify with those obtained on a classical computer. We finally give a detailed discussion on the complexity of implementing the dilation matrix. Due to the local nature of the potential, for n qubits, the dilation matrix only requires 2 n CNOT and 2 n unitary rotation for each time step, whereas it would require of the order of 4 n + 1 C-NOT gates to implement it using the best-known algorithm for general unitary matrices.
There is increasing interest in quantum algorithms (QAs) that are based on the imaginary time evolution (ITE), a successful classical numerical approach to obtain ground states. However, most of the proposals so far require heavy postprocessing computational steps on a classical computer, such as solving linear equations. Here we provide an alternative approach to implement ITE. A key feature in our approach is the use of an orthogonal basis set: the propagated state is efficiently expressed in terms of orthogonal basis states at every step of the evolution. We argue that the number of basis states needed at those steps to achieve an accurate solution can be kept on the order of nnn, the number of qubits, by controlling the precision (number of significant digits) and the imaginary time increment. The number of quantum gates per imaginary time step is estimated to be polynomial in nnn. Additionally, while in many QAs the locality of the Hamiltonian is a key assumption, in our algorithm this restriction is not required. This characteristic of our algorithm renders it useful for studying highly nonlocal systems, such as the occupation-representation nuclear shell model. We illustrate our algorithm through numerical implementation on an IBM quantum simulator.
A matrix inverse free method to solve time-dependent Schrodinger equation is presented. The method is not subject to form of Hamiltonian and adopting real space grid system such as structured and unstructured grid, and achieves the order N algorithm even if we adopt unstructured grid systems to adjust complex regions. We have demonstrated some error evaluation problems that have exact solution and application in which it has non-Schrodinger type Hamiltonian, and we have successfully simulated the time-evolution of wave function for all of the case.
Abstract Imaginary-time evolution plays an important role in many areas of quantum physics and has been widely applied to the ground-state determination of various Hamiltonian in the quantum computation field. In this work, we propose an iteration-free quantum algorithm in a full gate-based frame using the approximate unitary expansion to simulate the imaginary-time evolution operator, avoiding the resource overhead caused by repeated measurement for state reconstruction or complex pre-calculations in the classical computers. We detail the algorithm and analyze the complexity and related characteristics including a lower bound for ancillary qubits at a given success probability. Then an application demonstration of the algorithm in quantum chemistry with hydrogen molecule under noiseless and noisy conditions is offered. In addition, we present another imaginary-time evolution simulation method based on similar construction schemes. Our algorithms can serve as the alternative proposals for the imaginary-time evolution realization in the future fault-tolerant quantum computers.
Though quantum computing naturally offers an advantage for simulations of real-time quantum systems, implementing Imaginary-Time Evolution (ITE) is comparatively more difficult. Nevertheless, quantum implementations of ITE are useful both in cases where classical implementations have associated sign problems, and also as an exact method of preparing eigenstates on quantum computers. In this work we present an algorithm to obtain ITE of a generic quantum Hamiltonian by performing analytic continuation of measured real-time correlation functions. We present simulations and demonstrations on IBM quantum hardware of 1D Fokker-Planck equations for classical diffusion process and imaginary-time evolution of integrated correlation functions in 1D quantum mechanical scattering as examples to demonstrate the effectiveness of the method.
Background: Path integrals are a powerful tool for solving problems in quantum theory that are not amenable to a treatment by perturbation theory. Most path integral computations require an analytic continuation to imaginary time. While imaginary time treatments of scattering are possible, imaginary time is not a natural framework for treating scattering problems. More importantly, quantum algorithms for calculating path integrals require real-time evolution.Purpose: We test a recently introduced method for performing direct calculations of scattering observables using real-time path integrals in order to understand the challenges facing real-time path integral calculations of scattering observables.Method: The computations are based on a new interpretation of the path integral as the expectation value of a potential functional on cylinder sets of continuous paths with respect to a complex probability distribution. The method can in principle be applied to arbitrary short-range potentials.Results: The method is applied to compute matrix elements of M\o{}ller wave operators applied to narrow wave packets. These are used to calculate half-shell sharp-momentum transition matrix elements for one-dimensional potential scattering. The calculations for half-shell transition operator matrix elements converge to the numerical solution of the Lippmann-Schwinger equation.Conclusions: This work presents a proof in principle that scattering observables can be computed using real-time Feynman path integrals. While the computational method is not efficient, it can be improved. It provides a laboratory for studying quantum computational algorithms that are applicable to scattering problems.
Imaginary-time evolution is a powerful tool in the study of quantum physics. However, existing classical algorithms for simulating imaginary-time evolution suffer from high computational complexity as the dimension of the quantum system increases. In this study we propose a quantum algorithm for implementing imaginary-time evolution using nonunitary quantum circuits with one ancillary qubit. The success probability of our algorithm is a polynomial function of the output error and can be enhanced by reorganizing the terms of the Hamiltonian. To illustrate the practicality of our algorithm on current quantum devices, we conduct a demonstration on superconducting and trapped-ion quantum processors to calculate the ground-state energy and determine the most stable molecular structure of H2{\mathrm{H}}_{2}H2​. Additionally, we validate the feasibility of our algorithm by numerically simulating the ground-state energies of LiH molecules and the quantum Ising chain. In contrast to existing algorithms, our method provides a systematic approach to construct the required nonunitary circuits using universal quantum gates, making it suitable for experimental implementation. Our algorithm opens up possibilities for exploring other physical phenomena such as finite-temperature properties and non-Hermitian systems.