In this paper, we study decoherence on Grover's quantum searching algorithm using a perturbative method. We assume that each two-state system (qubit) suffers σ_{z} error with probability p (0\leq p\leq 1) independently at every step in the algorithm. Considering an n-qubit density operator to which Grover's operation is applied M times, we expand it in powers of 2Mnp and derive its matrix element order by order under the n\to \infty limit. (In this large n limit, we assume p is small enough, so that 2Mnp(\geq 0) can take any real positive value or 0.) This approach gives us an interpretation about creation of new modes caused by σ_{z} error and an asymptotic form of an arbitrary order correction. Calculating the matrix element up to the fifth order term numerically, we investigate a region of 2Mnp (perturbative parameter) where the algorithm finds the correct item with a threshold of probability P_{th} or more. It satisfies 2Mnp<(8/5)(1-P_{th}) around 2Mnp\simeq 0 and P_{th}\simeq 1, and this linear relation is applied to a wide range of P_{th} approximately. This observation is similar to a result obtained by E. Bernstein and U. Vazirani concerning accuracy of quantum gates for general algorithms. We cannot investigate a quantum to classical phase transition of the algorithm, because it is outside the reliable domain of our perturbation theory.
Using the methods of quantum trajectories we study effects of dissipative decoherence on the accuracy of the Grover quantum search algorithm. The dependence on the number of qubits and dissipation rate are determined and tested numerically with up to 16 qubits. As a result, our numerical and analytical studies give the universal law for decay of fidelity and probability of searched state which are induced by dissipative decoherence effects. This law is in agreement with the results obtained previously for quantum chaos algorithms.
In this paper, we study decoherence in Grover's quantum search algorithm using a perturbative method. We assume that each two-state system (qubit) that belongs to a register suffers a phase flip error (σ_{z} error) with probability p independently at every step in the algorithm, where $0\leq p\leq 1$. Considering an n-qubit density operator to which Grover's iterative operation is applied M times, we expand it in powers of 2Mnp and derive its matrix element order by order under the large-n limit. [In this large-n limit, we assume p is small enough, so that 2Mnp can take any real positive value…
The decoherence effect on Grover algorithm has been studied numerically through a noise modelled by a depolarizing channel. Two types of error are introduced characterizing the qubit time evolution and gate application, so the noise is directly related to the quantum network construction. The numerical simulation concludes an exponential damping law for the successive probability of the maxima as time increases. We have obtained an allowed-error law for the algorithm: the error threshold for the allowed noise behaves as Eth(N) ~ 1/N1.1 (N being the size of the data set). As the power of N is a…
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 with trapped ion-pairs being qubits and apply the scheme to the Grover search. It can be found that our scheme can not only carry out a full Grover search, but also meet the requirement for the scalable hot-ion quantum computing. Moreover, the ion-pair qubits in our scheme are more robust against the decoherence and the dissipation caused by the environment tha…
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 numerical and analytical results show existence of regular and chaotic phases depending on the static imperfection strength $ε$. The critical border $ε_c$ between two phases drops polynomially with the number of qubits $n_q$ as $ε_c \sim n_q^{-3/2}$. In the regular phase $(ε< ε_c)$ the algorithm remains robust against imperfections showing the efficiency gain $…
Recent experiments show the existence of collective decoherence in quantum systems. We study the possibility of quantum computation in decoherence free subspace which is robust against such kind of decoherence processes. This passive protection protocol can be especially advantageous for continuous quantum computation such as quantum annealers. As an example we propose to use decoherence protected adiabatic quantum computation for the Grover search problem. Our proposal contains only two-body interactions, making it feasible in near-term quantum devices.
We report the realization, using nuclear magnetic resonance techniques, of the first quantum computer that reliably executes an algorithm in the presence of strong decoherence. The computer is based on a quantum error avoidance code that protects against a class of multiple-qubit errors. The code stores two decoherence-free logical qubits in four noisy physical qubits. The computer successfully executes Grover's search algorithm in the presence of arbitrarily strong engineered decoherence. A control computer with no decoherence protection consistently fails under the same conditions.
We study the decoherence effects originating from state flipping and depolarization for two-dimensional discrete-time quantum walks using four-state and two-state particles. By quantifying the quantum correlations between the particle and position degree of freedom and between the two spatial ($x-y$) degrees of freedom using measurement induced disturbance (MID), we show that the two schemes using a two-state particle are more robust against decoherence than the Grover walk, which uses a four-state particle. We also show that the symmetries which hold for two-state quantum walks breakdown for …
Quantum random walk in a two-dimensional lattice with randomly distributed traps is investigated. Distributions of quantum walkers are evaluated dynamically for the cases of Hadamard, Fourier, and Grover coins, and quantum to classical transition is examined as a function of the density of the traps. It is shown that traps act as a serious and additional source of quantum decoherence. Furthermore, non-trivial temporal dependence of the standard deviation of the probability distribution of the walker is found when the trapping imperfections are introduced.
An examination of the concept of using classical degrees of freedom to drive the evolution of quantum computers is given. Specifically, when externally generated, coherent states of the electromagnetic field are used to drive transitions within the qubit system, a decoherence results due to the back reaction from the qubits onto the quantum field. We derive an expression for the decoherence rate for two cases, that of the single-qubit Walsh-Hadamard transform, and for an implementation of the controlled-NOT gate. We examine the impact of this decoherence mechanism on Grover's search algorithm,…
Minimizing the effect of decoherence on a quantum register must be a central part of any strategy to realize scalable quantum information processing. Apart from the strength of the coupling to the environment, the decoherence rate is determined by the the system level structure and by the spectral composition of the noise trace that the environment generates. Here, we discuss a relatively simple model that allows us to study these different effects quantitatively in detail. We evaluate the effect that the perturbation has on an NMR system while it performs a Grover search algorithm.
For any symmetric key cryptosystem with $n$-bit secret key, the key can be recovered in $O(2^{n/2})$ exploiting Grover search algorithm, resulting in the effective key length to be half. In this direction, subsequent work has been done on AES and some other block ciphers. On the other hand, lightweight ciphers like SIMON was left unexplored. In this backdrop, we present Grover's search algorithm on all the variants of SIMON and enumerate the quantum resources to implement such attack in terms of NOT, CNOT and Toffoli gates. We also provide the T-depth of the circuits and the number of qubits r…
We discuss how to build some partially entangled states of $n$ two-state quantum systems (qubits). The optimal partially entangled state with a high degree of symmetry is considered to be useful for overcoming a shot noise limit of Ramsey spectroscopy under some decoherence. This state is invariant under permutation of any two qubits and inversion between the ground state $|0\ket$ and an excited state $|1\ket$ for each qubit. We show that using selective phase shifts in certain basis vectors and Grover's inversion about average operations, we can construct this high symmetric entangled state b…
In this paper, we analyze the quantum counting under the decoherence, which can find the number of solutions satisfying a given oracle. We investigate probability distributions related to the first order term of the error rate on the quantum counting with the depolarizing channel. We also implement two circuits for the quantum counting -- the ascending-order circuit and the descending-order circuit -- by reversing ordering of application of controlled-Grover operations. By theoretical and numerical calculations for probability distributions, we reveal the difference of probability distribution…
Motivated by the similarity between adiabatic quantum algorithms and quantum phase transitions, we study the impact of decoherence on the sweep through a second-order quantum phase transition for the prototypical example of the Ising chain in a transverse field and compare it to the adiabatic version of Grovers search algorithm, which displays a first order quantum phase transition. For site-independent and site-dependent coupling strengths as well as different operator couplings, the results show that (in contrast to first-order transitions) the impact of decoherence caused by a weak coupling…
Decoherence in quantum searches, and in the Grover search in particular, has already been extensively studied, leading very quickly to the loss of the quadratic speedup over the classical case, when searching for some target (marked) element within a set of size $N$. The noise models used were, however, global. In this paper we study Grover search under the influence of localized partially dephasing noise of rate $p$. We find, that in the case when the size $k$ of the affected subspace is much smaller than $N$, and the target is unaffected by the noise, namely when $kp\ll\sqrt{N}$, the quadrat…
The search operation for a marked state by means of Grover's quantum searching algorithm is shown to be an element of group SU(2) which acts on a 2-dimensional space spanned by the marked state and the unmarked collective state. Based on this underlying structure, those exact bounds of the steps in various quantum search algorithms are obtained in a quite concise way. This reformulation of the quantum searching algorithm also enables a detailed analysis of the decoherence effects caused by its coupling with an environment. It turns out that the environment will not only make the quantum search…
In this work we study several models of decoherence and how different quantum maps and algorithms react when perturbed by them. Following closely Ref. [1], generalizations of the three paradigmatic one single qubit quantum channels (these are the depolarizing channel, the phase damping channel and the amplitude damping channel) for the case of an arbitrarily-sized finite-dimensional Hilbert space are presented, as well as other types of noise in phase space. More specifically, Grover's search algorithm's response to decoherence is analyzed; together with those of a family of quantum versions o…
It is found that Grover's quantum search algorithm is not robust against phase inversion and Hadmard transformation inaccuracies. Imperfect phase inversions and Hadmard-Walsh transformations in Grover's quantum search algorithm lead to reductions in the maximum probability of the marked state and affect the efficiency of the algorithm. even in the absence of decoherence. Given the degrees of inaccuracies, we find that to guarantee half rate of success, the size of the database should be in the order of $O({1 \over δ^2})$, where $δ$ is the uncertainty.
We consider an adiabatic quantum algorithm (Grover's search routine) weakly coupled to a rather general environment, i.e., without using the Markov approximation. Markovian errors generally require high-energy excitations (of the reservoir) and tend to destroy the scalability of the adiabatic quantum algorithm. We find that, under appropriate conditions (such as low temperatures), the low-energy (i.e., non-Markovian) modes of the bath are most important. Hence the scalability of the adiabatic quantum algorithm depends on the infra-red behavior of the environment: a reasonably small coupling to…
We analyze the robustness of Grover's quantum search algorithm performed by a quantum register under a possibly time-correlated noise acting locally on the qubits. We model the noise as originating from an arbitrary but fixed unitary evolution, $U$, of some noisy qubits. The noise can occur with some probability in the interval between any pair of consecutive noiseless Grover evolutions. Although each run of the algorithm is a unitary process, the noise model leads to decoherence when all possible runs are considered. We derive a set of unitary $U$'s, called the 'good noises,' for which the su…
We propose a scheme to implement two-qubit Grover's quantum search algorithm using Cavity Quantum Electrodynamics. Circular Rydberg atoms are used as quantum bits (qubits). They interact with the electromagnetic field of a non-resonant cavity . The quantum gate dynamics is provided by a cavity-assisted collision, robust against decoherence processes. We present the detailed procedure and analyze the experimental feasibility.
Recently several quantum search algorithms based on quantum walks were proposed. Those algorithms differ from Grover's algorithm in many aspects. The goal is to find a marked vertex in a graph faster than classical algorithms. Since the implementation of those new algorithms in quantum computers or in other quantum devices is error-prone, it is important to analyze their robustness under decoherence. In this work we analyze the impact of decoherence on quantum search algorithms implemented on two-dimensional grids and on hypercubes.
Recent advances in levitated optomechanics provide new perspectives for the use of rotational degrees of freedom for the development of quantum technologies as well as for testing fundamental physics. As for the translational case, their use, especially in the quantum regime, is limited by environmental noises, whose characterization is fundamental in order to assess, control and minimize their effect, in particular decoherence. Here, we present a general perturbative approach to compute decoherence for a quantum system in a superposition of its rotational degrees of freedom. The specific case…
A direct classical analog of quantum decoherence is introduced. Similarities and differences between decoherence dynamics examined quantum mechanically and classically are exposed via a second-order perturbative treatment and via a strong decoherence theory, showing a strong dependence on the nature of the system-environment coupling. For example, for the traditionally assumed linear coupling, the classical and quantum results are shown to be in exact agreement.
We construct generally applicable short-time perturbative expansions for some fidelities, such as the input-output fidelity, the entanglement fidelity, and the average fidelity. Successive terms of these expansions yield characteristic times for the damping of the fidelities involving successive powers of the Hamiltonian. The second-order results, which represent the damping rates of the fidelities, are extensively discussed. As an interesting application of these expansions, we use them to study the spatially-correlated dissipation of quantum bits. Spatial correlations in the dissipation are …
A quantum memory interacts with its environment and loses information via decoherence as well as incoherence. A robust quantum control that prepares, preserves, and manipulates nonclassical correlations even in the presence of environmental influence is of paramount importance in quantum information processing. A well-known technique to suppress decoherence, namely Dynamical Decoupling (DD), consists of a sequence of rapid flips applied to the system in order to refocus the system-environment interactions. In this work, we integrate DD with quantum gates using optimal control techniques to rea…
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 diminish the detrimental effect of the wave function oscillations, and apply the scheme to the two-qubit Grover's search. It can be also found that the qubits in our scheme are more robust against the decoherence caused by the environment, and the model is scalable.
We study the influence of errors and decoherence on both the performance of Shor's factoring algorithm and Grover's search algorithm, and on the amount of interference in these algorithms using a recently proposed interference measure. We consider systematic unitary errors, random unitary errors, and decoherence processes. We show that unitary errors which destroy the interference destroy the efficiency of the algorithm, too. However, unitary errors may also create useless additional interference. In such a case the total amount of interference can increase, while the efficiency of the quantum…
We re-derive the quantum master equation for the decoherence of a massive Brownian particle due to collisions with the lighter particles from a thermal environment. Our careful treatment avoids the occurrence of squares of Dirac delta functions. It leads to a decoherence rate which is smaller by a factor of 2 pi compared to previous findings. This result, which is in agreement with recent experiments, is confirmed by both a physical analysis of the problem and by a perturbative calculation in the weak coupling limit.
The theory of decoherent histories is an attempt to derive classical physics from positing only quantum laws at the fundamental level without notions of a classical apparatus or collapse of the wave-function. Searching for a marked target in a list of N items requires Ω(N) oracle queries when using a classical computer, while a quantum computer can accomplish the same task in O{\sqrt{N}} queries using Grover's quantum algorithm. We study a closed quantum system executing Grover algorithm in the framework of decoherent histories and find it to be an exactly solvable model, thus yielding an alte…
The effect of decoherence on the continuous-time quantum walk on the hypercube is revisited. Previously, an exact solution was found for a decoherence model that preserved the effective tensor-product form of the dynamics. Here a new model is presented, inspired by perfect quantum state transfer in qubit networks. A perturbative solution is found for the dynamics of this model which is not of a tensor-product form. In contrast to previous results, the hitting probability has a lower bound that is independent of the hypercube dimension.
We propose a new adiabatic algorithm for the unsorted database search problem. This algorithm saves two thirds of qubits than Grover's algorithm in realizations. Meanwhile, we analyze the time complexity of the algorithm by both perturbative method and numerical simulation. The results show it provides a better speedup than the previous adiabatic search algorithm.
A direct classical analog of the quantum dynamics of intrinsic decoherence in Hamiltonian systems, characterized by the time dependence of the linear entropy of the reduced density operator, is introduced. The similarities and differences between the classical and quantum decoherence dynamics of an initial quantum state are exposed using both analytical and computational results. In particular, the classicality of early-time intrinsic decoherence dynamics is explored analytically using a second-order perturbative treatment, and an interesting connection between decoherence rates and the stabil…
We study non-perturbatively the time evolution of a qubit subject to amplitude-damping noise. We show that at strong coupling the qubit decoherence can be quenched owing to large environment feedbacks, such that the qubit can evolve coherently even in the long-time limit. As an application, we show that for a quantum channel that consists of two independent qubits subject to uncorrelated local amplitude-damping noises, it can maintain at strong coupling finite entanglement and better than classical teleportation fidelity at long times.
We have studied the emergence of classical states in the perturbative interaction model. The states which interact with many other degrees of freedom, such as the center of mass of a macro-object, play important role. Although the random phase mechanism is effective as same as Zurek's strong correlation model, there are enormous states, each of which independently developes due to the orthogonality of the environmental states. In these privileged states, the subsystem picture with the separability is stable.
The decoherence of two initially entangled qubits in a non-Markovian reservoir has been investigated exactly without Born Markovian approximation and rotating-wave approximation(RWA). The non-perturbative quantum master equation is derived and its exact solution is obtained. The decoherence behaviors of two qubits, initially entangled in Bell states, has been investigated in three different cases of parameters. The results show that the counter-rotating wave terms have great influence on the decoherence behavior, and there are differences between the exact solution of the Hamiltonian with RWA …
We present a new method for the solution of the behavior of an ensemble of qubits in a random time-dependent external field. The forward evolution in time is governed by a transfer matrix. The elements of this matrix determine the various decoherence times. The method provides an exact solution in cases where the noise is piecewise constant in time. We show that it applies, for example, to a realistic model of decoherence of electron spins in semiconductors. Results are obtained for the non-perturbative regimes of the models, and we see a transition from weak relaxation to overdamped behavior …
The question of whether unobserved short-wavelength modes of the gravitational field can induce decoherence in the long-wavelength modes (``the decoherence of spacetime'') is addressed using a simplified model of perturbative general relativity, related to the Nordstrom-Einstein-Fokker theory, where the metric is assumed to be conformally flat. For some long-wavelength coarse grainings, the Feynman-Vernon influence phase is found to be effective at suppressing the off-diagonal elements of the decoherence functional. The requirement that the short-wavelength modes be in a sufficiently high-temp…
We construct a new error-suppression scheme that makes use of the adjoint of reversible quantum algorithms. For decoherence induced errors such as depolarization, it is presented that provided the depolarization error probability is less than 1, our scheme can exponentially reduce the final output error rate to zero using a number of cycles, and the output state can be coherently sent to another stage of quantum computation process. Besides, experimental set-ups via optical approach have been proposed using Grover's search algorithm as an example. Some further discussion on the benefits and li…
We study decoherence in a simple quantum mechanical model using two approaches. Firstly, we follow the conventional approach to decoherence where one is interested in solving the reduced density matrix from the perturbative master equation. Secondly, we consider our novel correlator approach to decoherence where entropy is generated by neglecting observationally inaccessible correlators. We show that both methods can accurately predict decoherence time scales. However, the perturbative master equation generically suffers from instabilities which prevents us to reliably calculate the system's t…
We present a perturbative treatment of the subohmic spin-boson model which remedies a crucial flaw in previous treatments. The problem is traced back to the incorrect application of a Markov type approximation to specific terms in the temporal evolution of the reduced density matrix. The modified solution is consistent both with numerical simulations and the exact solution obtained when the bath-coupling spin-space direction is parallel to the qubit energy-basis spin. We therefore demonstrate that %in distinction to previous findings the subohmic spin-boson model is capable of %consistently de…
Quantum computation using qubits made of two component Bose-Einstein condensates (BECs) is analysed. The use of BECs allows for an increase of energy scales via bosonic enhancement, resulting in gate operations that can be performed at a macroscopically large energy scale. The large energy scale of the gate operations results in quantum algorithms that may be executed at a time reduced by a factor of N, where N is the number of bosons per qubit. The encoding of the qubits allows for no intrinsic penalty on decoherence times. We illustrate the scheme by an application to Deutsch's and Grover's …
Quantum Brownian oscillator model (QBM), in the Fock-space representation, can be viewed as a multi-level spin-boson model. At sufficiently low temperature, the oscillator degrees of freedom are dynamically reduced to the lowest two levels and the system behaves effectively as a two-level (E2L) spin-boson model (SBM) in this limit. We discuss the physical mechanism of level reduction and analyze the behavior of E2L-SBM from the QBM solutions. The availability of close solutions for the QBM enables us to study the non-Markovian features of decoherence and leakage in a SBM in the non-perturbativ…
Based on a generic quantum open system model, we study the geometric nature of decoherence by defining a complex-valued geometric phase through stochastic pure states describing non-unitary, non-cyclic and non-adiabatic evolutions. The ensemble average of the complex geometric phases for the pure stochastic states yields a conventional geometric phase together with an amplitude factor. We show that the decoherence process described by the decaying amplitude can be a geometric quantity independent of the system's dynamics. It is a remarkable fact that the geometric phase of a quantum system can…
Grover's database search algorithm, although discovered in the context of quantum computation, can be implemented using any physical system that allows superposition of states. A physical realization of this algorithm is described using coupled simple harmonic oscillators, which can be exactly solved in both classical and quantum domains. Classical wave algorithms are far more stable against decoherence compared to their quantum counterparts. In addition to providing convenient demonstration models, they may have a role in practical situations, such as catalysis.
A perturbative treatment of reduced density operators of quantum subsystems is implemented in the same spirit as Fermi Golden Rule for scattering. Analytic expressions for linear entropy (a measure of purity loss, and in some cases of coherence loss) and for subsystem's energy variations (dissipation) are given. Application to electromagnetic field superposition states in a dissipative cavity is performed. Evaluation of typical field and reservoir time scales ($τ_{F}$ and $τ_{R}$) show that even for small temperatures they are very different. We also indicate the condition on the cutoff temper…
With current technologies, it seems to be very difficult to implement quantum computers with many qubits. It is therefore of importance to simulate quantum algorithms and circuits on the existing computers. However, for a large-size problem, the simulation often requires more computational power than is available from sequential processing. Therefore, the simulation methods using parallel processing are required. We have developed a general-purpose simulator for quantum computing on the parallel computer (Sun, Enterprise4500). It can deal with up-to 30 qubits. We have performed Shor's factoriz…
We show that the pointer basis distinguished by collisional decoherence consists of exponentially localized, solitonic wave packets. Based on the orthogonal unraveling of the quantum master equation, we characterize their formation and dynamics, and we demonstrate that the statistical weights arising from an initial superposition state are given by the required projection. Since the spatial width of the pointer states can be obtained by accounting for the gas environment in a microscopically realistic fashion, one may thus calculate the coherence length of a strongly interacting gas.
We study dynamics of quantum open systems, paying special attention to those aspects of their evolution which are relevant to the transition from quantum to classical. We begin with a discussion of the conditional dynamics of simple systems. The resulting models are straightforward but suffice to illustrate basic physical ideas behind quantum measurements and decoherence. To discuss decoherence and environment-induced superselection einselection in a more general setting, we sketch perturbative as well as exact derivations of several master equations valid for various systems. Using these equa…
In this work, we present an efficient rank-compression approach for the classical simulation of Kraus decoherence channels in noisy quantum circuits. The approximation is achieved through iterative compression of the density matrix based on its leading eigenbasis during each simulation step without the need to store, manipulate, or diagonalize the full matrix. We implement this algorithm in an in-house simulator, and show that the low rank algorithm speeds up simulations by more than two orders of magnitude over an existing implementation of full rank simulator, and with negligible error in th…
Adopting the viewpoint that the standard perturbative quantization of general relativity provides an effective description of quantum gravity that is valid at ordinary energies, we show that gravity as an environment induces the rapid decoherence of stationary matter superposition states when the energy differences in the superposition exceed the Planck energy scale.
