Quick Navigation

Topics

Quantum Control Electronics System Integration

Quantum Data Structure for Range Minimum Query

arXiv
Authors: Qisheng Wang, Zhean Xu, Zhicheng Zhang

Year

2026

Paper ID

3632

Status

Preprint

Abstract Read

~2 min

Abstract Words

107

Citations

N/A

Abstract

Given an array a[1..n], the Range Minimum Query (RMQ) problem is to maintain a data structure that supports RMQ queries: given a range [l, r], find the index of the minimum element among a[l..r], i.e., operatorname{argmin}i in [l, r] a[i]. In this paper, we propose a quantum data structure that supports RMQ queries and range updates, with an optimal time complexity widetilde Θ\(sqrt{nq}\) for performing q = O(n) operations without preprocessing, compared to the classical widetildeΘ(n+q). As an application, we obtain a time-efficient quantum algorithm for k-minimum finding without the use of quantum random access memory.

Why This Paper Matters

  • This paper contributes to the Quantum Control Electronics & System Integration research area in the Quantum Articles archive.
  • It adds a 2026 reference point for readers tracking recent quantum research.
  • Given an array a[1..n], the Range Minimum Query (RMQ) problem is to maintain a data structure that supports RMQ queries: given a range [l, r], find the index of the minimum...

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #3632

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.