arXiv · 2611.13658
An Efficient Quantum Algorithm for Preparing Uniform Superpositions over Arbitrary Integer Intervals
Abstract
We consider exact preparation of the uniform quantum state supported on an arbitrary nonempty interval of integer labels in an $n$-qubit register. For every $0\leq a<a+M\leq2^n$, we give an ancilla-free circuit using only one-qubit gates and singly controlled one-qubit gates. In the logical gate model specified in the paper, the direct construction has exact worst-case gate count $5n-9$ for $n\geq3$; its exact maxima for $n=1$ and $n=2$ are $1$ and $3$, respectively. A worst-case lower bound of $Ω(n)$ establishes asymptotic optimality in the register width. In addition, the gate complexity admits an instance-dependent bound $O(\log_2 M+ε)$, where $ε$ is an offset-dependent parameter defined in terms of binary Hamming weights. We also derive a reflected construction and a classical procedure that selects the lower-count exact circuit. The direct construction admits an $O(n)$ logical-depth upper bound. We also treat bitwise-XOR images of intervals and arithmetic progressions with power-of-two spacing.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Alok Shukla, Prakash Vedula. 2026-11-10. An Efficient Quantum Algorithm for Preparing Uniform Superpositions over Arbitrary Integer Intervals. https://searcharxiv.com/abs/2611.13658
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.