Abstract
In this paper, we present an algorithm for preparing quantum states of the form \(\sum_{i=0}^{n-1}\alpha_{i}|i\rangle\) , where the coefficients \(\alpha_{i}\) are specified by a quantum oracle. Our method achieves this task twice as fast as the best existing algorithm known to the authors. Such state preparation is essential for quantum algorithms that process large classical inputs, including matrix inversion and linear system solvers. The standard approach relies on amplitude amplification, a process that may require multiple, time-consuming oracle queries. Consequently, reducing the number of queries and thereby the overall time complexity can lead to significant performance improvements in practice.
