相关论文: Implementation of many-qubit Grover search by cavi…

Quantum searching for one of $N$ marked items in an unsorted database of $n$ items is solved in $\mathcal{O}(\sqrt{n/N})$ steps using Grover's algorithm. Using nonlinear quantum dynamics with a Gross-Pitaevskii type quadratic nonlinearity,…

Compared with classical search algorithms, Grover quantum algorithm [ Phys. Rev. Lett., 79, 325(1997)] achieves quadratic speedup and Bruschweiler hybrid quantum algorithm [Phys. Rev. Lett., 85, 4815(2000)] achieves an exponential speedup.…

We propose a scheme for quantum computing using high-Q cavities in which the qubits are represented by single cavity modes restricted in the space spanned by the two lowest Fock states. We show that single qubit operations and universal…

Here we present a quantum electrodynamics (QED) model involving a large-detuned single-mode cavity field and $n$ identical two-level atoms. One of its applications for the preparation of the multi-particle states is analyzed. In addition to…

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…

We propose a simple method for realizing a multiqubit phase gate of one qubit simultaneously controlling $n$ target qubits, by using three-level quantum systems (i.e., qutrits) coupled to a cavity or resonator. The gate can be implemented…

Grover's search algorithm (GSA) is known to experience a loss of its quadratic speedup when exposed to quantum noise. In this study, we partially agree with this result and present our findings. First, we examine different typical…

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…

We present a feasible scheme to investigate the geometric phase for an atom trapped in an optical cavity induced by the effective decay process due to cavity photon loss. The cavity mode, together with the external driving fields, acts as…

We present a full implementation and simulation of a novel quantum reinforcement learning method. Our work is a detailed and formal proof of concept for how quantum algorithms can be used to solve reinforcement learning problems and shows…

Grover's search algorithm has attracted great attention due to its quadratic speedup over classical algorithms in unsorted database search problems. However, Grover's algorithm is inefficient in multi-target search problems, except in the…

In the multitarget Grover algorithm, we are given an unstructured N-element list of objects S_i containing a T-element subset tau and function f, called an oracle, such that f(S_i)=1 if S_i is in tau, otherwise f(S_i) = 0. By using quantum…

The main idea in the original Grover search (Phys. Rev. Lett. 79, 325 (1997)) is to single out a target state containing the solution to a search problem by amplifying the amplitude of the state, following the Oracle's job, i.e., a black…

Distributed quantum computation has garnered immense attention in the noisy intermediate-scale quantum (NISQ) era, where each computational node necessitates fewer qubits and quantum gates. In this paper, we focus on a generalized search…

Recent advances in quantum computing systems attract tremendous attention. Commercial companies, such as IBM, Amazon, and IonQ, have started to provide access to noisy intermediate-scale quantum computers. Researchers and entrepreneurs…

We give a dimension independent formulation of the quantum search algorithm introduced in [L. K. Grover, Phys. Rev. Lett. {\bf 79}, 325 (1997)]. This algorithm provides a quadratic gain when compared to its classical counterpart by…

Cavity quantum electrodynamics (QED) uses a cavity to engineer the mode structure of the vacuum electromagnetic field such as to enhance the interaction between light and matter. Exploiting these ideas in solid-state systems has lead to…

In the emerging domain of quantum algorithms, the Grover's quantum search is certainly one of the most significant. It is relatively simple, performs a useful task and more importantly, does it in an optimal way. However, due to the success…

We show how to realize high-fidelity quantum non-demolition qubit readout using longitudinal qubit-oscillator interaction. This is realized by modulating the longitudinal coupling at the cavity frequency. The qubit-oscillator interaction…

We present an algorithm for the generalized search problem (searching $k$ marked items among $N$ items) based on a continuous Hamiltonian and exploiting resonance. This resonant algorithm has the same time complexity $O(\sqrt{N/k})$ as the…