A Quantum Algorithm for System Specifications Verification

Verifying system specifications is a crucial requirement in science and technology, as it improves accuracy and efficiency in systems engineering. However, traditional computers are time-consuming and cannot efficiently check the consistency of system specifications for classical and quantum systems...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE internet of things journal Jg. 11; H. 14; S. 24775 - 24794
Hauptverfasser: Zidan, Mohammed, Eisa, Ahmed M., Qasymeh, Montasir, Shoman, Mahmoud A. Ismail
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Piscataway IEEE 15.07.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Complexity
Computers
Concurrence
Efficiency
entanglement
Prediction algorithms
Quantum algorithm
quantum algorithms
Quantum computing
Quantum entanglement
Quantum system
Quantum theory
Qubit
sensors
Specifications
Systems engineering
ISSN:2327-4662, 2327-4662
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Verifying system specifications is a crucial requirement in science and technology, as it improves accuracy and efficiency in systems engineering. However, traditional computers are time-consuming and cannot efficiently check the consistency of system specifications for classical and quantum systems due to exponential complexity costs. Currently, there is no quantum approach available for verifying consistency in quantum systems. This article introduces a novel quantum algorithm that utilizes the virtual degree of entanglement to efficiently check the consistency of unknown system specifications represented by m oracles. The proposed algorithm has a time complexity of <inline-formula> <tex-math notation="LaTeX">O({m}{\epsilon ^{-2}}) </tex-math></inline-formula>, which is independent of the input size n and depends only on a predetermined error margin <inline-formula> <tex-math notation="LaTeX">\epsilon </tex-math></inline-formula>, providing exponential speedup compared to the classical approach with a time complexity of <inline-formula> <tex-math notation="LaTeX">O(m2^{n}) </tex-math></inline-formula>. Moreover, the proposed algorithm can handle weighted superposition input states, which are impossible for classical computers to handle. Thus, the algorithm has the potential to check the consistency of both quantum and classical system specifications. The proposed algorithm is realized experimentally using IBM's Aer simulator with an input size of <inline-formula> <tex-math notation="LaTeX">n=12 </tex-math></inline-formula>. The experimental results closely aligned with the theoretical predictions, demonstrating the algorithm's efficiency in checking the consistency of system specifications. Specifically, the proposed algorithm achieved a quantum supremacy ratio of 300% to 3100% compared to the classical algorithm, highlighting its significant advantage in terms of time complexity. Additionally, the simulation results confirmed the efficiency of the proposed algorithm in checking the consistency of the quantum system's specifications.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2327-4662
2327-4662
DOI:10.1109/JIOT.2024.3383034