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

arXiv:2610.32227

Performing a Quantum Subroutine Using Cluster States

Sakibul Islam Rayhan, Karima Hassan, Md Rasedujjaman, Md Mohsinur Rahman Adnan

quant-phmath-phSubmitted Oct 23, 2026• Announced Oct 26, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum subroutines, like their classical counterparts, serve as essential components of larger algorithms. They can be realized using gate based architectures or measurement based quantum computation (MBQC), where computation proceeds through adaptive measurements on highly entangled cluster states. In this work, we implement a phase oracle as a reusable subroutine within the MBQC framework using experimentally feasible cluster states. Unlike prior demonstrations of Grover's algorithm in MBQC that omit explicit oracle construction, our approach provides a transparent formulation of the oracle subroutine, including its measurement patterns, byproduct correlations, density-matrix simulations, and corresponding MBQC measurement circuits.

Related papers

Three-qubit Deutsch–Jozsa in measurement-based quantum computing

Maximilian Schwetz, R. M. Noack

Measurement-based quantum computing (MBQC), an alternate paradigm for formulating quantum algorithms, can lead to potentially more flexible and efficient implementations as well as to theoretical insights on the role of entanglement in a quantum algorithm. Using the graph-theoretical ZX-calculus, we describe and apply a general scheme for reformulating quantum circuits as MBQC implementations. After illustrating the method using the two-qubit Deutsch–Jozsa algorithm, we derive a ZX graph-diagram that encodes a general MBQC implementation for the three-qubit Deutsch–Jozsa algorithm. This graph describes an 11-qubit cluster state on which single-qubit measurements are used to execute the algorithm. Particular sets of choices of the axes for the measurements can be used to implement any realization of the oracle. In addition, we derive an equivalent lattice cluster state for the algorithm.

arXiv:2306.13372•International Journal of Quantum Information•Dec 4, 2023•0 citations

Qiskit As a Simulation Platform for Measurement-based Quantum Computation

Muhammad Kashif, Saif M. Al-Kuwari

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.

IEEE International Conference on Software Architecture Companion (ICSA-C)•Mar 1, 2022•6 citations

Programming Non-Trivial Algorithms in the Measurement Based Quantum Computation Model

Paul M. Alsing

We provide a set of prescriptions for implementing a quantum circuit model algorithm as measurement based quantum computing (MBQC) algorithm1, 2 via a large cluster state. As means of illustration we draw upon our numerical modeling experience to describe a large graph state capable of searching a logical 8 element list (a non-trivial version of Grover's algorithm3 with feedforward). We develop several prescriptions based on analytic evaluation of cluster states and graph state equations which can be generalized into any circuit model operations. Such a resulting cluster state will be able to carry out the desired operation with appropriate measurements and feed forward error correction. We also discuss the physical implementation and the analysis of the principal 3-qubit entangling gate (Toffoli) required for a non-trivial feedforward realization of an 8-element Grover search algorithm.

•Aug 11, 2016•0 citations

Programming non-trivial algorithms in the measurement-based quantum computation model

Paul M. Alsing, A. Matthew Smith, Michael L. Fanto +2 more

We provide a set of prescriptions for implementing a quantum circuit model algorithm as measurement based quantum computing (MBQC) algorithm via a large cluster state. As means of illustration we draw upon our numerical modeling experience to describe a large graph state capable of searching a logical 8 element list (a non-trivial version of Grover's algorithm with feedforward). We develop several prescriptions based on analytic evaluation of cluster states and graph state equations which can be generalized into any circuit model operations. Such a resulting cluster state will be able to carry out the desired operation with appropriate measurements and feed forward error correction. We also discuss the physical implementation and the analysis of the principal 3-qubit entangling gate (Tooli) required for a non-trivial feedforward realization of an 8-element Grover search algorithm.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Oct 13, 2014•1 citation

A 3D lattice defect and efficient computations in topological MBQC

Gabrielle Tournaire, Marvin Schwiering, Robert Raussendorf +1 more

We describe an efficient, fully fault-tolerant implementation of Measurement-Based Quantum Computation (MBQC) in the 3D cluster state. The two key novelties are (i) the introduction of a lattice defect in the underlying cluster state and (ii) the use of the Rudolph-Grover rebit encoding. Concretely, (i) allows for a topological implementation of the Hadamard gate, while (ii) does the same for the phase gate. Furthermore, we develop general ideas towards circuit compaction and algorithmic circuit verification, which we implement for the Reed-Muller code used for magic state distillation. Our performance analysis highlights the overall improvements provided by the new methods.

arXiv:2412.09781•Quantum•Feb 6, 2026•2 citations

Quantum algorithms for classical Boolean functions via adaptive measurements: Exponential reductions in space-time resources

Austin K. Daniel, Akimasa Miyake

The limited computational power of constant-depth quantum circuits can be boosted by adapting future gates according to the outcomes of mid-circuit measurements. We formulate computation of a variety of Boolean functions in the framework of adaptive measurement-based quantum computation using a cluster state resource and a classical side-processor that can add bits modulo 2, so-called $l2$-MBQC. Our adaptive approach overcomes a known challenge that computing these functions in the nonadaptive setting requires a resource state that is exponentially large in the size of the computational input. In particular, we construct adaptive $l2$-MBQC algorithms based on the quantum signal processing technique that compute the mod-$p$ functions with the best known scaling in the space-time resources (i.e., qubit count, quantum circuit depth, classical memory size, and number of calls to the side-processor). As the subject is diverse and has a long history, the paper includes reviews of several previously constructed algorithms and recasts them as adaptive $l2$-MBQCs using cluster state resources. Our results constitute an alternative proof of an old theorem regarding an oracular separation between the power of constant-depth quantum circuits and constant-depth classical circuits with unbounded fan-in NAND and mod-$p$ gates for any prime $p$.

arXiv:2211.01252•Nov 2, 2022•1 citation
Quantum subroutines, like their classical counterparts, serve as essential components of larger algorithms. They can be realized using gate based architectures or measurement based quantum computation (MBQC), where computation proceeds through adaptive measurements on highly entangled cluster states. In this work, we implement a phase oracle as a reusable subroutine within the MBQC framework using experimentally feasible cluster states. Unlike prior demonstrations of Grover's algorithm in MBQC that omit explicit oracle construction, our approach provides a transparent formulation of the oracle subroutine, including its measurement patterns, byproduct correlations, density-matrix simulations, and corresponding MBQC measurement circuits.
Measurement-based quantum computing (MBQC), an alternate paradigm for formulating quantum algorithms, can lead to potentially more flexible and efficient implementations as well as to theoretical insights on the role of entanglement in a quantum algorithm. Using the graph-theoretical ZX-calculus, we describe and apply a general scheme for reformulating quantum circuits as MBQC implementations. After illustrating the method using the two-qubit Deutsch–Jozsa algorithm, we derive a ZX graph-diagram that encodes a general MBQC implementation for the three-qubit Deutsch–Jozsa algorithm. This graph describes an 11-qubit cluster state on which single-qubit measurements are used to execute the algorithm. Particular sets of choices of the axes for the measurements can be used to implement any realization of the oracle. In addition, we derive an equivalent lattice cluster state for the algorithm.
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.
We provide a set of prescriptions for implementing a quantum circuit model algorithm as measurement based quantum computing (MBQC) algorithm1, 2 via a large cluster state. As means of illustration we draw upon our numerical modeling experience to describe a large graph state capable of searching a logical 8 element list (a non-trivial version of Grover's algorithm3 with feedforward). We develop several prescriptions based on analytic evaluation of cluster states and graph state equations which can be generalized into any circuit model operations. Such a resulting cluster state will be able to carry out the desired operation with appropriate measurements and feed forward error correction. We also discuss the physical implementation and the analysis of the principal 3-qubit entangling gate (Toffoli) required for a non-trivial feedforward realization of an 8-element Grover search algorithm.
We provide a set of prescriptions for implementing a quantum circuit model algorithm as measurement based quantum computing (MBQC) algorithm via a large cluster state. As means of illustration we draw upon our numerical modeling experience to describe a large graph state capable of searching a logical 8 element list (a non-trivial version of Grover's algorithm with feedforward). We develop several prescriptions based on analytic evaluation of cluster states and graph state equations which can be generalized into any circuit model operations. Such a resulting cluster state will be able to carry out the desired operation with appropriate measurements and feed forward error correction. We also discuss the physical implementation and the analysis of the principal 3-qubit entangling gate (Tooli) required for a non-trivial feedforward realization of an 8-element Grover search algorithm.
We describe an efficient, fully fault-tolerant implementation of Measurement-Based Quantum Computation (MBQC) in the 3D cluster state. The two key novelties are (i) the introduction of a lattice defect in the underlying cluster state and (ii) the use of the Rudolph-Grover rebit encoding. Concretely, (i) allows for a topological implementation of the Hadamard gate, while (ii) does the same for the phase gate. Furthermore, we develop general ideas towards circuit compaction and algorithmic circuit verification, which we implement for the Reed-Muller code used for magic state distillation. Our performance analysis highlights the overall improvements provided by the new methods.
The limited computational power of constant-depth quantum circuits can be boosted by adapting future gates according to the outcomes of mid-circuit measurements. We formulate computation of a variety of Boolean functions in the framework of adaptive measurement-based quantum computation using a cluster state resource and a classical side-processor that can add bits modulo 2, so-called l2l2l2-MBQC. Our adaptive approach overcomes a known challenge that computing these functions in the nonadaptive setting requires a resource state that is exponentially large in the size of the computational input. In particular, we construct adaptive l2l2l2-MBQC algorithms based on the quantum signal processing technique that compute the mod-ppp functions with the best known scaling in the space-time resources (i.e., qubit count, quantum circuit depth, classical memory size, and number of calls to the side-processor). As the subject is diverse and has a long history, the paper includes reviews of several previously constructed algorithms and recasts them as adaptive l2l2l2-MBQCs using cluster state resources. Our results constitute an alternative proof of an old theorem regarding an oracular separation between the power of constant-depth quantum circuits and constant-depth classical circuits with unbounded fan-in NAND and mod-ppp gates for any prime ppp.