Physical Realization of Measurement Based Quantum Computation

Quantum computers, leveraging the principles of quantum mechanics, hold the potential to surpass classical computers in numerous applications, with implications across various domains. Besides the well-known gate model, Measurement-based Quantum Computation (MBQC) is another promising computational...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE access 2023-01, Vol.11, p.1-1
Hauptverfasser: Kashif, Muhammad, Al-Kuwari, Saif
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Quantum computers, leveraging the principles of quantum mechanics, hold the potential to surpass classical computers in numerous applications, with implications across various domains. Besides the well-known gate model, Measurement-based Quantum Computation (MBQC) is another promising computational approach to achieve universal quantum computation. In MBQC, large ensembles of qubits are prepared in a highly entangled cluster state, forming the basis for executing quantum computations through sequential measurements. Cluster states are realized using both continuous variables (CV) and discrete variables (DV) techniques. In the CV-based methods, Frequency Domain Multiplexing (FDM), Time Domain Multiplexing (TDM), Spatial Domain Multiplexing (SDM), and hybrid schemes are employed. This paper thoroughly discusses and compares these approaches, elucidating their strengths and limitations. Additionally, the generation of photonic cluster states in DV is explored and some recent results are reported. Some recent state-of-the-art advancements in photonic and superconducting qubits entanglement, which can potentially serve as cluster states, are also presented. Finally, we highlight the approach that exhibits the most promising characteristics for achieving efficient cluster state realization in the context of MBQC.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2023.3289005