8 papers
Proving the Limits of Quantum Power Flow
Cameron Khanpour, Samuel Talkington
This letter proves realistic grid properties limit the applicability of quantum computers for power flow. Grids that split into two large regions meeting at only a few buses, commo…
Making Every Bit Count for -Optimal State Estimation
Cameron Khanpour, Daniel Turizo, Samuel Talkington
We study the problem of controlling how a limited communication bandwidth budget is allocated across heterogeneously quantized sensor measurements. The performance criterion is the…
Admittance Matrix Concentration Inequalities for Understanding Uncertain Power Networks
Samuel Talkington, Cameron Khanpour, Rahul K. Gupta +5
This paper presents conservative probabilistic bounds for the spectrum of the admittance matrix and classical linear power flow models under uncertain network parameters; for examp…
Efficient Network Reconfiguration by Randomized Switching
Samuel Talkington, Dmitrii M. Ostrovskii, Daniel K. Molzahn
We present an algorithm that efficiently computes nearly-optimal solutions to a class of combinatorial reconfiguration problems on weighted, undirected graphs. Inspired by societal…
Differentiating Through Power Flow Solutions for Admittance and Topology Control
Samuel Talkington, Daniel Turizo, Sergio A. Dorado-Rojas +2
The power flow equations relate bus voltage phasors to power injections via the network admittance matrix. These equations are central to the key operational and protection functio…
Error Bounds for Radial Network Topology Learning from Quantized Measurements
Samuel Talkington, Aditya Rangarajan, Pedro A. de Alcântara +3
We probabilistically bound the error of a solution to a radial network topology learning problem where both connectivity and line parameters are estimated. In our model, data error…