Adapting Quantum Approximation Optimization Algorithm (QAOA) for Unit Commitment

@article{Koretsky2021AdaptingQA,
  title={Adapting Quantum Approximation Optimization Algorithm (QAOA) for Unit Commitment},
  author={Samantha Koretsky and Pranav Gokhale and Jonathan M. Baker and Joshua Viszlai and Honghao Zheng and Niroj Gurung and Ryan Burg and Esa Aleksi Paaso and Amin Khodaei and Rozhin Eskandarpour and Frederic T. Chong},
  journal={2021 IEEE International Conference on Quantum Computing and Engineering (QCE)},
  year={2021},
  pages={181-187}
}
  • S. KoretskyPranav Gokhale F. Chong
  • Published 1 October 2021
  • Computer Science
  • 2021 IEEE International Conference on Quantum Computing and Engineering (QCE)
In the present Noisy Intermediate-Scale Quantum (NISQ), hybrid algorithms that leverage classical resources to reduce quantum costs are particularly appealing. We formulate and apply such a hybrid quantum-classical algorithm to a power system optimization problem called Unit Commitment, which aims to satisfy a target power load at minimal cost. Our algorithm extends the Quantum Approximation Optimization Algorithm (QAOA) with a classical minimizer in order to support mixed binary optimization… 

Figures and Tables from this paper

Quantum computing for software engineering: prospects

Eight groups of quantum algorithms that may accelerate Software Engineering (SE) tasks across the different phases of SE and sketch potential opportunities and challenges are examined.

Data-Driven Quantum Approximate Optimization Algorithm for Cyber-Physical Power Systems

A data-driven QAOA is presented, which transfers quasi-optimal parameters between weighted graphs based on the normalized graph density, and is comparable with the Goemans-Williamson algorithm without parameter optimization.

References

SHOWING 1-10 OF 15 REFERENCES

Multiblock ADMM Heuristics for Mixed-Binary Optimization on Classical and Quantum Computers

A decomposition-based approach to extend the applicability of current approaches to “quadratic plus convex” mixed binary optimization (MBO) problems, so as to solve a broad class of real-world optimization problems.

Coreset Clustering on Small Quantum Computers

This work investigates using a new paradigm in hybrid quantum-classical computing to perform $k-means clustering on near-term quantum computers, by casting it as a QAOA optimization instance over a small coreset.

On Quantum Computing for Mixed-Integer Programming

This work formalizes a decomposition approach that ensures that with a sufficient number of back and forth iterations, the algorithm can reach the optimal solution of the original MIP problem and is shown to be effective for small-scaled test cases.

Quantum Algorithms for Mixed Binary Optimization Applied to Transaction Settlement

In this article, we extend variational quantum optimization algorithms for quadratic unconstrained binary optimization problems to the class of mixed binary optimization problems. This allows us to

Noise-induced barren plateaus in variational quantum algorithms

This work rigorously proves a serious limitation for noisy VQAs, in that the noise causes the training landscape to have a barren plateau, and proves that the gradient vanishes exponentially in the number of qubits n if the depth of the ansatz grows linearly with n.

A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem

For the small examples that the authors could simulate, the quantum adiabatic algorithm worked well, providing evidence that quantum computers (if large ones can be built) may be able to outperform ordinary computers on hard sets of instances of NP-complete problems.

Quantum supremacy using a programmable superconducting processor

Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.

Quantum Simulation of Electronic Structure with Linear Depth and Connectivity.

It is conjecture that no explicit Trotter step of the electronic structure Hamiltonian is possible with fewer entangling gates, even with arbitrary connectivities, which represents significant practical improvements on the cost of mostTrotter-based algorithms for both variational and phase-estimation-based simulation of quantum chemistry.

Partitioning procedures for solving mixed-variables programming problems

This paper presented to the 8th International Meeting of the Institute of Management Sciences, Brussels, August 23-26, 1961 presents a meta-analyses of the determinants of infectious disease in eight operation rooms of the immune system and its consequences.