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:2306.11747 · Quantum Information Processing

An efficient quantum algorithm for preparation of uniform quantum superposition states

Alok Shukla, Prakash Vedula

Published Jan 29, 2024• 48 citations
arXivHTMLPDF
DOI
10.1007/s11128-024-04258-4

Related papers

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

Efficient fault-tolerant circuit for preparing quantum uniform superposition states via quantum measurement

Xiang-Qun Fu, Tian-Ci Tian, Hong-Wei 宏伟 Li 李 +4 more

Abstract Preparing quantum superposition states is a crucial step in realizing quantum algorithms, which demands substantial resources. In this paper, we propose a new method for preparing quantum uniform superposition states via quantum measurement, and design the bitwise implementation circuit, which only contains Hadamard, CNOT, and π /8 phase gates. Compared to the Shukla–Vedula method, the number of quantum gates required by both methods scales the same, while, the new method offers stronger fault tolerance, and the ancillary qubits employed during the implementation process can be reused, making it more suitable for implementation on real quantum computers. As an application, we provide the circuit for Shor’s discrete logarithm quantum algorithm, based on the new method, demonstrating its technical advantage for implementation of quantum algorithms.

Chinese Physics B•May 23, 2025•0 citations

An Efficient Algorithm for Extending Uniform Superposition States for Time-Series Data

Carla Rieger, Michele Grossi, Gian Giacomo Guerreschi +2 more

Leveraging fundamental quantum features such as quantum superposition is one of the key elements for the theoretical speed-up obtained in quantum algorithms, e.g., with Grover's search algorithm. In this work, we explore the novel concept of dynamic state preparation, which allows for extending an initially prepared superposition state already containing a set of data elements. This state is modified upon receiving further time-series measurement data from an experiment so that this data can be processed with a quantum algorithm to extract the global properties of the system efficiently. Specifically, we distinguish the algorithmic case in which the state-preparation unitary of the initially prepared state to be extended is known and the one where it is not. The former can be described as an application of amplitude amplification, whereas the latter includes an amplitude reservoir assigned to a reference state that allows for extension without knowing the full state preparation unitary. We discuss both cases algorithmically and present the respective quantum circuit, including a specific initial state preparation method. Our analysis reveals a polynomial scaling and respective tradeoffs to be considered.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations

Efficient quantum algorithms to construct arbitrary Dicke states

Kaushik Chakraborty, Byung-Soo Choi, Arpita Maitra +1 more

Quantum Information Processing•Jul 22, 2014•10 citations

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

Alok Shukla, Prakash Vedula

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

arXiv:2611.13658•Nov 10, 2026•0 citations

Progress in Quantum Algorithms

Peter W. Shor

Springer eBooks•Apr 2, 2007•3 citations
Abstract Preparing quantum superposition states is a crucial step in realizing quantum algorithms, which demands substantial resources. In this paper, we propose a new method for preparing quantum uniform superposition states via quantum measurement, and design the bitwise implementation circuit, which only contains Hadamard, CNOT, and π /8 phase gates. Compared to the Shukla–Vedula method, the number of quantum gates required by both methods scales the same, while, the new method offers stronger fault tolerance, and the ancillary qubits employed during the implementation process can be reused, making it more suitable for implementation on real quantum computers. As an application, we provide the circuit for Shor’s discrete logarithm quantum algorithm, based on the new method, demonstrating its technical advantage for implementation of quantum algorithms.
Leveraging fundamental quantum features such as quantum superposition is one of the key elements for the theoretical speed-up obtained in quantum algorithms, e.g., with Grover's search algorithm. In this work, we explore the novel concept of dynamic state preparation, which allows for extending an initially prepared superposition state already containing a set of data elements. This state is modified upon receiving further time-series measurement data from an experiment so that this data can be processed with a quantum algorithm to extract the global properties of the system efficiently. Specifically, we distinguish the algorithmic case in which the state-preparation unitary of the initially prepared state to be extended is known and the one where it is not. The former can be described as an application of amplitude amplification, whereas the latter includes an amplitude reservoir assigned to a reference state that allows for extension without knowing the full state preparation unitary. We discuss both cases algorithmically and present the respective quantum circuit, including a specific initial state preparation method. Our analysis reveals a polynomial scaling and respective tradeoffs to be considered.
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