Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Software Architecture Companion (ICSA-C)

Qiskit As a Simulation Platform for Measurement-based Quantum Computation

Muhammad Kashif, Saif M. Al-Kuwari

Published Mar 1, 2022• 7 citations
Publisher

Abstract

Universal quantum computation is anticipated to provide solutions to classically intractable problems. Measurement-based quantum computation (MBQC) is one of the leading candidates to achieve universal quantum computation. In MBQC, the development of the underlying quantum algorithms is governed by single-qubit measurements on a highly entangled cluster state of qubits. Recent advances in MBQC mainly explore the physical aspects of MBQC (i.e. Physical development of cluster states) and as most of the simulators that exist today are for the gate-based model of quantum computation, and to date, there is no MBQC-dedicated simulator for MBQC-based algorithmic development. This paper exploits a well-maintained, and popular gate-based simulation framework developed by IBM called Qiskit to design MBQC-based quantum algorithms. We implement various gates, including Hadamard, and CNOT gates, to demonstrate the universality of MBQC in Qiskit. We also demonstrate MBCQ-based algorithm development in Qiskit by implementing MBQC-based teleportation protocol and Grover’s algorithm. The objective of this exercise is to demonstrate that the existing gate-based simulators can be used for developing MBQC-based quantum designs, which would help the research community in exploring the advantages that MBQC can offer compared to other quantum computation models.

DOI
10.1109/icsa-c54293.2022.00037

Related papers

Realizations of Measurement Based Quantum Computing

Swapnil Nitin Shah

The Measurement Based Quantum Computation (MBQC) model achieves universal quantum computation by employing projective single qubit measurements with classical feedforward on a highly entangled multipartite cluster state. Rapid advances in improving scalability of quantum computing systems have enabled the generation of large cluster states for implementing MBQC on various platforms. This review focuses on three such efforts, each utilizing a different quantum computing technology viz., superconducting qubits, trapped ion qubits and squeezed photon states. MBQC is being increasingly employed on optical platforms which can generate large entangled resource states but lack the ability to perform deterministic entangling gates.

arXiv:2112.11601•Dec 22, 2021•1 citation

An introduction to measurement based quantum computation

Richard Jozsa

In the formalism of measurement based quantum computation we start with a given fixed entangled state of many qubits and perform computation by applying a sequence of measurements to designated qubits in designated bases. The choice of basis for later measurements may depend on earlier measurement outcomes and the final result of the computation is determined from the classical data of all the measurement outcomes. This is in contrast to the more familiar gate array model in which computational steps are unitary operations, developing a large entangled state prior to some final measurements for the output. Two principal schemes of measurement based computation are teleportation quantum computation (TQC) and the so-called cluster model or one-way quantum computer (1WQC). We will describe these schemes and show how they are able to perform universal quantum computation. We will outline various possible relationships between the models which serve to clarify their workings. We will also discuss possible novel computational benefits of the measurement based models compared to the gate array model, especially issues of parallelisability of algorithms.

arXiv:quant-ph/0508124•Aug 17, 2005•205 citations

Graphix: A software framework for Measurement-Based Quantum Computation

Mateo Uldemolins, Pranav Nair, Emlyn Graham +3 more

Measurement-based quantum computing (MBQC) is a powerful model for quantum computation, but dedicated software tools that bridge its theoretical foundations with practical research workflows remain limited. We present Graphix, a software framework for MBQC written in Python that provides a unified environment for developing, integrating, and exploring measurement-based protocols and algorithms. Graphix establishes a modular, extensible, and user-friendly architecture for the compilation and simulation of quantum computations in the MBQC model with abstractions closely aligned with the theoretical formulations of MBQC. Through examples drawn from recent research on MBQC, we demonstrate Graphix's ability to reproduce and extend previous results. Graphix thus provides a software infrastructure for MBQC, supporting education and research while enabling collaborative development and accelerating the transition toward practical implementations.

quant-pharXiv:2608.24781•Aug 26, 2026•2 citations

Simulation of Two-Qubit Grover Algorithm in MBQC with Universal Blind Quantum Computation

Youngkyung Lee, Doyoung Chung

Simulating the Universal Blind Quantum Computation (UBQC) protocol on gate-based platforms requires updating each measurement basis from earlier outcomes within the same execution. Existing Measurement-Based Quantum Computation (MBQC) simulation tools typically handle this feed-forward outside a single executable quantum program, so they do not natively expose the fixed-graph measurement-by-measurement update order studied here. We address this gap by implementing the flow-based Pauli corrections and a simulation-level UBQC angle-update rule as in-circuit dynamic-circuit primitives in Qiskit. Applied to two-qubit Grover's algorithm on a custom $2\times 9$ flow of 18 qubits, the resulting program achieves deterministic success under both plain MBQC and the UBQC layer. Under the depolarizing-noise setting considered here, the angle-blinding layer remains close to plain MBQC, with only a modest additional gap relative to the dominant MBQC-over-circuit overhead. To show that the construction is not tied only to this Grover-specific pattern, we also verify a $G_{2,5}$ brickwork-state fragment with representative universal-gate primitives under the same client/server blinding view. Structural blindness for a full algorithmic brickwork resource remains future work, but within this scope the construction provides a concrete dynamic-circuit route toward fixed-graph, privacy-preserving delegated-quantum-computing simulation at the protocol-update level.

arXiv:2503.09099•Mar 12, 2025•3 citations

Physical Realization of Measurement Based Quantum Computation

Muhammad Kashif, Saif M. Al-Kuwari

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.

arXiv:2301.03022•IEEE Access•Jan 1, 2023•11 citations

Native measurement-based quantum approximate optimization algorithm applied to the Max K -Cut problem

Massimiliano Proietti, Filippo Cerocchi, Massimiliano Dispenza

Photonic quantum computers, programed within the framework of the measurement-based quantum computing (MBQC), and gate-based platforms are racing toward useful quantum advantage, and some algorithms have emerged as main candidates to reach this goal in the near term. The majority of these algorithms are only expressed in the gate-based model of computation, which is incompatible with photonic platforms. Methods to translate gate-based algorithms into the MBQC framework exist, but they are not always optimal in terms of resource cost. In our work, we propose an MBQC algorithm to run the quantum approximate optimization algorithm (QAOA). Furthermore, we apply the MBQC-QAOA algorithm to the Max $K$-Cut problem, for all values of $K$, expressing the cost Hamiltonian and its constraints in a form easily implementable in the MBQC model. We conclude by analyzing the resource cost of our algorithm, compared to the case of translating a gate-based QAOA algorithm into MBQC rules, and show up to a 30-fold improvement. With our work, we contribute to closing the gap between gate-based and MBQC near-term algorithms, a gap not reflecting the current status of the hardware development.

arXiv:2304.03576•Physical Review A•Aug 30, 2022•23 citations
Universal quantum computation is anticipated to provide solutions to classically intractable problems. Measurement-based quantum computation (MBQC) is one of the leading candidates to achieve universal quantum computation. In MBQC, the development of the underlying quantum algorithms is governed by single-qubit measurements on a highly entangled cluster state of qubits. Recent advances in MBQC mainly explore the physical aspects of MBQC (i.e. Physical development of cluster states) and as most of the simulators that exist today are for the gate-based model of quantum computation, and to date, there is no MBQC-dedicated simulator for MBQC-based algorithmic development. This paper exploits a well-maintained, and popular gate-based simulation framework developed by IBM called Qiskit to design MBQC-based quantum algorithms. We implement various gates, including Hadamard, and CNOT gates, to demonstrate the universality of MBQC in Qiskit. We also demonstrate MBCQ-based algorithm development in Qiskit by implementing MBQC-based teleportation protocol and Grover’s algorithm. The objective of this exercise is to demonstrate that the existing gate-based simulators can be used for developing MBQC-based quantum designs, which would help the research community in exploring the advantages that MBQC can offer compared to other quantum computation models.
The Measurement Based Quantum Computation (MBQC) model achieves universal quantum computation by employing projective single qubit measurements with classical feedforward on a highly entangled multipartite cluster state. Rapid advances in improving scalability of quantum computing systems have enabled the generation of large cluster states for implementing MBQC on various platforms. This review focuses on three such efforts, each utilizing a different quantum computing technology viz., superconducting qubits, trapped ion qubits and squeezed photon states. MBQC is being increasingly employed on optical platforms which can generate large entangled resource states but lack the ability to perform deterministic entangling gates.
In the formalism of measurement based quantum computation we start with a given fixed entangled state of many qubits and perform computation by applying a sequence of measurements to designated qubits in designated bases. The choice of basis for later measurements may depend on earlier measurement outcomes and the final result of the computation is determined from the classical data of all the measurement outcomes. This is in contrast to the more familiar gate array model in which computational steps are unitary operations, developing a large entangled state prior to some final measurements for the output. Two principal schemes of measurement based computation are teleportation quantum computation (TQC) and the so-called cluster model or one-way quantum computer (1WQC). We will describe these schemes and show how they are able to perform universal quantum computation. We will outline various possible relationships between the models which serve to clarify their workings. We will also discuss possible novel computational benefits of the measurement based models compared to the gate array model, especially issues of parallelisability of algorithms.
Measurement-based quantum computing (MBQC) is a powerful model for quantum computation, but dedicated software tools that bridge its theoretical foundations with practical research workflows remain limited. We present Graphix, a software framework for MBQC written in Python that provides a unified environment for developing, integrating, and exploring measurement-based protocols and algorithms. Graphix establishes a modular, extensible, and user-friendly architecture for the compilation and simulation of quantum computations in the MBQC model with abstractions closely aligned with the theoretical formulations of MBQC. Through examples drawn from recent research on MBQC, we demonstrate Graphix's ability to reproduce and extend previous results. Graphix thus provides a software infrastructure for MBQC, supporting education and research while enabling collaborative development and accelerating the transition toward practical implementations.
Simulating the Universal Blind Quantum Computation (UBQC) protocol on gate-based platforms requires updating each measurement basis from earlier outcomes within the same execution. Existing Measurement-Based Quantum Computation (MBQC) simulation tools typically handle this feed-forward outside a single executable quantum program, so they do not natively expose the fixed-graph measurement-by-measurement update order studied here. We address this gap by implementing the flow-based Pauli corrections and a simulation-level UBQC angle-update rule as in-circuit dynamic-circuit primitives in Qiskit. Applied to two-qubit Grover's algorithm on a custom 2×92\times 92×9 flow of 18 qubits, the resulting program achieves deterministic success under both plain MBQC and the UBQC layer. Under the depolarizing-noise setting considered here, the angle-blinding layer remains close to plain MBQC, with only a modest additional gap relative to the dominant MBQC-over-circuit overhead. To show that the construction is not tied only to this Grover-specific pattern, we also verify a G2,5G_{2,5}G2,5​ brickwork-state fragment with representative universal-gate primitives under the same client/server blinding view. Structural blindness for a full algorithmic brickwork resource remains future work, but within this scope the construction provides a concrete dynamic-circuit route toward fixed-graph, privacy-preserving delegated-quantum-computing simulation at the protocol-update level.
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.
Photonic quantum computers, programed within the framework of the measurement-based quantum computing (MBQC), and gate-based platforms are racing toward useful quantum advantage, and some algorithms have emerged as main candidates to reach this goal in the near term. The majority of these algorithms are only expressed in the gate-based model of computation, which is incompatible with photonic platforms. Methods to translate gate-based algorithms into the MBQC framework exist, but they are not always optimal in terms of resource cost. In our work, we propose an MBQC algorithm to run the quantum approximate optimization algorithm (QAOA). Furthermore, we apply the MBQC-QAOA algorithm to the Max KKK-Cut problem, for all values of KKK, expressing the cost Hamiltonian and its constraints in a form easily implementable in the MBQC model. We conclude by analyzing the resource cost of our algorithm, compared to the case of translating a gate-based QAOA algorithm into MBQC rules, and show up to a 30-fold improvement. With our work, we contribute to closing the gap between gate-based and MBQC near-term algorithms, a gap not reflecting the current status of the hardware development.