Related papers: Efficient Implementation of a Quantum Algorithm wi…
The notion of universal quantum computation can be generalized to multi-level qudits, which offer advantages in resource usage and algorithmic efficiencies. Trapped ions, which are pristine and well-controlled quantum systems, offer an…
To implement useful quantum algorithms which demonstrate quantum advantage, we must scale currently demonstrated quantum computers up significantly. Leading platforms such as trapped ions face physical challenges in including more…
The desired interference required for quantum computing may be modified by the wave function oscillations for the implementation of quantum algorithms[Phys.Rev.Lett.84(2000)1615]. To diminish such detrimental effect, we propose a scheme…
We propose a simpler and more efficient scheme for the implementation of the multi-valued Grover's quantum search. The multi-valued search generalizes the original Grover's search by replacing qubits with qudits --- quantum systems of $d$…
Recent developments in qudit-based quantum computing, in particular with trapped ions, open interesting possibilities for scaling quantum processors without increasing the number of physical information carriers. In this work, we propose a…
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…
The development of a universal fault-tolerant quantum computer that can solve efficiently various difficult computational problems is an outstanding challenge for science and technology. In this work, we propose a technique for an efficient…
We report the implementation of Grover's quantum search algorithm in the scalable system of trapped atomic ion quantum bits. Any one of four possible states of a two-qubit memory is marked, and following a single query of the search space,…
The central challenge of quantum computing is implementing high-fidelity quantum gates at scale. However, many existing approaches to qubit control suffer from a scale-performance trade-off, impeding progress towards the creation of useful…
We propose an ion trap implementation of Grover's quantum search algorithm for an unstructured database of arbitrary length N. The experimental implementation is appealingly simple because the linear ion trap allows for a straightforward…
We propose a scalable implementation of Grover's quantum search algorithm in a trapped-ion quantum information processor. The system is initialized in an entangled Dicke state by using simple adiabatic techniques. The…
We propose a potentially practical scheme for realization of an n-qubit (n>2) conditional phase flip (CPF) gate and implementation of Grover search algorithm in the ion-trap system. We demonstrate both analytically and numerically that, our…
Recent studies have been spurred on by the promise of advanced quantum computing technology, which has led to the development of quantum computer simulations on classical hardware. Grover's quantum search algorithm is one of the well-known…
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,…
The superpositional wave function oscillations for finite-time implementation of quantum algorithms modifies the desired interference required for quantum computing. We propose a scheme with trapped ultracold ion-pairs being qubits to…
Grover's search algorithm is one of the first quantum algorithms to exhibit a provable quantum advantage. It forms the backbone of numerous quantum applications and is widely used in benchmarking efforts. Here, we report…
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…
Quantum computers can solve certain problems more efficiently than any possible conventional computer. Small quantum algorithms have been demonstrated on multiple quantum computing platforms, many specifically tailored in hardware to…
So far, only the results on 3 qubit spaces (both on superconducting and ion-trap realisations of quantum processors) have beaten the classical unstructured search in the expected number of oracle calls using optimal protocols in both…
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…