3 citations · 3 across the 2 of their papers we have counts for
6 papers · 1 filter
Limitations of Fault-Tolerant Quantum Linear System Solvers for Quantum Power Flow
Parikshit Pareek, Abhijith Jayakumar, Carleton Coffrin +1
Quantum computers hold promise for solving problems intractable for classical computers, especially those with high time or space complexity. Practical quantum advantage can be sai…
Cost of Emulating a Small Quantum Annealing Problem in the Circuit-Model
Javier Gonzalez-Conde, Zachary Morrell, Marc Vuffray +2
Demonstrations of quantum advantage for certain sampling problems have generated considerable excitement for quantum computing and have further spurred the development of circuit-m…
Classical Criticality via Quantum Annealing
Pratik Sathe, Andrew D. King, Susan M. Mniszewski +3
Quantum annealing provides a powerful platform for simulating magnetic materials and realizing statistical physics models, presenting a compelling alternative to classical Monte Ca…
Autoregressive pairwise Graphical Models efficiently find ground state representations of stoquastic Hamiltonians
Yuchen Pang, Abhijith Jayakumar, Evan McKinney +3
We introduce Autoregressive Graphical Models (AGMs) as an Ansatz for modeling the ground states of stoquastic Hamiltonians. Exact learning of these models for smaller systems show…
Leveraging Quantum Computing for Accelerated Classical Algorithms in Power Systems Optimization
Rosemary Barrass, Harsha Nagarajan, Carleton Coffrin
The recent advent of commercially available quantum annealing hardware (QAH) has expanded opportunities for research into quantum annealing-based algorithms. In the domain of power…
Learning response functions of analog quantum computers: analysis of neutral-atom and superconducting platforms
Cenk Tüysüz, Abhijith Jayakumar, Carleton Coffrin +2
Analog quantum computation is an attractive paradigm for the simulation of time-dependent quantum systems. Programmable analog quantum computers have been realized in hardware usin…