arXiv:2610.32227
Performing a Quantum Subroutine Using Cluster States
Sakibul Islam Rayhan, Karima Hassan, Md Rasedujjaman, Md Mohsinur Rahman Adnan
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.
AI Summary
The paper considers how to express a two-qubit Grover phase oracle as a measurement-based quantum computation (MBQC) subroutine, with explicit measurement patterns and Pauli byproduct corrections. The target operations are $U_w=I-2|w\rangle\langle w|$ for the four possible marked strings $w\in\{00,01,10,11\}$. The construction uses six qubits arranged as two three-qubit wires, with a controlled-$Z$ edge joining the output qubits. Two qubits carry the input and four ancillas are initialized in $|+\rangle$. Measuring the four non-output qubits in the $X$ basis implements a controlled-$Z$ operation up to outcome-dependent Pauli operators. The paper specifies these byproducts and proposes selecting the marked string through measurement angles $0$ or $\pi$ on the two input qubits. It also presents stabilizer descriptions, measurement-circuit representations, and background derivations of elementary MBQC gates. Verification consists of density-matrix simulations comparing the four MBQC oracle configurations with their gate-based counterparts for the input $|+\rangle\otimes|-\rangle$. The reported real density matrices have entries $\pm0.25$ and reproduce the expected phase-sign patterns. This is a single-input state comparison rather than full process verification; no experimental implementation, noise analysis, or quantitative fidelity benchmark is reported. The stated scope is small-qubit constructions chosen for physical feasibility. Extensions to larger oracles, more complex subroutines, fault-tolerant implementations, and higher-dimensional cluster resources are identified as future directions rather than demonstrated results.
Central claim may not hold: Figure (rotations) swaps the |10>- and |01>-marking settings: under the stated byproduct corrections, a pi shift on q1 marks |01>, while a pi shift on q0 marks |10>. The density-matrix comparison on only |+> tensor |-> does not establish the claimed arbitrary-input, reusable oracle channel. The six graph-state stabilizers asserted in the preparation section require |+> inputs and do not characterize the resource with arbitrary injected input states. The appendix's two-qubit state-transfer and rotation identities omit a residual Hadamard, contradicting the conditional output derived immediately beforehand.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.