PreprintCC BY 4.0arXiv
Performing a Quantum Subroutine Using Cluster States
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
- Asymptotics of Ground States for Helium-Like and Bosonic Atoms in a Two-Cluster Region
- Exact SU(N) symmetry resolution of bosonic Hubbard models: general boson-fermion mappings and flat-band singlet-cluster states
- Representations of shifted quantum affine algebras and cluster algebras II: Non simply-laced types and cluster expansions
- Quantum cluster structures on bosonic extensions
- From the quantum group Uq1/2( sl̂2 ) to the Kronecker quantum cluster algebra
BibTeX
@misc{rayhan2026performing,
title = {{Performing a Quantum Subroutine Using Cluster States}},
author = {Sakibul Islam Rayhan and Karima Hassan and Md Rasedujjaman and Md Mohsinur Rahman Adnan},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.32227},
eprint = {2610.32227},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.32227},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Performing a Quantum Subroutine Using Cluster States
AU - Sakibul Islam Rayhan
AU - Karima Hassan
AU - Md Rasedujjaman
AU - Md Mohsinur Rahman Adnan
PY - 2026
DA - 2026/10/23
PB - arXiv
DO - 10.48550/arxiv.2610.32227
UR - https://arxiv.org/abs/2610.32227
AB - 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.
ER -