Power and Energy Applications Based on Quantum Computing: The Possible Potentials of Grover’s Algorithm

Mohammad Reza Habibi*, Saeed Golestan, Ali Soltanmanesh, Josep M. Guerrero, Juan C. Vasquez

*Corresponding author for this work

Research output: Contribution to journalJournal articleResearchpeer-review

8 Citations (Scopus)
67 Downloads (Pure)

Abstract

In quantum computing, calculations are achieved using quantum mechanics. Typically, two main phenomena of quantum mechanics (i.e., superposition and entanglement) allow quantum computing to solve some problems more efficiently than classical algorithms. The most well-known advantage of quantum computing is the speedup of some of the calculations, which have been performed before by classical applications. Scientists and engineers are attempting to use quantum computing in different fields of science, e.g., drug discovery, chemistry, computer science, etc. However, there are few attempts to use quantum computing in power and energy applications. This paper tries to highlight this gap by discussing one of the most famous quantum computing algorithms (i.e., Grover’s algorithm) and discussing the potential applications of this algorithm in power and energy systems, which can serve as one of the starting points for using Grover’s algorithm in power and energy systems.

Original languageEnglish
Article number2919
JournalElectronics (Switzerland)
Volume11
Issue number18
ISSN2079-9292
DOIs
Publication statusPublished - Sept 2022

Bibliographical note

Funding Information:
This work was supported by VILLUM FONDEN under the VILLUM Investigator Grant (no. 25920): Center for Research on Microgrids (CROM).

Publisher Copyright:
© 2022 by the authors.

Keywords

  • Grover’s algorithm
  • power and energy applications
  • quantum bit
  • quantum computing
  • quantum mechanics

Fingerprint

Dive into the research topics of 'Power and Energy Applications Based on Quantum Computing: The Possible Potentials of Grover’s Algorithm'. Together they form a unique fingerprint.

Cite this