相关论文: Experimental realization of a continuous version o…

The rapid progress of computer science has been accompanied by a corresponding evolution of computation, from classical computation to quantum computation. As quantum computing is on its way to becoming an established discipline of…

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…

We report an ensemble nuclear magnetic resonance (NMR) implementation of a quantum lattice gas algorithm for the diffusion equation. The algorithm employs an array of quantum information processors sharing classical information, a novel…

We have developed a non-unitary extension of Grover's search algorithm by changing the hidden geometry of Hilbert space carried by diffusion operator. Our algorithm finds the solution for search problem by performing a unique bigger…

In this work we study five Grovers algorithm modifications, where each iteration is constructed by two generalized Householder reflections, against inaccuracies in the phases. By using semi-empirical methods, we investigate various…

We investigate the performance of Grover's algorithm on three different generations of IBM Heron QPUs. On Heron family of IBM QPUs the success probabilities for three, four and five qubits without dynamical decoupling is better than results…

Quantum algorithm, as compared to classical algorithm, plays a notable role in solving linear systems of equations with an exponential speedup. Here, we demonstrate a method for solving a particular system of equations by using the concept…

The Grover algorithm is a crucial solution for addressing unstructured search problems and has emerged as an essential quantum subroutine in various complex algorithms. By using a different approach with previous studies, this research…

Efficient simulations of quantum evolutions of spin-1/2 systems are relevant for ensemble quantum computation as well as in typical NMR experiments. We propose an efficient method to calculate the dynamics of an observable provided that the…

This paper demonstrates that how well a state performs as an input to Grover's search algorithm depends critically upon the entanglement present in that state; the more entanglement, the less well the algorithm performs. More precisely,…

The Grover search algorithm is one of the two key algorithms in the field of quantum computing, and hence it is of significant interest to describe it in the most efficient mathematical formalism. We show firstly, that Clifford's formalism…

We consider the Grover search algorithm implementation for a quantum register of size $N = 2^k$ using k (or k +1) microwave- and laser-driven Rydberg-blockaded atoms, following the proposal by M{\o}lmer, Isenhower, and Saffman [J. Phys. B…

Solid-state NMR have been long used to probe atomic distances between nearby nuclear spins by virtue of the dipolar interaction. New technological advances have enabled simultaneous tuning of the radio-frequency resonance circuits to nuclei…

In the Grover-type quantum search process a search operator is iteratively applied, say, k times, on the initial database state. We present an additive decomposition scheme such that the iteration process is expressed, in the computational…

Quantum Information processing by NMR with small number of qubits is well established. Scaling to higher number of qubits is hindered by two major requirements (i) mutual coupling among qubits and (ii) qubit addressability. It has been…

We investigated the spin coherence of high-mobility two-dimensional electron gases confined in multilayer GaAs quantum wells. The dynamics of the spin polarization was optically studied using pump-probe techniques: time-resolved Kerr…

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…

A family of double-quantum excitation schemes is described for the solution nuclear magnetic resonance (NMR) of near-equivalent spin-1/2 pairs. These new methods exploit the spinor behaviour of 2-level systems, whose signature is the change…

We consider the evolution of a spin 1/2 (qubit) under the simultaneous continuous measurement of three non-commuting qubit operators sigma_x, sigma_y, sigma_z. For identical ideal detectors the qubit state evolves by approaching a pure…

The universal quantum homogeniser can transform a qubit from any state to any other state with arbitrary accuracy, using only unitary transformations to perform this task. Here we present an implementation of a finite quantum homogeniser…