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:2604.25229

Hardware Realization of a Hamiltonian Simulation Algorithm for Time-Domain Maxwells Equations

Gautam Sharma, Apurva Tiwari, Niladri Gomes, Jezer Jojo, J. Eric Bracken, Jay Pathak

quant-phphysics.comp-phSubmitted Apr 28, 2026• Announced Apr 29, 2026• 0 citations
v1 · Apr 28, 2026v2 · Apr 30, 2026v3 · May 4, 2026
arXivHTMLPDF

Abstract

We present the first quantum-hardware implementation of a Hamiltonian simulation algorithm that produces signed vector-field solutions to the time-domain Maxwells equations using a Schrodingerisation-based approach.The electromagnetic fields are discretized using finite-difference operators, and the resulting non-unitary matrices are mapped to Bell-basis Trotter blocks, enabling efficient circuit construction. We introduce a measurement procedure that retrieves not only field amplitudes, but also physical directions of the electric and magnetic field values at select spatial points. Implementing this logic on quantum hardware relies on relative-phase-based sign reconstruction. Numerical results obtained using IonQ QPU, show good agreement with analytical solutions of benchmark problems in two dimensions and on simulators; in three dimensions. We further extend our approach to compute fields scattered from simple bodies, by enforcing appropriate boundary conditions. Our work lays the foundational steps towards realizing quantum-hardware solutions for computational electromagnetics.

Comments
11 pages, 5 figures

Related papers

Quantum Hamiltonian Simulation of Time-Domain Electromagnetic Fields

Emanuel Colella, Luca Bastianelli, Valter Mariani Primiani +2 more

In this work, we present a quantum-computing framework for time-domain simulation of Maxwell's equations. By defining the Riemann-Silberstein vector, Maxwell's curl equations reduce to a single Schrödinger-like evolution equation. The solution requires computing the exponential of the curl (Hamiltonian). On quantum hardware, matrix exponentials correspond to sequences of unitary gates. Therefore decomposing the Hamiltonian using the Trotter-Suzuki decomposition it is possible to simulate electrodynamics. To validate the method, we simulate the propagation of transverse-magnetic (TM) waves in a two-dimensional free-space domain. Results show accurate field propagation highlighting the potential advantage of quantum computing for solving electromagnetic problems.

International Conference on Electromagnetics in Advanced Applications (ICEAA)•Sep 8, 2025•1 citation

Quantum simulation of Maxwell’s equations via Schrödingerisation

Shi Jin, Nana Liu, Chuwen Ma

We present quantum algorithms for electromagnetic fields governed by Maxwell’s equations. The algorithms are based on the Schrödingerisation approach, which transforms any linear PDEs and ODEs with non-unitary dynamics into a system evolving under unitary dynamics, via a warped phase transformation that maps the equation into one higher dimension. In this paper, our quantum algorithms are based on either a direct approximation of Maxwell’s equations combined with Yee’s algorithm, or a matrix representation in terms of Riemann–Silberstein vectors combined with a spectral approach and an upwind scheme. We implement these algorithms with physical boundary conditions, including perfect conductor and impedance boundaries. We also solve Maxwell’s equations for a linear inhomogeneous medium, specifically the interface problem. Several numerical experiments are performed to demonstrate the validity of this approach. In addition, instead of qubits, the quantum algorithms can also be formulated in the continuous variable quantum framework, which allows the quantum simulation of Maxwell’s equations in analog quantum simulation.

ESAIM Mathematical Modelling and Numerical Analysis•Jun 11, 2024•12 citations

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

Chuwen Ma, Jin, Shi, Nana Liu +2 more

The Schrödingerisation 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ödinger-type equations, via the so-called warped phase transformation that maps the equation into two higher dimension. Despite the success of Schrödingerisation 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ödingerization 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ödingerisation exhibit polynomial acceleration in computational complexity compared to the classical Finite Difference Time Domain (FDTD) format.

arXiv:2411.10999•Nov 17, 2024•0 citations

Quantum simulation of Maxwell's equations via Schrödingersation

Shi Jin, Nana Liu, Chuwen Ma

We present quantum algorithms for electromagnetic fields governed by Maxwell's equations. The algorithms are based on the Schrödingersation approach, which transforms any linear PDEs and ODEs with non-unitary dynamics into a system evolving under unitary dynamics, via a warped phase transformation that maps the equation into one higher dimension. In this paper, our quantum algorithms are based on either a direct approximation of Maxwell's equations combined with Yee's algorithm, or a matrix representation in terms of Riemann-Silberstein vectors combined with a spectral approach and an upwind scheme. We implement these algorithms with physical boundary conditions, including perfect conductor and impedance boundaries. We also solve Maxwell's equations for a linear inhomogeneous medium, specifically the interface problem. Several numerical experiments are performed to demonstrate the validity of this approach. In addition, instead of qubits, the quantum algorithms can also be formulated in the continuous variable quantum framework, which allows the quantum simulation of Maxwell's equations in analog quantum simulation.

arXiv:2308.08408•Aug 16, 2023•3 citations

Time Domain Field Simulations on Quantum Computers via Riemann-Silberstein Formulation

Emanuel Colella, Franco Moglie, Valter Mariani Primiani +1 more

This work presents a novel approach for simulating electromagnetic (EM) wave propagation by leveraging quantum computing techniques. By reformulating Maxwell's equations through the Riemann-Silberstein formalism, we cast the problem into a Schrödinger-like framework, enabling the application of Hamiltonian simulation methods. In particular, we employ the Trotter-Suzuki decomposition to approximate the time evolution operator, facilitating efficient quantum simulation of EM wave generated by a Gaussian pulse propagating within a two-dimensional metallic cavity. Our results illustrate the potential of quantum algorithms to address complex electrodynamics problems, offering promising avenues for future advancements in electromagnetics engineering.

•May 18, 2025•0 citations

Quantum Computing for Industrial Electromagnetics: Applicability and Case Studies in Solving Maxwell's Equations

Francesco Turro, Marco Maronese, Daniele Dragoni

Computational electromagnetics plays a central role in many industrial applications but often requires substantial computational resources, particularly when fine spatial discretizations are needed. While classical approaches remain the standard, quantum computing offers the potential to accelerate large-scale simulations by encoding them with a limited number of qubits. Here, we investigate the performance and resource scaling of the Harrow-Hassidim-Lloyd (HHL) and Quantum Singular Value Transformation (QSVT) algorithms for solving linear systems generated by the finite-difference time-domain (FDTD) method, a widely adopted numerical scheme for discretizing Maxwell's equations. We benchmark their performance across representative industrial use cases, including radar propagation, lens simulations, and beamforming processes. Our results demonstrate the validity of the approaches, achieving state infidelities smaller than $2\cdot 10^{-3}$ with success probabilities greater than $10^{-3}$, compatible with practical quantum state sampling. Overall, we observe that the QSVT method consistently delivers higher accuracy. We further observe that the condition number of the linear matrix, a key factor governing the performance of quantum solvers, saturates as the number of spatial lattice points increases. This implies that the spatial grid can be scaled to realistic industrial dimensions without increasing the HHL or QSVT circuit depth due to ill-conditioned matrices.

quant-pharXiv:2608.10671•Aug 12, 2026•0 citations
We present the first quantum-hardware implementation of a Hamiltonian simulation algorithm that produces signed vector-field solutions to the time-domain Maxwells equations using a Schrodingerisation-based approach.The electromagnetic fields are discretized using finite-difference operators, and the resulting non-unitary matrices are mapped to Bell-basis Trotter blocks, enabling efficient circuit construction. We introduce a measurement procedure that retrieves not only field amplitudes, but also physical directions of the electric and magnetic field values at select spatial points. Implementing this logic on quantum hardware relies on relative-phase-based sign reconstruction. Numerical results obtained using IonQ QPU, show good agreement with analytical solutions of benchmark problems in two dimensions and on simulators; in three dimensions. We further extend our approach to compute fields scattered from simple bodies, by enforcing appropriate boundary conditions. Our work lays the foundational steps towards realizing quantum-hardware solutions for computational electromagnetics.
In this work, we present a quantum-computing framework for time-domain simulation of Maxwell's equations. By defining the Riemann-Silberstein vector, Maxwell's curl equations reduce to a single Schrödinger-like evolution equation. The solution requires computing the exponential of the curl (Hamiltonian). On quantum hardware, matrix exponentials correspond to sequences of unitary gates. Therefore decomposing the Hamiltonian using the Trotter-Suzuki decomposition it is possible to simulate electrodynamics. To validate the method, we simulate the propagation of transverse-magnetic (TM) waves in a two-dimensional free-space domain. Results show accurate field propagation highlighting the potential advantage of quantum computing for solving electromagnetic problems.
We present quantum algorithms for electromagnetic fields governed by Maxwell’s equations. The algorithms are based on the Schrödingerisation approach, which transforms any linear PDEs and ODEs with non-unitary dynamics into a system evolving under unitary dynamics, via a warped phase transformation that maps the equation into one higher dimension. In this paper, our quantum algorithms are based on either a direct approximation of Maxwell’s equations combined with Yee’s algorithm, or a matrix representation in terms of Riemann–Silberstein vectors combined with a spectral approach and an upwind scheme. We implement these algorithms with physical boundary conditions, including perfect conductor and impedance boundaries. We also solve Maxwell’s equations for a linear inhomogeneous medium, specifically the interface problem. Several numerical experiments are performed to demonstrate the validity of this approach. In addition, instead of qubits, the quantum algorithms can also be formulated in the continuous variable quantum framework, which allows the quantum simulation of Maxwell’s equations in analog quantum simulation.
The Schrödingerisation 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ödinger-type equations, via the so-called warped phase transformation that maps the equation into two higher dimension. Despite the success of Schrödingerisation 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ödingerization 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/ε\log\log {1/\varepsilon}loglog1/ε where ε\varepsilonε is the desired precision. Our analysis demonstrates that quantum algorithms constructed using Schrödingerisation exhibit polynomial acceleration in computational complexity compared to the classical Finite Difference Time Domain (FDTD) format.
We present quantum algorithms for electromagnetic fields governed by Maxwell's equations. The algorithms are based on the Schrödingersation approach, which transforms any linear PDEs and ODEs with non-unitary dynamics into a system evolving under unitary dynamics, via a warped phase transformation that maps the equation into one higher dimension. In this paper, our quantum algorithms are based on either a direct approximation of Maxwell's equations combined with Yee's algorithm, or a matrix representation in terms of Riemann-Silberstein vectors combined with a spectral approach and an upwind scheme. We implement these algorithms with physical boundary conditions, including perfect conductor and impedance boundaries. We also solve Maxwell's equations for a linear inhomogeneous medium, specifically the interface problem. Several numerical experiments are performed to demonstrate the validity of this approach. In addition, instead of qubits, the quantum algorithms can also be formulated in the continuous variable quantum framework, which allows the quantum simulation of Maxwell's equations in analog quantum simulation.
This work presents a novel approach for simulating electromagnetic (EM) wave propagation by leveraging quantum computing techniques. By reformulating Maxwell's equations through the Riemann-Silberstein formalism, we cast the problem into a Schrödinger-like framework, enabling the application of Hamiltonian simulation methods. In particular, we employ the Trotter-Suzuki decomposition to approximate the time evolution operator, facilitating efficient quantum simulation of EM wave generated by a Gaussian pulse propagating within a two-dimensional metallic cavity. Our results illustrate the potential of quantum algorithms to address complex electrodynamics problems, offering promising avenues for future advancements in electromagnetics engineering.
Computational electromagnetics plays a central role in many industrial applications but often requires substantial computational resources, particularly when fine spatial discretizations are needed. While classical approaches remain the standard, quantum computing offers the potential to accelerate large-scale simulations by encoding them with a limited number of qubits. Here, we investigate the performance and resource scaling of the Harrow-Hassidim-Lloyd (HHL) and Quantum Singular Value Transformation (QSVT) algorithms for solving linear systems generated by the finite-difference time-domain (FDTD) method, a widely adopted numerical scheme for discretizing Maxwell's equations. We benchmark their performance across representative industrial use cases, including radar propagation, lens simulations, and beamforming processes. Our results demonstrate the validity of the approaches, achieving state infidelities smaller than 2⋅10−32\cdot 10^{-3}2⋅10−3 with success probabilities greater than 10−310^{-3}10−3, compatible with practical quantum state sampling. Overall, we observe that the QSVT method consistently delivers higher accuracy. We further observe that the condition number of the linear matrix, a key factor governing the performance of quantum solvers, saturates as the number of spatial lattice points increases. This implies that the spatial grid can be scaled to realistic industrial dimensions without increasing the HHL or QSVT circuit depth due to ill-conditioned matrices.