activity
20202024
most citedA Hybrid Quantum Algorithm for Load Flow

3 citations · 7 across the 7 of their papers we have counts for

collaborators

7 papers

quant-ph2024★ 1 cited

Quantum Algorithms for Optimal Power Flow

Sajad Fathi Hafshejani, Md Mohsin Uddin, David Neufeld +2

This paper explores the use of quantum computing, specifically the use of HHL and VQLS algorithms, to solve optimal power flow problem in electrical grids. We investigate the effec…

cs.DS2024

Forest Covers and Bounded Forest Covers

Daya Ram Gaur, Barun Gorain, Shaswati Patra +1

We study approximation algorithms for the forest cover and bounded forest cover problems. A probabilistic approximation algorithm for the forest cover problem is given using…

quant-ph2024

A hybrid quantum solver for the Lorenz system

Sajad Fathi Hafshejani, Daya Gaur, Arundhati Dasgupta +3

We develop a hybrid classical-quantum method for solving the Lorenz system. We use the forward Euler method to discretize the system in time, transforming it into a system of equat…

eess.SY2023★ 3 cited

A Hybrid Quantum Algorithm for Load Flow

David Neufeld, Sajad Fathi Hafshejani, Daya Gaur +1

The goal of the load flow study is to ensure that electrical power is delivered efficiently and reliably to end-users while maintaining the stability and security of the power syst…

quant-ph2021★ 3 cited

Conditions for Advantageous Quantum Bitcoin Mining

Robert R. Nerem, Daya R. Gaur

Our aim is to determine conditions for quantum computing technology to give rise to security risks associated with quantum Bitcoin mining. Specifically, we determine the speed and…

math.OC2021

Barzilai and Borwein conjugate gradient method equipped with a non-monotone line search technique and its application on non-negative matrix factorization

Sajad Fathi Hafshejani, Daya Gaur, Shahadat Hossain +1

In this paper, we propose a new non-monotone conjugate gradient method for solving unconstrained nonlinear optimization problems. We first modify the non-monotone line search metho…

cs.AI2020

Testing Unsatisfiability of Constraint Satisfaction Problems via Tensor Products

Daya Gaur, Muhammad Khan

We study the design of stochastic local search methods to prove unsatisfiability of a constraint satisfaction problem (CSP). For a binary CSP, such methods have been designed using…