Schrödingerization based Quantum Circuits for Maxwell's Equation with time-dependent source terms

• URL: http://arxiv.org/abs/2411.10999v1
• Date: Sun, 17 Nov 2024 08:15:37 GMT
• Title: Schrödingerization based Quantum Circuits for Maxwell's Equation with time-dependent source terms
• Authors: Chuwen Ma, Shi Jin, Nana Liu, Kezhen Wang, Lei Zhang,
• Abstract summary: 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.
• Score: 24.890270804373824
• License:
• Abstract: The Schr\"odingerisation method combined with the autonomozation technique in \cite{cjL23} converts general non-autonomous linear differential equations with non-unitary dynamics into systems of autonomous Schr\"odinger-type equations, via the so-called warped phase transformation that maps the equation into two higher dimension. Despite the success of Schr\"odingerisation techniques, they typically require the black box of the sparse Hamiltonian simulation, suitable for continuous-variable based analog quantum simulation. For qubit-based general quantum computing one needs to design the quantum circuits for practical implementation. This paper explicitly constructs a quantum circuit for Maxwell's equations with perfect electric conductor (PEC) boundary conditions and time-dependent source terms, based on Schr\"odingerization and autonomozation, with corresponding computational complexity analysis. Through initial value smoothing and high-order approximation to the delta function, the increase in qubits from the extra dimensions only requires minor rise in computational complexity, almost $\log\log {1/\varepsilon}$ where $\varepsilon$ is the desired precision. Our analysis demonstrates that quantum algorithms constructed using Schr\"odingerisation exhibit polynomial acceleration in computational complexity compared to the classical Finite Difference Time Domain (FDTD) format.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Circuits for the heat equation with physical boundary conditions via Schrodingerisation [33.76659022113328]
  This paper explores the explicit design of quantum circuits for quantum simulation of partial differential equations (PDEs) with physical boundary conditions. We present two methods for handling the inhomogeneous terms arising from time-dependent physical boundary conditions. We then apply the quantum simulation technique from [CJL23] to transform the resulting non-autonomous system to an autonomous system in one higher dimension.
  arXiv  Detail & Related papers  (2024-07-22T03:52:14Z)
• Quantum Circuits for partial differential equations via Schrödingerisation [26.7034263292622]
  We present implementation of a quantum algorithm for general PDEs using Schr"odingerisation techniques. We provide examples of the heat equation, and the advection equation approximated by the upwind scheme.
  arXiv  Detail & Related papers  (2024-03-15T05:42:03Z)
• Boundary Treatment for Variational Quantum Simulations of Partial Differential Equations on Quantum Computers [1.6318838452579472]
  The paper presents a variational quantum algorithm to solve initial-boundary value problems described by partial differential equations. The approach uses classical/quantum hardware that is well suited for quantum computers of the current noisy intermediate-scale quantum era.
  arXiv  Detail & Related papers  (2024-02-28T18:19:33Z)
• Dilation theorem via Schr\"odingerisation, with applications to the quantum simulation of differential equations [29.171574903651283]
  Nagy's unitary dilation theorem in operator theory asserts the possibility of dilating a contraction into a unitary operator. In this study, we demonstrate the viability of the recently devised Schr"odingerisation approach.
  arXiv  Detail & Related papers  (2023-09-28T08:55:43Z)
• Verifiably Exact Solution of the Electronic Schr\"odinger Equation on Quantum Devices [0.0]
  We present an algorithm that yields verifiably exact solutions of the many-electron Schr"odinger equation. We demonstrate the algorithm on both quantum simulators and noisy quantum computers.
  arXiv  Detail & Related papers  (2023-03-01T19:00:00Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• On optimization of coherent and incoherent controls for two-level quantum systems [77.34726150561087]
  This article considers some control problems for closed and open two-level quantum systems. The closed system's dynamics is governed by the Schr"odinger equation with coherent control. The open system's dynamics is governed by the Gorini-Kossakowski-Sudarshan-Lindblad master equation.
  arXiv  Detail & Related papers  (2022-05-05T09:08:03Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• 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)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)

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.