Erik Marton Åsgrim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Erik Marton Åsgrim has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Stefano Markidis
KTH Royal Institute of Technology, Stockholm, Sweden
3 shared publications - Luca Pennati
KTH - Royal Institute of Technology, Stockholm, Sweden
2 shared publications - Marco Pasquale
KTH, Stockholm, Sweden
2 shared publications - Ales Podolnik
Institute of Plasma Physics of the CAS, Prague, Czech Republic
1 shared publication - David Tskhakaya
Institute of Plasma Physics of the Czech Academy of Sciences, U Slovanky 2525/1a, 18200 Prague, Czech Republic
1 shared publication - Erwin Laure
Max Planck Computing and Data Facility
1 shared publication
Latest Publications
- Open Access
- 26 August 2026
- Published by Elsevier in Journal of Computational Physics
- Vol. 567
Tensor network compression for fully spectral Vlasov–Poisson simulation
- 26 August 2026
- Published by Elsevier in Journal of Computational Physics
- Vol. 567
Open AccessTensor network compression for fully spectral Vlasov–Poisson simulation
- Open Access
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 133-144
Post-Moore Technologies for Plasma Simulation: A Community Roadmap
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 133-144
Open AccessPost-Moore Technologies for Plasma Simulation: A Community Roadmap
- Open Access
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 109-116
Quantum Optimization for Electromagnetics: Physics-Informed QAOA for Reconfigurable Intelligent Surfaces
Optimizing Reconfigurable Intelligent Surfaces (RIS) is a high-dimensional combinatorial challenge. Current quantum algorithms often simplify this problem by ignoring physical constraints like mutual coupling, which significantly degrades real-world performance. Rather than targeting a fully realistic RIS description, we embed progressively more physics-informed models of mutual coupling into Quadratic Unconstrained Binary Optimization (QUBO) formulations. We evaluate four Ising interaction models (Jij) for the Quantum Approximate Optimization Algorithm (QAOA), ranging from idealized phase-only to fully dense physical models. Analyzing a 5 × 5 grid, our results expose a critical trade-off between spatial pointing accuracy and quantum hardware feasibility. While complete global coupling maximizes beamforming precision, dense Hamiltonians introduce prohibitive routing overhead and complicate convergence on near-term processors. Ultimately, we demonstrate that while physics-informed quantum optimization is mathematically viable, sparse, distance-penalized models remain a necessary compromise for execution on current noisy intermediate-scale quantum (NISQ) devices.
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 109-116
Open AccessQuantum Optimization for Electromagnetics: Physics-Informed QAOA for Reconfigurable Intelligent Surfaces
Optimizing Reconfigurable Intelligent Surfaces (RIS) is a high-dimensional combinatorial challenge. Current quantum algorithms often simplify this problem by ignoring physical constraints like mutual coupling, which significantly degrades real-world performance. Rather than targeting a fully realistic RIS description, we embed progressively more physics-informed models of mutual coupling into Quadratic Unconstrained Binary Optimization (QUBO) formulations. We evaluate four Ising interaction models (Jij) for the Quantum Approximate Optimization Algorithm (QAOA), ranging from idealized phase-only to fully dense physical models. Analyzing a 5 × 5 grid, our results expose a critical trade-off between spatial pointing accuracy and quantum hardware feasibility. While complete global coupling maximizes beamforming precision, dense Hamiltonians introduce prohibitive routing overhead and complicate convergence on near-term processors. Ultimately, we demonstrate that while physics-informed quantum optimization is mathematically viable, sparse, distance-penalized models remain a necessary compromise for execution on current noisy intermediate-scale quantum (NISQ) devices.
- Open Access
- 19 February 2026
- Published by Elsevier in SSRN Electronic Journal
Tensor Network Compression for Fully Spectral Vlasov–Poisson Simulation
We propose a numerical method for kinetic plasma simulation in which the phase-space distribution function is represented by a low-rank tensor network with an adaptive level of compression. The Vlasov–Poisson system is advanced using Strang splitting, and each substep is treated spectrally in the corresponding variable. By expressing both the distribution function and the Fourier transform as tensor network objects (state and operator representations), spectral transforms are applied directly in compressed form, enabling time stepping without reconstructing the full phase-space grid. The self-consistent electric field is also computed within the tensor formalism. The charge density is obtained by contracting over velocity degrees of freedom and extracting the zero Fourier mode, which provides the source term for a spectral Poisson solver. We validate the approach on standard benchmarks, including Landau damping and the two-stream instability. Finally, we systematically study how compression parameters, including truncation tolerances and internal ranks (bond dimensions), affect momentum and energy conservation, positivity behavior, robustness to filamentation, and computational cost.
- 19 February 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessTensor Network Compression for Fully Spectral Vlasov–Poisson Simulation
We propose a numerical method for kinetic plasma simulation in which the phase-space distribution function is represented by a low-rank tensor network with an adaptive level of compression. The Vlasov–Poisson system is advanced using Strang splitting, and each substep is treated spectrally in the corresponding variable. By expressing both the distribution function and the Fourier transform as tensor network objects (state and operator representations), spectral transforms are applied directly in compressed form, enabling time stepping without reconstructing the full phase-space grid. The self-consistent electric field is also computed within the tensor formalism. The charge density is obtained by contracting over velocity degrees of freedom and extracting the zero Fourier mode, which provides the source term for a spectral Poisson solver. We validate the approach on standard benchmarks, including Landau damping and the two-stream instability. Finally, we systematically study how compression parameters, including truncation tolerances and internal ranks (bond dimensions), affect momentum and energy conservation, positivity behavior, robustness to filamentation, and computational cost.