Pith. sign in

REVIEW 1 cited by

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2204.00738 v1 pith:VCOZEY3R submitted 2022-04-02 quant-ph cs.SYeess.SY

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

classification quant-ph cs.SYeess.SY
keywords quantumsystemspowerqaoaalgorithmdata-drivenoptimizationapproximate
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Quantum technology provides a ground-breaking methodology to tackle challenging computational issues in power systems, especially for Distributed Energy Resources (DERs) dominant cyber-physical systems that have been widely developed to promote energy sustainability. The systems' maximum power or data sections are essential for monitoring, operation, and control, while high computational effort is required. Quantum Approximate Optimization Algorithm (QAOA) provides a promising means to search for these sections by leveraging quantum resources. However, its performance highly relies on the critical parameters, especially for weighted graphs. We present a data-driven QAOA, which transfers quasi-optimal parameters between weighted graphs based on the normalized graph density, and verify the strategy with 39,774 instances. Without parameter optimization, our data-driven QAOA is comparable with the Goemans-Williamson algorithm. This work advances QAOA and pilots the practical application of quantum technique to power systems in noisy intermediate-scale quantum devices, heralding its next-generation computation in the quantum era.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Multiplayer parallel repetition without dependency-breaking and anchoring variables: monotonic, concave amplification

    quant-ph 2026-05 unverdicted novelty 6.0

    Monotonic concave amplification functions of the form N minus the product of exponentials yield decay rates for the optimal value of multiplayer games under parallel repetition.