Efficient solution of the non-unitary time-dependent Schrodinger equation on a quantum computer with complex absorbing potential
arXiv:2311.15859 · doi:10.22331/q-2024-04-08-1311
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 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 qubits, the dilation matrix only requires CNOT and unitary rotation for each time step, whereas it would require of the order of C-NOT gates to implement it using the best-known algorithm for general unitary matrices.
arXiv comment11 pages, accepted for publication in Quantum
References in corpus (29)
- Noisy intermediate-scale quantum (NISQ) algorithms
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- Synthesis of Quantum Logic Circuits
- Variational ansatz-based quantum simulation of imaginary time evolution
- Quantum Algorithms for Quantum Field Theories
- Theory of variational quantum simulation
- Quantum Circuits for General Multiqubit Gates
- Simulating quantum many-body dynamics on a current digital quantum computer
- Variational quantum simulation of general processes
- Real- and imaginary-time evolution with compressed quantum circuits
- Hardware-efficient variational quantum algorithms for time evolution
- Simulating quantum mechanics on a quantum computer
- Hamiltonian Simulation Using Linear Combinations of Unitary Operations
- Digital quantum computation of fermion-boson interacting systems
- Quantum simulation of the single-particle Schrodinger equation
- Decompositions of general quantum gates
- Efficient step-merged quantum imaginary time evolution algorithm for quantum chemistry
- A general quantum algorithm for open quantum dynamics demonstrated with the Fenna-Matthews-Olson complex
- Quantum computing of fluid dynamics using the hydrodynamic Schrödinger equation
- Capturing Non-Markovian Dynamics on Near-Term Quantum Computers
- Universal simulation of Markovian open quantum systems
- Digital quantum simulation of many-body non-Markovian dynamics
- Grid-based methods for chemistry simulations on a quantum computer
- Efficient decomposition of unitary matrices in quantum circuit compilers
- Imaginary Time Propagation on a Quantum Chip
- Digital Quantum Simulation of Non-Equilibrium Quantum Many-Body Systems
- A Rudimentary Quantum Compiler(2cnd Ed.)
- Quantum simulation of real-space dynamics
- Exact boundary conditions at finite distance for the time-dependent Schrodinger equation