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:2611.13658

An Efficient Quantum Algorithm for Preparing Uniform Superpositions over Arbitrary Integer Intervals

Alok Shukla, Prakash Vedula

Published Nov 10, 2026• 0 citations
arXivHTMLPDF

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

DOI
10.48550/arxiv.2611.13658

Related papers

An efficient quantum algorithm for preparation of uniform quantum superposition states

Alok Shukla, Prakash Vedula

arXiv:2306.11747•Quantum Information Processing•Jan 29, 2024•48 citations

Efficient scheme for initializing a quantum register with an arbitrary superposed state

Gui‐Lu Long, Yang Sun

Preparation of a quantum register is an important step in quantum computation and quantum information processing. It is straightforward to build a simple quantum state such as $|{i}_{1}{i}_{2}\ensuremath{\cdots}{i}_{n}〉$ with ${i}_{j}$ being either 0 or 1, but it is a nontrivial task to construct an arbitrary superposed quantum state. We present a scheme that can most generally initialize a quantum register with an arbitrary superposition of basis states. Implementation of this scheme requires ${O(Nn}^{2})$ standard 1- and 2-bit gate operations, without introducing additional quantum bits. Application of the scheme in some special cases is discussed.

arXiv:quant-ph/0104030•Physical Review A•Jun 8, 2001•137 citations

Constant-depth adaptive preparation of Dicke and symmetric states

Rui Luo, Junjie Chen, Xiongfeng Ma

Efficient preparation of Dicke states and, more generally, permutation-symmetric states is important for quantum metrology, quantum networking, and collective quantum information processing. Measurements and classical feedforward enable low-depth preparations of these states, with a cost of ancillary qubits. In this work, we introduce an exact constant-depth adaptive preparation protocol for arbitrary Dicke-$(n,k)$ states and further symmetric states. We first provide a protocol preparing the uniform subset superposition state, as a primitive, using constant-depth adaptive circuit with $O(k^2\log^2 n)$ ancillary qubits and success probability at least $1/k$. This yields an exact, probabilistic, constant-depth Dicke-state preparation protocol using $O\left(n^2+k^2\log^2 n+kn\log n\log\log n\right)$ ancillary qubits. Parallel repetition suppresses the failure probability exponentially without increasing the quantum depth. Moreover, the uniform subset superposition state is also of independent interest as the uniform vertex state of the Johnson graph and as the compact uniform subset state appearing in quantum-walk and topological-data-analysis algorithms. We further establish a general lifting framework that coherently combines clean unitary Dicke-state preparation circuits to prepare arbitrary symmetric states with only polynomial ancillary overhead. Combined with recent constant-depth unitary Dicke-state constructions, this gives an exact constant-depth preparation protocol for arbitrary $n$-qubit symmetric states using $O(n^3\sqrt{\log n})$ ancillary qubits.

quant-pharXiv:2608.01144•Aug 4, 2026•3 citations

EFFICIENT ALGORITHM FOR INITIALIZING AMPLITUDE DISTRIBUTION OF A QUANTUM REGISTER

M. Andrecut, Mazhar Ali

The preparation of a quantum register in an arbitrary superposed quantum state is an important operation for quantum computation and quantum information processing. Here, we present an efficient algorithm which requires a polynomial number of elementary operations for initializing the amplitude distribution of a quantum register.

Modern Physics Letters B•Nov 20, 2001•4 citations

Single-pulse preparation of the uniform superpositional state used in quantum algorithms

G.P. Berman, F. Borgonovi, F.M. Izrailev +1 more

arXiv:quant-ph/0006095•Physics Letters A•Dec 1, 2001•5 citations

Creating superpositions that correspond to efficiently integrable probability distributions

Lov K. Grover, Terry Rudolph

We give a simple and efficient process for generating a quantum superposition of states which form a discrete approximation of any efficiently integrable (such as log concave) probability density functions.

arXiv:quant-ph/0208112•Aug 15, 2002•615 citations
We consider exact preparation of the uniform quantum state supported on an arbitrary nonempty interval of integer labels in an nnn-qubit register. For every $0\leq a
Preparation of a quantum register is an important step in quantum computation and quantum information processing. It is straightforward to build a simple quantum state such as $|{i}_{1}{i}_{2}\ensuremath{\cdots}{i}_{n}〉$ with ij{i}_{j}ij​ being either 0 or 1, but it is a nontrivial task to construct an arbitrary superposed quantum state. We present a scheme that can most generally initialize a quantum register with an arbitrary superposition of basis states. Implementation of this scheme requires O(Nn2){O(Nn}^{2})O(Nn2) standard 1- and 2-bit gate operations, without introducing additional quantum bits. Application of the scheme in some special cases is discussed.
Efficient preparation of Dicke states and, more generally, permutation-symmetric states is important for quantum metrology, quantum networking, and collective quantum information processing. Measurements and classical feedforward enable low-depth preparations of these states, with a cost of ancillary qubits. In this work, we introduce an exact constant-depth adaptive preparation protocol for arbitrary Dicke-(n,k)(n,k)(n,k) states and further symmetric states. We first provide a protocol preparing the uniform subset superposition state, as a primitive, using constant-depth adaptive circuit with O(k2log⁡2n)O(k^2\log^2 n)O(k2log2n) ancillary qubits and success probability at least 1/k1/k1/k. This yields an exact, probabilistic, constant-depth Dicke-state preparation protocol using O(n2+k2log⁡2n+knlog⁡nlog⁡log⁡n)O\left(n^2+k^2\log^2 n+kn\log n\log\log n\right)O(n2+k2log2n+knlognloglogn) ancillary qubits. Parallel repetition suppresses the failure probability exponentially without increasing the quantum depth. Moreover, the uniform subset superposition state is also of independent interest as the uniform vertex state of the Johnson graph and as the compact uniform subset state appearing in quantum-walk and topological-data-analysis algorithms. We further establish a general lifting framework that coherently combines clean unitary Dicke-state preparation circuits to prepare arbitrary symmetric states with only polynomial ancillary overhead. Combined with recent constant-depth unitary Dicke-state constructions, this gives an exact constant-depth preparation protocol for arbitrary nnn-qubit symmetric states using O(n3log⁡n)O(n^3\sqrt{\log n})O(n3logn​) ancillary qubits.