Schr\"odingerization based Quantum Circuits for Maxwell's Equation with time-dependent source terms

TL;DR

This paper develops a quantum circuit for Maxwell's equations with time-dependent sources using Schr"odingerization, enabling polynomial acceleration over classical methods, and analyzes its complexity and implementation details.

Contribution

It explicitly constructs a quantum circuit for Maxwell's equations with time-dependent sources based on Schr"odingerization, advancing practical quantum simulation of electromagnetic problems.

Findings

Quantum circuits for Maxwell's equations are constructed with polynomial complexity.

The method achieves near-logarithmic increase in qubits for desired precision.

Quantum algorithms show polynomial speedup over classical FDTD methods.

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.