Related papers: Grover's algorithm on two-way quantum computer
Quantum advantage is the core of quantum computing. Grover's search algorithm is the only quantum algorithm with proven advantage to any possible classical search algorithm. However, realizing this quantum advantage in practice is quite…
Grover's quantum algorithm improves any classical search algorithm. We show how random Gaussian noise at each step of the algorithm can be modelled easily because of the exact recursion formulas available for computing the quantum amplitude…
In order to understand the bounds of utilization of the Grover's search algorithm for the large unstructured data in presence of the quantum computer noise, we undertake a series of simulations by inflicting various types of noise, modelled…
The decoherence effect on Grover algorithm has been studied numerically through a noise modelled by a depolarizing channel. Two types of error are introduced characterizing the qubit time evolution and gate application, so the noise is…
The method of noisy multiqubit quantum circuits modeling is proposed. The analytical formulas for the dependence of quantum algorithms accuracy on qubits count and noise level are obtained for Grover algorithm and quantum Fourier transform.…
While limitations on quantum computation by Markovian environmental noise are well-understood in generality, their behavior for different quantum circuits and noise realizations can be less universal. Here we consider a canonical quantum…
Grover's quantum search algorithm promises a quadratic speedup for unstructured search over its classical counterpart. But this advantage is affected by noise acting on the search space. Here, we show that a quantum switch can act as a…
The Grover search algorithm is a pivotal advancement in quantum computing, promising a remarkable speedup over classical algorithms in searching unstructured large databases. Here, we report results for the implementation and…
We study effects of static inter-qubit interactions and random errors in quantum gates on the stability of various quantum algorithms including the Grover quantum search algorithm and the quantum chaos maps. For the Grover algorithm our…
Constraint satisfiability problems, crucial to several applications, are solved on a quantum computer using Grover's search algorithm, leading to a quadratic improvement over the classical case. The solutions are obtained with high…
This paper is a gentle but rigorous introduction to quantum computing intended for discrete mathematicians. Starting from a small set of assumptions on the behavior of quantum computing devices, we analyze their main characteristics,…
We consider Grover's search algorithm on a model quantum computer implemented on a chain of four or five nuclear spins with first and second neighbour Ising interactions. Noise is introduced into the system in terms of random fluctuations…
We report the realization, using nuclear magnetic resonance techniques, of the first quantum computer that reliably executes an algorithm in the presence of strong decoherence. The computer is based on a quantum error avoidance code that…
While quantum computers assume existence of state preparation process $|0\rangle$, CPT symmetry of physics says that performing such process in CPT symmetry perspective, e.g. reversing used EM impulses ($V(t)\to V(-t)$), we should get its…
Grover's algorithm is a primary algorithm offered as evidence that quantum computers can provide an advantage over classical computers. It involves an "oracle" specified for a given application whose structure is not part of the formal…
We analyze the robustness of Grover's quantum search algorithm performed by a quantum register under a possibly time-correlated noise acting locally on the qubits. We model the noise as originating from an arbitrary but fixed unitary…
The problem of automatically protecting a quantum system against noise in a closed circuit is analyzed. A general scheme is developed built from two steps. At first, a distillation step is induced in which undesired components are removed…
Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size…
We investigate the problem of quantum searching on a noisy quantum computer. Taking a 'fault-ignorant' approach, we analyze quantum algorithms that solve the task for various different noise strengths, which are possibly unknown beforehand.…
In this paper, we study decoherence on Grover's quantum searching algorithm using a perturbative method. We assume that each two-state system (qubit) suffers \sigma_{z} error with probability p (0\leq p\leq 1) independently at every step in…