Quantum Simulation for Quantum Dynamics with Artificial Boundary Conditions

• URL: http://arxiv.org/abs/2304.00667v1
• Date: Mon, 3 Apr 2023 00:45:08 GMT
• Title: Quantum Simulation for Quantum Dynamics with Artificial Boundary Conditions
• Authors: Shi Jin and Nana Liu and Xiantao Li and Yue Yu
• Abstract summary: It is necessary to use artificial boundary conditions (ABC) to confine quantum dynamics within a fixed domain. The introduction of ABCs alters the Hamiltonian structure of the dynamics, and existing quantum algorithms can not be directly applied. This paper utilizes a recently introduced Schr"odingerisation method that converts non-Hermitian dynamics to a Schr"odinger form.
• Score: 28.46014452281448
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum dynamics, typically expressed in the form of a time-dependent Schr\"odinger equation with a Hermitian Hamiltonian, is a natural application for quantum computing. However, when simulating quantum dynamics that involves the emission of electrons, it is necessary to use artificial boundary conditions (ABC) to confine the computation within a fixed domain. The introduction of ABCs alters the Hamiltonian structure of the dynamics, and existing quantum algorithms can not be directly applied since the evolution is no longer unitary. The current paper utilizes a recently introduced Schr\"odingerisation method (Jin et al. arXiv:2212.13969 and arXiv:2212.14703) that converts non-Hermitian dynamics to a Schr\"odinger form, for the artificial boundary problems. We implement this method for three types of ABCs, including the complex absorbing potential technique, perfectly matched layer methods, and Dirichlet-to-Neumann approach. We analyze the query complexity of these algorithms, and perform numerical experiments to demonstrate the validity of this approach. This helps to bridge the gap between available quantum algorithms and computational models for quantum dynamics in unbounded domains.

Related papers

• qHEOM: A Quantum Algorithm for Simulating Non-Markovian Quantum Dynamics Using the Hierarchical Equations of Motion [0.0]
  We introduce a quantum algorithm designed to simulate non-Markovian dynamics of open quantum systems. Our approach enables the implementation of arbitrary quantum master equations on noisy intermediate-scale quantum computers.
  arXiv  Detail & Related papers  (2024-11-18T20:41:10Z)
• Schrödingerization based Quantum Circuits for Maxwell's Equation with time-dependent source terms [24.890270804373824]
  This paper explicitly constructs a quantum circuit for Maxwell's equations with perfect electric conductor (PEC) boundary conditions. We show that quantum algorithms constructed using Schr"odingerisation exhibit acceleration in computational complexity compared to the classical Finite Difference Time Domain (FDTD) format.
  arXiv  Detail & Related papers  (2024-11-17T08:15:37Z)
• Quantum Simulation of Nonlinear Dynamical Systems Using Repeated Measurement [42.896772730859645]
  We present a quantum algorithm based on repeated measurement to solve initial-value problems for nonlinear ordinary differential equations. We apply this approach to the classic logistic and Lorenz systems in both integrable and chaotic regimes.
  arXiv  Detail & Related papers  (2024-10-04T18:06:12Z)
• Quantum computing of reacting flows via Hamiltonian simulation [13.377719901871027]
  We develop the quantum spectral and finite difference methods for simulating reacting flows in periodic and general conditions. The present quantum computing algorithms offer a one-shot'' solution for a given time without temporal discretization.
  arXiv  Detail & Related papers  (2023-12-13T04:31:49Z)
• Quantum simulation of Maxwell's equations via Schr\"odingersation [27.193565893837356]
  We present quantum algorithms for electromagnetic fields governed by Maxwell's equations. The algorithms are based on the Schr"odingersation approach. Instead of qubits, the quantum algorithms can also be formulated in the continuous variable quantum framework.
  arXiv  Detail & Related papers  (2023-08-16T14:52:35Z)
• Digital quantum simulator for the time-dependent Dirac equation using discrete-time quantum walks [0.7036032466145112]
  We introduce a quantum algorithm for simulating the time-dependent Dirac equation in 3+1 dimensions using discrete-time quantum walks. Our findings indicate that relativistic dynamics is achievable with quantum computers.
  arXiv  Detail & Related papers  (2023-05-31T05:36:57Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron Correlation [58.720142291102135]
  We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer. We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
  arXiv  Detail & Related papers  (2021-06-22T18:00:00Z)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.