5 papers
Benchmarking Hybrid Quantum-Classical Algorithms for Power Grid Optimization Problems
Igor Gaidai, Rick Mukherjee
Alternating Current Optimal Power Flow Unit Commitment (AC-OPF-UC) is a difficult mixed-integer nonlinear optimization problem that combines binary generator commitment decisions w…
A matching decomposition algorithm for simulating quantum walk Hamiltonians
Mostafa Atallah, Alvin Gonzales, Daniel Dilley +3
In this work, we present a new algorithm for generating quantum circuits that efficiently implement continuous time quantum walks on arbitrary simple sparse graphs. The algorithm,…
Efficient Sparse State Preparation via Quantum Walks
Alvin Gonzales, Rebekah Herrman, Colin Campbell +4
Continuous-time quantum walks (CTQWs) on dynamic graphs, referred to as dynamic CTQWs, are a recently introduced universal model of computation that offers a new paradigm in which…
Decomposition of Sparse Amplitude Permutation Gates with Application to Preparation of Sparse Clustered Quantum States
Igor Gaidai, Rebekah Herrman
In this work we consider a novel heuristic decomposition algorithm for -qubit gates that implement specified amplitude permutations on sparse states with non-zero amplitudes…
Quantum approximate optimization algorithm with random and subgraph phase operators
Anthony Wilkie, Igor Gaidai, James Ostrowski +1
The quantum approximate optimization algorithm (QAOA) is a promising quantum algorithm that can be used to approximately solve combinatorial optimization problems. The usual QAOA a…