Pith. sign in

REVIEW 1 cited by

A Quantum Walk Inspired Qubit Lattice Algorithm for Simulating Electromagnetic Wave Propagation and Scattering in Conservative and Dissipative Magnetized Plasmas

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.24211 v1 pith:6Q74WJXU submitted 2025-03-31 quant-ph physics.plasm-ph

classification quant-phphysics.plasm-ph
keywords quantumalgorithmequationlatticeplasma-diracunitarywalkadvantage
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Based on the Dirac representation of Maxwell equations we present an explicit, discrete space-time, quantum walk-inspired algorithm suitable for simulating the electromagnetic wave propagation and scattering from inhomogeneities within magnetized plasmas. The quantum walk is implemented on a lattice with an internal space of $n_q=4$--qubits, used to encode the classical field amplitudes. Unitary rotation gates operate within this internal space to generate the non-trivial dynamics of the free plasma-Dirac equation. To incorporate the contributions from the cyclotron and plasma density terms--manifesting as inhomogeneous potential terms--in the plasma-Dirac equation, the walk process is complemented with unitary potential operators. This leads to a unitary qubit lattice sequence that recovers the plasma-Dirac equation under a second-order accurate discretization scheme. The proposed algorithm is explicit and demonstrates, in the worst case, a polynomial quantum advantage compared to the Finite Difference Time Domain (FDTD) classical method in terms of resource requirements and error complexity. In addition, we extend the algorithm to include dissipative effects by introducing a phenomenological collision frequency between plasma species. Then, a post-selective time-marching implementation scheme is delineated, featuring a non-vanishing overall success probability and, subsequently, eliminating the need for amplitude amplification of the output state while preserving the quantum advantage.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A time-marching quantum algorithm for simulation of the nonlinear Lorenz dynamics

    quant-ph 2025-06 conditional novelty 4.0 of 10

    A recursive quantum time-marching circuit for a second-order Lorenz discretization uses a linear number of initial-state copies but an exponential number of operations and exponentially small postselection probability.

Pith tools