Related papers: Quantum state preparation for multivariate functio…
The efficient preparation of input distributions is an important problem in obtaining quantum advantage in a wide range of domains. We propose a novel quantum algorithm for the efficient preparation of arbitrary normal distributions in…
We generalize the binary quantum counting algorithm of Lesovik, Suslov, and Blatter [Phys. Rev. A 82, 012316 (2010)] to higher counting bases. The algorithm makes use of qubits, qutrits, and qudits to count numbers in a base 2, base 3, or…
We develop an adaptive method for quantum state preparation that utilizes randomness as an essential component and that does not require classical optimization. Instead, a cost function is minimized to prepare a desired quantum state…
Preparation of a target quantum many-body state on quantum simulators is one of the significant steps in quantum science and technology. With a small number of qubits, a few quantum states, such as the Greenberger-Horne-Zeilinger state,…
In a previous paper [quant-ph/0408045] we described a quantum algorithm to prepare an arbitrary state of a quantum register with arbitrary fidelity. Here we present an alternative algorithm which uses a small number of quantum oracles…
The ability to efficiently state-prepare Gaussian distributions is critical to the success of numerous quantum algorithms. The most popular algorithm for this subroutine (Kitaev-Webb) has favorable polynomial resource scaling, however it…
One of the major components for realizing quantum computers is the ability to initialize the computer to a known fiducial state, also known as state preparation. We demonstrate a state preparation method via measurement-induced steering on…
Quantum machine learning algorithms have emerged to be a promising alternative to their classical counterparts as they leverage the power of quantum computers. Such algorithms have been developed to solve problems like electronic structure…
It is proposed that the state space of a quantum object with a complicated discrete spectrum can be used as a basis for multiqubit recording and processing of information in a quantum computer. As an example, nuclear spin 3/2 is considered.…
Preparation of quantum state lies at the heart of quantum information processing. The greedy algorithm provides a potential method to effectively prepare quantum states. However, the standard greedy algorithm, in general, cannot take the…
Finding the ground state of a Hamiltonian system is of great significance in many-body quantum physics and quantum chemistry. We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian. The crucial point…
Preparing quantum states is a fundamental task in various quantum algorithms. In particular, state preparation in quantum harmonic oscillators (HOs) is crucial for the creation of qudits and the implementation of high-dimensional…
We present a protocol for encoding $N$ real numbers stored in $N$ memory registers into the amplitudes of the quantum superposition that describes the state of $\log_2N$ qubits. This task is one of the main steps in quantum machine learning…
Quantum algorithms require accurate representations of electronic states on a quantum device, yet the approximation of electronic wave functions for strongly correlated systems remains a profound theoretical challenge, with existing methods…
An algorithm is proposed which transfers the quantum information of a wave function (analogue signal) into a register of qubits (digital signal) such that $n$ qubits describe the amplitudes and phases of $2^n$ points of a sufficiently…
Quantum state preparation is a fundamental component of quantum algorithms, particularly in quantum machine learning and data processing, where classical data must be encoded efficiently into quantum states. Existing amplitude encoding…
Quantum state preparation is an important subroutine for quantum computing. We show that any $n$-qubit quantum state can be prepared with a $\Theta(n)$-depth circuit using only single- and two-qubit gates, although with a cost of an…
We propose a general scheme for dissipatively preparing arbitrary pure quantum states on a multipartite qubit register in a finite number of basic control blocks. Our "splitting-subspace" approach relies on control resources that are…
State preparation is a fundamental routine in quantum computation, for which many algorithms have been proposed. Among them, perhaps the simplest one is the Grover-Rudolph algorithm. In this paper, we analyse the performance of this…
Here we show how universal quantum computers based on the quantum circuit model can handle mathematical analysis calculations for functions with continuous domains, without any digitalization, and with remarkably few qubits. The basic…