Exploring the use of quantum computers for resilience analysis in critical infrastructure networks

Abstract Resilience analysis of networks representing critical infrastructure is a computationally hard problem, and the question arises of whether quantum computers may be beneficial for this purpose. On the way towards an answer to this problem, we map a small critical infrastructure network on a quantum network composed of dipole–dipole-coupled nodes. The latter are each equipped with up to three discrete (quantum) states, two of which support the connectivity of the network, while the third state, reachable through nondeterministic spontaneous processes, represents a ‘broken’ node. A finite ‘repair’ time is needed to restore the node. To study the dynamics of such networks on a quantum computer, we derive unitary dilations of Kraus operators governing the evolution of our open quantum network, and generate corresponding quantum circuits using the interface. We then study the population dynamics of several cases of increasing complexity on the quantum hardware. We discuss how scaling of errors is related to the depth of the quantum circuits. Ultimately, we show that open quantum systems can be used for modelling critical infrastructure, but quantum computers with much lower error rates than currently available are required for a quantitative resilience analysis.

Authors

Institutions

Publication Details

Journal
Quantum Information Processing
Published
2025-10-03
DOI
https://doi.org/10.1007/s11128-025-04947-8
Primary Topic
Network Security and Intrusion Detection
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Exploring the use of quantum computers for resilience analysis in critical infrastructure networks

Corinna Köpke, Aishvarya Kumar Jain, Andreas Buchleitner, Vyacheslav Shatokhin et al.
Quantum Information Processing
Network Security and Intrusion Detection
article

Exploring the use of quantum computers for resilience analysis in critical infrastructure networks

Corinna Köpke, Aishvarya Kumar Jain, Andreas Buchleitner, Vyacheslav Shatokhin, Alexander Stolz, M. Fehling–Kaschek, Christoph Brockt-Haßauer
article en

Abstract

Abstract Resilience analysis of networks representing critical infrastructure is a computationally hard problem, and the question arises of whether quantum computers may be beneficial for this purpose. On the way towards an answer to this problem, we map a small critical infrastructure network on a quantum network composed of dipole–dipole-coupled nodes. The latter are each equipped with up to three discrete (quantum) states, two of which support the connectivity of the network, while the third state, reachable through nondeterministic spontaneous processes, represents a ‘broken’ node. A finite ‘repair’ time is needed to restore the node. To study the dynamics of such networks on a quantum computer, we derive unitary dilations of Kraus operators governing the evolution of our open quantum network, and generate corresponding quantum circuits using the interface. We then study the population dynamics of several cases of increasing complexity on the quantum hardware. We discuss how scaling of errors is related to the depth of the quantum circuits. Ultimately, we show that open quantum systems can be used for modelling critical infrastructure, but quantum computers with much lower error rates than currently available are required for a quantitative resilience analysis.

Quantum Information ProcessingVol. 24(10)
University of Freiburg (DE), Fraunhofer Institute for High-Speed Dynamics, Ernst-Mach-Institut (DE)
Openalex Percentile: Top 68%
Network Security and Intrusion Detection
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.