Monika Wolfmayr
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Monika Wolfmayr has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Ulrich Langer
Institute of Numerical Mathematics JKU Linz Austria
5 shared publications Sergey Repin
V. A. Steklov Institute of Mathematics in St. Petersburg, St. Petersburg, Russia; Department of Scientific Computing, University of Jyväskylä, Jyväskylä, Finland
2 shared publications- Sergey Repin
St.Petersburg Department of the Steklov Institute of Mathematics, St.Petersburg, Russia
2 shared publications - Antti Penttilä
University of Helsinki
1 shared publication - Ilkka Pölönen
University of Jyväskylä
1 shared publication - Jaan Praks
Department of Electronics and Nanoengineering, Aalto University, Espoo, Finland
1 shared publication
Latest Publications
- Open Access
- 6 August 2026
- Published by Springer Nature in Discover Education
- Vol. 5 (1)
Implementing Shor’s algorithm in a quantum computing simulation environment for educational purposes
- 6 August 2026
- Published by Springer Nature in Discover Education
- Vol. 5 (1)
Open AccessImplementing Shor’s algorithm in a quantum computing simulation environment for educational purposes
- Open Access
- 5 July 2026
- Published by War Studies University in Security and Defence Quarterly
- Vol. 54 (2)
Algorithms and methods for cybersecurity of critical infrastructures in quantum computing: A scoping literature review
Information technology is vital in handling critical infrastructures, such as power grids, water supplies, healthcare, transportation networks, and infrastructures in space. Quantum computing has potential to revolutionise critical infrastructures by enabling faster optimisation, simulation, and data analysis for complex systems. The adoption of quantum technologies demands the reconsideration of cybersecurity protocols to mitigate quantum-era threats. Along with the technological progress in quantum computing, there is a risk of cyberattacks leading to research questions, asking: what new quantum computing algorithms are being designed to secure critical infrastructures; how they compare to conventional methods; how quantum computing algorithms are being designed to enhance the reliability of critical infrastructures; and what quantum computing methods are emerging for ensuring the stability and accuracy of computations critical to infrastructure management? This work focuses on answering these research questions by presenting a scoping review conducted by considering 420 research articles. The scoping review shows the possibilities that can be achieved by implementing various algorithms and methods for cybersecurity. The study encircles many categories, such as optimisation, security, networking, algorithms, protocols, communication, power systems, and space science, and shows that quantum computing can enhance their protection. This study discusses techniques for the cybersecurity of critical infrastructures in quantum computing and presents results on infrastructure analysis. We targeted various research phrases regarding the research questions mentioned about algorithms and methods for cybersecurity of critical infrastructure in quantum computing. This work calls for the reader to consider the various ways to protect critical infrastructures from different threats, including cyberattacks.
- 5 July 2026
- Published by War Studies University in Security and Defence Quarterly
- Vol. 54 (2)
Open AccessAlgorithms and methods for cybersecurity of critical infrastructures in quantum computing: A scoping literature review
Information technology is vital in handling critical infrastructures, such as power grids, water supplies, healthcare, transportation networks, and infrastructures in space. Quantum computing has potential to revolutionise critical infrastructures by enabling faster optimisation, simulation, and data analysis for complex systems. The adoption of quantum technologies demands the reconsideration of cybersecurity protocols to mitigate quantum-era threats. Along with the technological progress in quantum computing, there is a risk of cyberattacks leading to research questions, asking: what new quantum computing algorithms are being designed to secure critical infrastructures; how they compare to conventional methods; how quantum computing algorithms are being designed to enhance the reliability of critical infrastructures; and what quantum computing methods are emerging for ensuring the stability and accuracy of computations critical to infrastructure management? This work focuses on answering these research questions by presenting a scoping review conducted by considering 420 research articles. The scoping review shows the possibilities that can be achieved by implementing various algorithms and methods for cybersecurity. The study encircles many categories, such as optimisation, security, networking, algorithms, protocols, communication, power systems, and space science, and shows that quantum computing can enhance their protection. This study discusses techniques for the cybersecurity of critical infrastructures in quantum computing and presents results on infrastructure analysis. We targeted various research phrases regarding the research questions mentioned about algorithms and methods for cybersecurity of critical infrastructure in quantum computing. This work calls for the reader to consider the various ways to protect critical infrastructures from different threats, including cyberattacks.
- Open Access
- 25 June 2025
- Published by Academic Conferences and Publishing International Ltd in European Conference on Cyber Warfare and Security
- Vol. 24 (1) , 698-705
The Utilization of Quantum Computing for AI Applications in Classical IT Network Environments
Quantum computing is a new technological discovery that has the potential to transform industries based on high computational capabilities. This work explores how quantum computing will be integrated into AI applications and what impacts it will have on IT networks. A review of the recent literature shows that IT networks need to be upgraded to receive quantum-enhanced AI algorithms, as they require more computation power and faster real-time processing. It covers three major topics: the enabling of quantum AI applications, the role of QRC (quantum reservoir computing) in IT networking, and the challenges concerning the protocols of quantum communication, such as QKD (quantum key distribution). Network architectures of today’s state of the art will have to evolve toward enabling quantum-enabled AI, primarily regarding processing speed and interaction between the quantum and classical systems. This work, therefore, wishes to explain how such technological advances could influence AI applications and tune IT networks. We discuss the following questions: How can IT networks support the exploitation of quantum computing for AI applications? What effects do the dynamics and symmetries of quantum reservoir computing have on IT networks? Which IT networks can adapt to the challenges introduced by quantum computing technologies? The scope and depth of contributions reviewed in the articles together suggest huge potential for quantum computing in optimizing machine learning processes and IT networks with improved data handling and network management. At the same time, these ambitions are underlined by scaling concerns related to quantum hardware and qubit stabilization, and finally, the relative easiness with which quantum-classical computing is retrofitted into existing IT infrastructures. The findings suggest that hybrid quantum-classical systems will be essential in future IT infrastructure; efficiency and scalability will have to balance with security concerns in quantum computing environments.
- 25 June 2025
- Published by Academic Conferences and Publishing International Ltd in European Conference on Cyber Warfare and Security
- Vol. 24 (1) , 698-705
Open AccessThe Utilization of Quantum Computing for AI Applications in Classical IT Network Environments
Quantum computing is a new technological discovery that has the potential to transform industries based on high computational capabilities. This work explores how quantum computing will be integrated into AI applications and what impacts it will have on IT networks. A review of the recent literature shows that IT networks need to be upgraded to receive quantum-enhanced AI algorithms, as they require more computation power and faster real-time processing. It covers three major topics: the enabling of quantum AI applications, the role of QRC (quantum reservoir computing) in IT networking, and the challenges concerning the protocols of quantum communication, such as QKD (quantum key distribution). Network architectures of today’s state of the art will have to evolve toward enabling quantum-enabled AI, primarily regarding processing speed and interaction between the quantum and classical systems. This work, therefore, wishes to explain how such technological advances could influence AI applications and tune IT networks. We discuss the following questions: How can IT networks support the exploitation of quantum computing for AI applications? What effects do the dynamics and symmetries of quantum reservoir computing have on IT networks? Which IT networks can adapt to the challenges introduced by quantum computing technologies? The scope and depth of contributions reviewed in the articles together suggest huge potential for quantum computing in optimizing machine learning processes and IT networks with improved data handling and network management. At the same time, these ambitions are underlined by scaling concerns related to quantum hardware and qubit stabilization, and finally, the relative easiness with which quantum-classical computing is retrofitted into existing IT infrastructures. The findings suggest that hybrid quantum-classical systems will be essential in future IT infrastructure; efficiency and scalability will have to balance with security concerns in quantum computing environments.
- 25 April 2025
- Published by Springer Nature
- p. 396-405
Using Neural Networks to Approximate Distance of Possible Solutions of Uncertain Poisson Equation
- 25 April 2025
- Published by Springer Nature
- p. 396-405
Using Neural Networks to Approximate Distance of Possible Solutions of Uncertain Poisson Equation
- Open Access
- 4 March 2025
- Published by MDPI AG in Remote Sensing
- Vol. 17 (5) , 899
Lossless Hyperspectral Image Compression in Comet Interceptor and Hera Missions with Restricted Bandwith
Lossless image compression is vital for missions with limited data transmission bandwidth. Reducing file sizes enables faster transmission and increased scientific gains from transient events. This study compares two wavelet-based image compression algorithms, CCSDS 122.0 and JPEG 2000, used in the European Space Agency Comet Interceptor and Hera missions, respectively, in varying scenarios. The JPEG 2000 implementation is sourced from the JasPer library, whereas a custom implementation was written for CCSDS 122.0. The performance analysis for both algorithms consists of compressing simulated asteroid images in the visible and near-infrared spectral ranges. In addition, all test images were noise-filtered to study the effect of the amount of noise on both compression ratio and speed. The study finds that JPEG 2000 achieves consistently higher compression ratios and benefits from decreased noise more than CCSDS 122.0. However, CCSDS 122.0 produces comparable results faster than JPEG 2000 and is substantially less computationally complex. On the contrary, JPEG 2000 allows dynamic (entropy-permitting) reduction in the bit depth of internal data structures to 8 bits, halving the memory allocation, while CCSDS 122.0 always works in 16-bit mode. These results contribute valuable knowledge to the behavioral characteristics of both algorithms and provide insight for entities planning on using either algorithm on board planetary missions.
- 4 March 2025
- Published by MDPI AG in Remote Sensing
- Vol. 17 (5) , 899
Open AccessLossless Hyperspectral Image Compression in Comet Interceptor and Hera Missions with Restricted Bandwith
Lossless image compression is vital for missions with limited data transmission bandwidth. Reducing file sizes enables faster transmission and increased scientific gains from transient events. This study compares two wavelet-based image compression algorithms, CCSDS 122.0 and JPEG 2000, used in the European Space Agency Comet Interceptor and Hera missions, respectively, in varying scenarios. The JPEG 2000 implementation is sourced from the JasPer library, whereas a custom implementation was written for CCSDS 122.0. The performance analysis for both algorithms consists of compressing simulated asteroid images in the visible and near-infrared spectral ranges. In addition, all test images were noise-filtered to study the effect of the amount of noise on both compression ratio and speed. The study finds that JPEG 2000 achieves consistently higher compression ratios and benefits from decreased noise more than CCSDS 122.0. However, CCSDS 122.0 produces comparable results faster than JPEG 2000 and is substantially less computationally complex. On the contrary, JPEG 2000 allows dynamic (entropy-permitting) reduction in the bit depth of internal data structures to 8 bits, halving the memory allocation, while CCSDS 122.0 always works in 16-bit mode. These results contribute valuable knowledge to the behavioral characteristics of both algorithms and provide insight for entities planning on using either algorithm on board planetary missions.
- 28 November 2023
- Published by Walter de Gruyter GmbH in Computational Methods in Applied Mathematics
- Vol. 24 (2) , 511-528
A Posteriori Error Estimation for the Optimal Control of Time-Periodic Eddy Current Problems
This work presents the multiharmonic analysis and derivation of functional type a posteriori estimates of a distributed eddy current optimal control problem and its state equation in a time-periodic setting. The existence and uniqueness of the solution of a weak space-time variational formulation for the optimality system and the forward problem are proved by deriving inf-sup and sup-sup conditions. Using the inf-sup and sup-sup conditions, we derive guaranteed, sharp and fully computable bounds of the approximation error for the optimal control problem and the forward problem in the functional type a posteriori estimation framework. We present here the first computational results on the derived estimates.
- 28 November 2023
- Published by Walter de Gruyter GmbH in Computational Methods in Applied Mathematics
- Vol. 24 (2) , 511-528
A Posteriori Error Estimation for the Optimal Control of Time-Periodic Eddy Current Problems
This work presents the multiharmonic analysis and derivation of functional type a posteriori estimates of a distributed eddy current optimal control problem and its state equation in a time-periodic setting. The existence and uniqueness of the solution of a weak space-time variational formulation for the optimality system and the forward problem are proved by deriving inf-sup and sup-sup conditions. Using the inf-sup and sup-sup conditions, we derive guaranteed, sharp and fully computable bounds of the approximation error for the optimal control problem and the forward problem in the functional type a posteriori estimation framework. We present here the first computational results on the derived estimates.
- Open Access
- 18 August 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (16) , 9373
Parameter Optimization for Low-Rank Matrix Recovery in Hyperspectral Imaging
An approach to parameter optimization for the low-rank matrix recovery method in hyperspectral imaging is discussed. We formulate an optimization problem with respect to the initial parameters of the low-rank matrix recovery method. The performance for different parameter settings is compared in terms of computational times and memory. The results are evaluated by computing the peak signal-to-noise ratio as a quantitative measure. The potential improvement in the performance of the noise reduction method is discussed when optimizing the choice of the initial values. The optimization method is tested on standard and openly available hyperspectral data sets, including Indian Pines, Pavia Centre, and Pavia University.
- 18 August 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (16) , 9373
Open AccessParameter Optimization for Low-Rank Matrix Recovery in Hyperspectral Imaging
An approach to parameter optimization for the low-rank matrix recovery method in hyperspectral imaging is discussed. We formulate an optimization problem with respect to the initial parameters of the low-rank matrix recovery method. The performance for different parameter settings is compared in terms of computational times and memory. The results are evaluated by computing the peak signal-to-noise ratio as a quantitative measure. The potential improvement in the performance of the noise reduction method is discussed when optimizing the choice of the initial values. The optimization method is tested on standard and openly available hyperspectral data sets, including Indian Pines, Pavia Centre, and Pavia University.
- Open Access
Parameter optimization for low-rank matrix recovery in hyperspectral imaging
An approach to parameter optimization for the low-rank matrix recovery method in hyperspectral imaging is discussed. We formulate an optimization problem with respect to the initial parameters of the low-rank matrix recovery method. The performance for different parameter settings is compared in terms of computational times and memory. The results are evaluated by computing the peak signal-to-noise ratio as a quantitative measure. The potential improvement of the performance of the noise reduction method is discussed when optimizing the choice of the initial values. The optimization method is tested on standard and openly available hyperspectral data sets including Indian Pines, Pavia Centre, and Pavia University.
Open AccessParameter optimization for low-rank matrix recovery in hyperspectral imaging
An approach to parameter optimization for the low-rank matrix recovery method in hyperspectral imaging is discussed. We formulate an optimization problem with respect to the initial parameters of the low-rank matrix recovery method. The performance for different parameter settings is compared in terms of computational times and memory. The results are evaluated by computing the peak signal-to-noise ratio as a quantitative measure. The potential improvement of the performance of the noise reduction method is discussed when optimizing the choice of the initial values. The optimization method is tested on standard and openly available hyperspectral data sets including Indian Pines, Pavia Centre, and Pavia University.
- 1 September 2020
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 80 (5) , 1050-1072
Guaranteed lower bounds for cost functionals of time-periodic parabolic optimization problems
- 1 September 2020
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 80 (5) , 1050-1072
Guaranteed lower bounds for cost functionals of time-periodic parabolic optimization problems