REVIEW 3 cited by
Data-Driven Quantum Approximate Optimization Algorithm for Cyber-Physical Power Systems
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
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.
Forward citations
Cited by 3 Pith papers
-
Parallel repetition of expanded, and multiplayer, Quantum games: anchoring, optimal values, generalized error bounds, dependency-breaking as symmetry-breaking
States exponential decay bounds for the anchored parallel-repeated value of multiplayer quantum games with N-dependent exponents, but leaves the N-player proof to prior work.
-
Probability distributions over CSS codes: two-universality, QKD hashing, collision bounds, security
A two-universal QKD hashing protocol is claimed to be 2^{−k/2 + n h_2(r/n) + 35/4 + log_2√C}-secure for an unspecified constant C — a strictly weaker bound than Ostrev's 2^{−k/2 + n h(r/n) + 5/2}, obtained by adapting...
-
Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate
The paper asserts a converse upper bound on the bit transmission rate in terms of pruned alphabet sizes, but the proof is a chain of unjustified inequalities and the main theorem reverses the inequality of the result ...
Discussion (0). Continue with ORCID to comment.