Related papers: The Grover algorithm with large nuclear spins in s…
The full design of relevant systems for quantum applications, ranging from quantum simulation to sensing, is presented using a combination of atomistic methods. A prototypical system features a two-dimensional ordered distribution of spins…
We theoretically investigate the influence of the fluctuating Overhauser field on the spin of an electron confined to a quantum dot (QD). The fluctuations arise from nuclear angular momentum being exchanged between different nuclei via the…
We present a general method which expresses a unitary operator by the product of operators allowed by the Hamiltonian of spin-1/2 systems. In this method, the generator of an operator is found first, and then the generator is expanded by…
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…
Run-times of quantum algorithms are often studied via an asymptotic, worst-case analysis. Whilst useful, such a comparison can often fall short: it is not uncommon for algorithms with a large worst-case run-time to end up performing well on…
Coherent two-level systems, or qubits, based on electron spins in GaAs quantum dots are strongly coupled to the nuclear spins of the host lattice via the hyperfine interaction. Realizing nuclear spin control would likely improve electron…
A scheme for decoupling and selectively recoupling large networks of dipolar-coupled spins is proposed. The scheme relies on a combination of broadband, decoupling pulse sequences applied to all the nuclear spins with a band-selective pulse…
Isolated electron spins in semiconductor nanostructures are promising qubit candidates for a solid state quantum computer, There have seen truly impressive experimental progresses in the study of single spins in the past two years. In this…
We present a continuous time quantum search algorithm analogous to Grover's. In particular, the optimal search time for this algorithm is proportional to $\sqrt{N}$, where $N$ is the database size. This search algorithm can be implemented…
Inspired by recent developments in the control and manipulation of quantum dot nuclear spins, which allow for the transfer of an electron spin state to the surrounding nuclear-spin ensemble for storage, we propose a quantum repeater scheme…
Grover's algorithm, a well-know quantum search algorithm, allows one to find the correct item in a database, with quadratic speedup. In this paper we adapt Grover's algorithm to the problem of finding a correct answer to a natural language…
Grover's quantum algorithm can find a marked item from an unstructured database faster than any classical algorithm, and hence it has been used for several applications such as cryptanalysis and optimization. When there exist multiple…
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…
The execution of Grover's quantum search algorithm needs rather limited resources without much fine tuning. Consequently, the algorithm can be implemented in a variety of physical set-ups, which involve wave dynamics but may not need other…
We calculate the Overhauser frequency shifts in semiconductor nanostructures resulting from the hyperfine interaction between nonequilibrium electronic spins and nuclear spins. The frequency shifts depend on the electronic local density of…
We have observed millisecond-long coherent evolution of nuclear spins in a quantum wire at 1.2 K. Local, all-electrical manipulation of nuclear spins is achieved by dynamic nuclear polarization in the breakdown regime of the Integer Quantum…
In this paper we propose an approach to prepare GHZ states of an arbitrary multi-particle system in terms of Grover's fast quantum searching algorithm. This approach can be regarded as an extension of the Grover's algorithm to find one or…
We propose a scheme to generate spin cat states, i.e., superpositions of maximally separated quasiclassical states on a single high-dimensional nuclear spin in a solid-state device. We exploit a strong quadrupolar nonlinearity to drive the…
State preparation is a fundamental routine in quantum computation, for which many algorithms have been proposed. Among them, perhaps the simplest one is the Grover-Rudolph algorithm. In this paper, we analyse the performance of this…
The main objective of quantum simulation is an in-depth understanding of many-body physics. It is important for fundamental issues (quantum phase transitions, transport, . . . ) and for the development of innovative materials. Analytic…