Related papers: Efficient State Preparation via Ion Trap Quantum C…
The initialization of quantum states or Quantum State Preparation (QSP) is a basic subroutine in quantum algorithms. In the worst case, general QSP algorithms are expensive due to the application of multi-controlled gates required to build…
It is well known that Grover's algorithm asymptotically transforms an equal superposition state into an eigenstate (of a given basis). Here, we demonstrate a verification algorithm based on weak measurement which can achieve the same…
We propose a scheme for probabilistic teleportation of an unknown two-particle state of general formation in ion trap. It is shown that one can realize experimentally this teleportation protocol of two-particle state with presently…
Quantum algorithms use the principles of quantum mechanics, as for example quantum superposition, in order to solve particular problems outperforming standard computation. They are developed for cryptography, searching, optimisation,…
Unstructured search remains as one of the significant challenges in computer science, as classical search algorithms become increasingly impractical for large-scale systems due to their linear time complexity. Quantum algorithms, notably…
State preparation is a process encoding the classical data into the quantum systems. Based on quantum phase estimation, we propose the specific quantum circuits for a deterministic state preparation algorithm and a probabilistic state…
We first consider the basic requirements for a quantum computer, arguing for the attractiveness of nuclear spins as information-bearing entities, and light for the coupling which allows quantum gates. We then survey the strengths of and…
In this brief comment on `Grover search with pairs of trapped Ions' [Phys. Rev. A 63, 052308, (2001)], we show that Grover's algorithm may be performed exactly using the gate set given provided that small changes are made to the gate…
Grover's search algorithm is designed to be executed on a quantum mechanical computer. In this paper, the probabilistic wp-calculus is used to model and reason about Grover's algorithm. It is demonstrated that the calculus provides a…
An algebraic analysis of Grover's quantum search algorithm is presented for the case in which the initial state is an arbitrary pure quantum state of n qubits. This approach reveals the geometrical structure of the quantum search process,…
An introductory review of the linear ion trap is given, with particular regard to its use for quantum information processing. The discussion aims to bring together ideas from information theory and experimental ion trapping, to provide a…
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum…
This article introduces an enhancement to the Grover search algorithm to speed up computing the probability of finding good states. It suggests incorporating a rotation phase angle determined mathematically from the derivative of the model…
A quantum information processor is proposed that combines experimental techniques and technology successfully demonstrated either in nuclear magnetic resonance experiments or with trapped ions. An additional inhomogenenous magnetic field…
Highly efficient, nearly deterministic, and isotope selective generation of Yb$^+$ ions by 1- and 2-color photoionization is demonstrated. State preparation and state selective detection of hyperfine states in \ybodd is investigated in…
We have investigated ion dynamics associated with a dual linear ion trap where ions can be stored in and moved between two distinct locations. Such a trap is a building block for a system to engineer arbitrary quantum states of ion…
We propose a method to achieve scalable quantum computation based on fast quantum gates on an array of trapped ions, without the requirement of ion shuttling. Conditional quantum gates are obtained for any neighboring ions through…
Grover's quantum algorithm for an unstructured search problem and the Count algorithm by Brassard et al. are generalized to the case when the initial state is arbitrarily and maximally entangled. This ansatz might be relevant with quantum…
We present a scheme in which an ion trap quantum computer can be used to make arbitrarily accurate measurements of the quadrature phase variables for the collective vibrational motion of the ion. The electronic states of the ion become the…
We investigate in detail the effects of a QND vibrational number measurement made on single ions in a recently proposed measurement scheme for the vibrational state of a register of ions in a linear rf trap [C. D'Helon and G.J. Milburn,…