Related papers: The Grover algorithm with large nuclear spins in s…
We present a general strategy to extend quantum cluster algorithms for S=1/2 spin systems, such as the loop algorithm, to systems with arbitrary size of spins. In general, the partition function of a high-S spin system is represented in…
The nuclear spins in nanostructured semiconductors play a central role in quantum applications. The nuclear spins represent a useful resource for generating local magnetic fields but nuclear spin noise represents a major source of dephasing…
Grover's algorithm for quantum search can also be applied to classical energy transfer. The procedure takes a system in which the total energy is equally distributed among $N$ subsystems and transfers most of the it to one marked subsystem.…
Increasing the quantum information processing power with limited number of hosts is vital for achieving quantum advantage. Here we propose a novel scheme that achieves a scalable n-ion-2n-qubit quantum processor utilizing four internal…
As the engineering endeavour to realise quantum computers progresses, we consider that such machines need not rely on binary as their de facto unit of information. We investigate Grover's algorithm under a generalised quantum circuit model,…
We have developed semiconductor point contact devices in which nuclear spins in a nanoscale region are coherently controlled by all-electrical methods. Different from the standard nuclear-magnetic resonance technique, the longitudinal…
This work tests the performance of Grover's search circuits on some IBM superconducting quantum devices in case of the size of search space $N=2^4$ and $N=2^5$. Ideally, we expect to get an outcome probability distribution that is clearly…
Multi-objective search means searching for any one of several objectives in an unstructured database. Grover's algorithm has quadratic acceleration in multi-objection search than classical ones. Iterated operator in Grover's algorithm is a…
Grover's algorithm is a cornerstone of quantum search algorithm, offering quadratic speedup for unstructured problems. However, limited qubit counts and noise in today's noisy intermediate-scale quantum (NISQ) devices hinder large-scale…
This paper presents an enhancement to Grover's search algorithm for instances where the number of items (or the size of the search problem) $N$ is not a power of 2. By employing an efficient algorithm for the preparation of uniform quantum…
For spin-based quantum computation in semiconductors, dephasing of electron spins by a fluctuating background of nuclear spins is a main obstacle. Here we show that this nuclear background can be precisely controlled in generic quantum dots…
Grover's algorithm for quantum searching of a database is generalized to deal with arbitrary initial amplitude distributions. First order linear difference equations are found for the time evolution of the amplitudes of the r marked and N-r…
The Generator Coordinate Method (GCM) in the Gaussian Overlap Approximation (GOA) is applied to a description of the nuclear quadrupole collective states. The full five-dimensional quadrupole tensor is used as a set of the generator…
We show how to divide a coupled multi-spin system into a small subset of ``active'' spins that evolve under chemical shift or scalar coupling operators, and a larger subset of ``spectator'' spins which are returned to their initial states,…
Grover's algorithm, orginally conceived as a means of searching an unordered database, can also be used to extract solutions from the result sets generated by quantum computations. The Grover algorithm exploits the concept of an oracle…
We describe a simulation method for a quantum spin model of a generic, general purpose quantum computer. The use of this quantum computer simulator is illustrated through several implementations of Grover's database search algorithm. Some…
We investigate the role of the nuclear spin quantum dynamics in hyperfine-induced spin relaxation of hopping carriers in organic semiconductors. The fast hopping regime with a small carrier spin precession during a waiting time between hops…
We propose a model for spectral diffusion of localized spins in semiconductors due to the dipolar fluctuations of lattice nuclear spins. Each nuclear spin flip-flop is assumed to be independent, the rate for this process being calculated by…
The success probability of a search of $M$ targets from a database of size $N$, using Grover's search algorithm depends critically on the number of iterations of the composite operation of the oracle followed by Grover's diffusion…
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…