Related papers: Implementation of many-qubit Grover search by cavi…
We propose a scheme to realize a multiqubit tunable phase gate in a circuit QED setup where two resonators, each coupling with a qudit, are interconnected to a common qudit (d=4). In this proposal, only two levels of each qudit serve as the…
Grover's quantum search algorithm is considered as one of the milestone in the field of quantum computing. The algorithm can search for a single match in a database with $N$ records in $O(\sqrt{N})$ assuming that the item must exist in the…
We describe an implementation of Grover's fixed-point quantum search algorithm on a nuclear magnetic resonance (NMR) quantum computer, searching for either one or two matching items in an unsorted database of four items. In this new…
Evolution of entanglement with the proceeding of quantum algorithms affects the outcome of the algorithm. Particularly, the performance of Grover's search algorithm gets worsened if the initial state of the algorithm is an entangled one.…
Quantum computation, in particular Grover's algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. Classical search procedures for an $N$ element database require at most…
Because noisy, intermediate-scale quantum (NISQ) machines accumulate errors quickly, we need new approaches to designing NISQ-aware algorithms and assessing their performance. Algorithms with characteristics that appear less desirable under…
We propose a scheme for realizing two-qubit quantum phase gates via an unconventional geometric phase shift with atoms in a cavity. In the scheme the atoms interact simultaneously with a highly detuned cavity mode and a classical field. The…
Using Grover algorithm, this work investigates a technique for encoding search phrases used in wildcard searches. The technique involves creating a phase Oracle that loads data into a quantum circuit together with the search terms that have…
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…
The search problem is to find a state satisfying certain properties out of a given set. Grover's algorithm drives a quantum computer from a prepared initial state to the target state and solves the problem quadratically faster than a…
An SO(3) picture of the generalized Grover's quantum searching algorithm,with arbitrary unitary transformation and with arbitrary phase rotations, is constructed. In this picture, any quantum search operation is a rotation in a 3…
The correction of errors is of fundamental importance for the development of contemporary computing devices and of robust communication protocols. In this paper we propose a scheme for the implementation of the three-qubit quantum…
We report the experimental implementation of Grover's quantum search algorithm on a quantum computer with three quantum bits. The computer consists of molecules of $^{13}$C-labeled CHFBr$_2$, in which the three weakly coupled spin-1/2…
Numerous sufficient conditions for adiabaticity of the evolution of a driven quantum system have been known for quite a long time. In contrast, necessary adiabatic conditions are scarce. A practicable necessary condition well-suited for…
Continuous-time quantum walks provide an alternative method for quantum search problems. Most of the earlier studies confirmed that quadratic speedup exists in some synthetic Hamiltonians, but whether there is quadratic speedup in real…
This thesis contains a collection of articles exploring various aspects of quantum information processing with cavity quantum electrodynamics (QED), starting with qubit noise spectroscopy and building towards the longer-term goal of modular…
We study a Grover-type method for Quadratic Unconstrained Binary Optimization (QUBO) problems. For an $n$-dimensional QUBO problem with $m$ nonzero terms, we construct a marker oracle for such problems with a tuneable parameter, $\Lambda…
Grover's Search algorithm was a breakthrough at the time it was introduced, and its underlying procedure of amplitude amplification has been a building block of many other algorithms and patterns for extracting information encoded in…
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…
We propose how to realize a three-step controlled-phase gate of one superconducting qubit simultaneously controlling n qubits selected from N qubits in a cavity (1<n<N). The operation time of this gate is independent of the number n of…