The ongoing energy transition requires power grid extensions to connect renewable generators to consumers and to transfer power among distant areas. The process of grid extension requires a large investment of resources and is supposed to make grid operation more robust. Yet, counter-intuitively, increasing the capacity of existing lines or adding new lines may also reduce the overall system performance and even promote blackouts due to Braess’ paradox. Braess’ paradox was theoretically modeled but not yet proven in realistically scaled power grids. Here, we present an experimental setup demonstrating Braess’ paradox in an AC power grid and show how it constrains ongoing large-scale grid extension projects. We present a topological theory that reveals the key mechanism and predicts Braessian grid extensions from the network structure. These results offer a theoretical method to understand and practical guidelines in support of preventing unsuitable infrastructures and the systemic planning of grid extensions.

Due to the increasing share of renewable energy sources in the electrical network, the focus on decarbonization has extended into other energy sectors. The gas sector is of special interest because it can offer seasonal storage capacity and additional flexibility to the electricity sector. In this paper, we present a new simulation method designed for hydrogen-enriched natural gas network simulation. It can handle different gas compositions and is thus able to accurately analyze the impact of hydrogen injections into natural gas pipelines. After describing the newly defined simulation method, we demonstrate how the simulation tool can be used to analyze a hydrogen-enriched gas pipeline network. An exemplary co-simulation of coupled power and gas networks shows that hydrogen injections are severely constrained by the gas pipeline network, highlighting the importance and necessity of considering different gas compositions in the simulation.

Graph partitioning has many applications in power systems, from decentralized state estimation to parallel simulation. Focusing on parallel simulation, optimal grid partitioning minimizes the idle time caused by different simulation times for the sub-networks and their components and reduces the overhead required to simulate the cuts. Partitioning a graph into two parts such that, for example, the cut is minimal and the sub-graphs have equal size is an NP-hard problem. In this paper, we show how optimal partitioning of a graph can be obtained using quantum annealing (QA). We show how to map the requirements for optimal splitting to a quadratic unconstrained binary optimization (QUBO) formulation and test the proposed formulation using a current D-Wave QPU. We show that the necessity to find an embedding of the QUBO on current D-Wave QPUs limits the problem size to under 200 buses and notably affects the time-to-solution. We finally discuss the implications of quantum hardware non-ideality on near term implementation in the simulation loop.