Search results for " quantum computation"
showing 7 items of 27 documents
Irreconcilable Difference Between Quantum Walks and Adiabatic Quantum Computing
2016
Continuous-time quantum walks and adiabatic quantum evolution are two general techniques for quantum computing, both of which are described by Hamiltonians that govern their evolutions by Schr\"odinger's equation. In the former, the Hamiltonian is fixed, while in the latter, the Hamiltonian varies with time. As a result, their formulations of Grover's algorithm evolve differently through Hilbert space. We show that this difference is fundamental; they cannot be made to evolve along each other's path without introducing structure more powerful than the standard oracle for unstructured search. For an adiabatic quantum evolution to evolve like the quantum walk search algorithm, it must interpo…
Adiabatic quantum search scheme with atoms in a cavity driven by lasers
2007
We propose an implementation of the quantum search algorithm of a marked item in an unsorted list of N items by adiabatic passage in a cavity-laser-atom system. We use an ensemble of N identical three-level atoms trapped in a single-mode cavity and driven by two lasers. In each atom, the same level represents a database entry. One of the atoms is marked by having an energy gap between its two ground states. Appropriate time delays between the two laser pulses allow one to populate the marked state starting from an initial entangled state within a decoherence-free adiabatic subspace. The time to achieve such a process is shown to exhibit the Grover speedup.
Analog Grover search by adiabatic passage in a cavity-laser-atom system
2008
A physical implementation of the adiabatic Grover search is theoretically investigated in a system of N identical three-level atoms trapped in a single mode cavity. Some of the atoms are marked through the presence of an energy gap between their two ground states. The search is controlled by two partially delayed lasers which allow a deterministic adiabatic transfer from an initially entangled state to the marked states. Pulse schemes are proposed to satisfy the Grover speedup either exactly or approximately, and the success rate of the search is calculated.
Adiabatic approximation for quantum dissipative systems: formulation, topology and superadiabatic tracking
2010
A generalized adiabatic approximation is formulated for a two-state dissipative Hamiltonian which is valid beyond weak dissipation regimes. The history of the adiabatic passage is described by superadiabatic bases as in the nondissipative regime. The topology of the eigenvalue surfaces shows that the population transfer requires, in general, a strong coupling with respect to the dissipation rate. We present, furthermore, an extension of the Davis-Dykhne-Pechukas formula to the dissipative regime using the formalism of Stokes lines. Processes of population transfer by an external frequency-chirped pulse-shaped field are given as examples.
Topology of adiabatic passage
2002
We examine the topology of eigenenergy surfaces characterizing the population transfer processes based on adiabatic passage. We show that this topology is the essential feature for the analysis of the population transfers and the prediction of its final result. We reinterpret diverse known processes, such as stimulated Raman adiabatic passage (STIRAP), frequency-chirped adiabatic passage and Stark-chirped rapid adiabatic passage. Moreover, using this picture, we display new related possibilities of transfer. In particular, we show that we can selectively control the level that will be populated in STIRAP process in $\ensuremath{\Lambda}$ or V systems by the choice of the peak amplitudes or …
Assessing the progress of trapped-ion processors towards fault-tolerant quantum computation
2017
41 pags., 32 figs., 7 tabs. -- Open Access funded by Creative Commons Atribution Licence 4.0
Holonomic Quantum Computation
2008
In this brief review we describe the idea of holonomic quantum computation. The idea of geometric phase and holonomy is introduced in a general way and we provide few examples that should help the reader understand the issues involved.