Quantum algorithm for Electromagnetic Field Analysis

• URL: http://arxiv.org/abs/2510.03596v1
• Date: Sat, 04 Oct 2025 01:08:47 GMT
• Title: Quantum algorithm for Electromagnetic Field Analysis
• Authors: Hiroyuki Tezuka, Yuki Sato,
• Abstract summary: Quantum Hamiltonian simulation provides a framework to encode PDEs into unitary time evolution.<n>We show that logical compression can substantially mitigate the exponential growth of Hamiltonian terms for complex geometries.<n>This work highlights the feasibility of Hamiltonian-based quantum simulation for photonic systems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Partial differential equations (PDEs) are central to computational electromagnetics (CEM) and photonic design, but classical solvers face high costs for large or complex structures. Quantum Hamiltonian simulation provides a framework to encode PDEs into unitary time evolution and has potential for scalable electromagnetic analysis. We formulate Maxwell's equations in the potential representation and embed governing equations, boundary conditions, and observables consistently into Hamiltonian form. A key bottleneck is the exponential growth of Hamiltonian terms for complex geometries; we examine this issue and show that logical compression can substantially mitigate it, especially for periodic or symmetric structures. As a proof of concept, we simulate optical wave propagation through a metalens and illustrate that the method can capture wavefront shaping and focusing behavior, suggesting its applicability to design optimization tasks. This work highlights the feasibility of Hamiltonian-based quantum simulation for photonic systems and identifies structural conditions favorable for efficient execution.

Related papers

• Entropic Dynamics approach to Quantum Electrodynamics [0.0]
  Entropic dynamics (ED) is a framework that allows one to derive quantum theory as a Hamilton-Killing flow on the cotangent bundle of a statistical manifold.<n>In this paper the ED framework is extended to deal with local gauge symmetries.<n>We derive the quantum electrodynamics of radiation fields interacting with charged particles.
  arXiv  Detail & Related papers  (2025-11-24T15:51:36Z)
• Solving wave equation problems on D-Wave quantum annealers [44.99833362998488]
  We solve the one-dimensional Helmholtz equation in several scenarios using the quantum annealer provided by the D-Wave systems within a pseudospectral scheme.<n>We assess the performance of different strategies of encoding based on algebraic arguments and the adiabatic condition.
  arXiv  Detail & Related papers  (2025-07-18T08:06:43Z)
• Real-Time Scattering Processes with Continuous-Variable Quantum Computers [0.0]
  We propose a framework for simulating the real-time dynamics of quantum field theories.<n>We implement non-Gaussian operations for continuous-variable quantum computing platforms.
  arXiv  Detail & Related papers  (2025-02-03T19:11:38Z)
• Compressing Hamiltonians with ab initio downfolding for simulating strongly-correlated materials on quantum computers [1.2912607909040075]
  Ab initio downfolding has emerged as a way of deriving compressed many-body Hamiltonians.<n>We show that utilizing quantum algorithms for obtaining the properties of downfolded Hamiltonians can indeed yield high-fidelity solutions.
  arXiv  Detail & Related papers  (2024-09-18T18:00:04Z)
• Efficient explicit gate construction of block-encoding for Hamiltonians needed for simulating partial differential equations [0.6144680854063939]
  One of the most promising applications of quantum computers is solving partial differential equations (PDEs)<n>By using the Schrodingerisation technique - which converts non-conservative PDEs into Schrodinger equations - the problem can be reduced to Hamiltonian simulations.<n>This paper addresses an important gap by efficiently loading these Hamiltonians into the quantum computer through block-encoding.
  arXiv  Detail & Related papers  (2024-05-21T15:13:02Z)
• Solving reaction dynamics with quantum computing algorithms [42.408991654684876]
  We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response.<n>We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations.
  arXiv  Detail & Related papers  (2024-03-30T00:21:46Z)
• Hamiltonian simulation for hyperbolic partial differential equations by scalable quantum circuits [1.6268784011387605]
  This paper presents a method that enables us to explicitly implement the quantum circuit for Hamiltonian simulation. We show that the space and time complexities of the constructed circuit are exponentially smaller than those of conventional classical algorithms.
  arXiv  Detail & Related papers  (2024-02-28T15:17:41Z)
• Neutron-nucleus dynamics simulations for quantum computers [49.369935809497214]
  We develop a novel quantum algorithm for neutron-nucleus simulations with general potentials. It provides acceptable bound-state energies even in the presence of noise, through the noise-resilient training method. We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity scheme.
  arXiv  Detail & Related papers  (2024-02-22T16:33:48Z)
• Quantum Simulation of Boson-Related Hamiltonians: Techniques, Effective Hamiltonian Construction, and Error Analysis [4.533969990771866]
  This tutorial review focuses on encoding and simulating certain bosonic-related model Hamiltonians.<n>We discuss recently developed quantum algorithms for these interacting models and the construction of effective Hamiltonians.
  arXiv  Detail & Related papers  (2023-07-13T06:46:25Z)
• Variational Adiabatic Gauge Transformation on real quantum hardware for effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
  We introduce the Variational Adiabatic Gauge Transformation (VAGT) VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit. The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
  arXiv  Detail & Related papers  (2021-11-16T20:50:08Z)
• 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)
• QuTiP-BoFiN: A bosonic and fermionic numerical hierarchical-equations-of-motion library with applications in light-harvesting, quantum control, and single-molecule electronics [51.15339237964982]
  "hierarchical equations of motion" (HEOM) is a powerful exact numerical approach to solve the dynamics. It has been extended and applied to problems in solid-state physics, optics, single-molecule electronics, and biological physics. We present a numerical library in Python, integrated with the powerful QuTiP platform, which implements the HEOM for both bosonic and fermionic environments.
  arXiv  Detail & Related papers  (2020-10-21T07:54:56Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)

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.