Related papers: Efficient State Preparation via Ion Trap Quantum C…
The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability to measure a marked state as a function of time is calculated, and found to depend strongly on the specific initial state. The…
Quantum computing gates are proposed to apply on trapped ions in decoherence-free states. As phase changes due to time evolution of components with different eigenenergies of quantum superposition are completely frozen, quantum computing…
We show how to prepare a single molecular ion in a specific internal quantum state in a situation where the molecule is trapped and sympathetically cooled by an atomic ion and where its internal degrees of freedom are initially in thermal…
Atomic ions trapped in ultra-high vacuum form an especially well-understood and useful physical system for quantum information processing. They provide excellent shielding of quantum information from environmental noise, while strong,…
Ubiquitous in quantum computing is the step to encode data into a quantum state. This process is called quantum state preparation, and its complexity for non-structured data is exponential on the number of qubits. Several works address this…
We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number $m$ of electrons occupying a given number $n$ of spin…
The main idea in the original Grover search (Phys. Rev. Lett. 79, 325 (1997)) is to single out a target state containing the solution to a search problem by amplifying the amplitude of the state, following the Oracle's job, i.e., a black…
We propose to employ the amplification mechanism of Grover's search algorithm to efficiently prepare entangled states of an ensemble of qubits. The conditional change of sign employed in the algorithm can be implemented by the phase shift…
We present schemes to prepare two-dimensional cluster states [H. J. Briegel and R. Raussendorf, Phys. Rev. Lett. {\bf 86}, 910 (2001)] with atomic ions confined in a micro-structured linear ion trap and coupled by an engineered spin-spin…
Quantum simulation of complex quantum systems and their properties often requires the ability to prepare initial states in an eigenstate of the Hamiltonian to be simulated. In addition, to compute the eigenvalues of a Hamiltonian is in…
This paper presents an enhancement to Grover's search algorithm for instances where the number of items (or the size of the search problem) $N$ is not a power of 2. By employing an efficient algorithm for the preparation of uniform quantum…
Amplitude Amplification -- a key component of Grover's Search algorithm -- uses an iterative approach to systematically increase the probability of one or multiple target states. We present novel strategies to enhance the amplification…
This work examines optimized strategies for the preparation of single molecular ions in well-defined rotational quantum states in an ion trap with the example of the molecular nitrogen ion N2+. It advances a two-step approach consisting of…
We study the production of low atom number Fock states by reducing suddenly the potential trap in a 1D strongly interacting (Tonks-Girardeau) gas. The fidelity of the Fock state preparation is characterized by the average and variance of…
We describe a simple quantum algorithm for preparing $K$ copies of an $N$-dimensional quantum state whose amplitudes are given by a quantum oracle. Our result extends a previous work of Grover, who showed how to prepare one copy in time…
Search-base algorithms have widespread applications in different scenarios. Grover's quantum search algorithms and its generalization, amplitude amplification, provide a quadratic speedup over classical search algorithms for unstructured…
Sparse quantum state preparation is a common subroutine in quantum algorithms, where classical data with few nonzero entries must be loaded into a quantum state. In this work, we consider the Grover-Rudolph algorithm, which has recently…
Searching large databases is an important problem with broad applications. The Grover search algorithm provides a powerful method for quantum computers to perform searches with a quadratic speedup in the number of required database queries…
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…
Quantum state preparation is an important subroutine in many quantum algorithms. The goal is to encode classical information directly to the quantum state so that it is possible to leverage quantum algorithms for data processing. However,…