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 or zero. We regard $x\equiv 2Mnp(\geq 0)$ as a perturbative parameter.] We obtain recurrence relations between terms in the perturbative expansion. By these relations, we compute higher orders of the perturbation efficiently, so that we extend the range of the perturbative parameter that provides a reliable analysis. Calculating the matrix element numerically by this method, we derive the maximum value of the perturbative parameter x at which the algorithm finds a correct item with a given threshold of probability P_{th} or more. (We refer to this maximum value of x as x_{c}, a critical point of x.) We obtain a curve of x_{c} as a function of P_{th} by repeating this numerical calculation for many points of P_{th} and find the following facts: a tangent of the obtained curve at P_{th}=1 is given by x=(8/5)(1-P_{th}), and we have x_{c}>-(8/5)\log_{e}P_{th} near P_{th}=0.
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 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 a…
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…
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 $…
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.
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…
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…
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 describe our recent results on the resonant perturbation theory of decoherence and relaxation for quantum system with many qubits. The approach represents a rigorous analysis of the phenomenon of decoherence and relaxation for general $N$-level systems coupled to reservoirs of the bosonic fields. We derive a representation of the reduced dynamics valid for all times $t\geq 0$ and for small but fixed interaction strength. Our approach does not involve master equation approximations and applies to a wide variety of systems which are not explicitly solvable.
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 introduce the concepts of Grover operators and Grover kernels to systematically analyse Grover's searching algorithms. Then, we investigate a one-parameter family of quantum searching algorithms of Grover's type and we show that the standard Grover's algorithm is a distinguished member of this family. We show that all the algorithms of this class solve the searching problem with an efficiency of order $O(\sqrt{N})$, with a coefficient which is class-dependent. The analysis of this dependence is a test of the stability and robustness of the algorithms. We show the stability of this construct…
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.
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…
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 consider a universal set of quantum gates encoded within a perturbed decoherence-free subspace of four physical qubits. Using second-order perturbation theory and a measuring device modeled by an infinite set of harmonic oscillators, simply coupled to the system, we show that continuous observation of the coupling agent induces inhibition of the decoherence due to spurious perturbations. We thus advance the idea of protecting or even creating a decoherence-free subspace for processing quantum information.
A number of recent studies have investigated the introduction of decoherence in quantum walks and the resulting transition to classical random walks. Interestingly, it has been shown that algorithmic properties of quantum walks with decoherence such as the spreading rate are sometimes better than their purely quantum counterparts. Not only quantum walks with decoherence provide a generalization of quantum walks that naturally encompasses both the quantum and classical case, but they also give rise to new and different probability distribution. The application of quantum walks with decoherence …
In idealized models of a quantum register and its environment, quantum information can be stored indefinitely by encoding it into a decoherence-free subspace (DFS). Nevertheless, perturbations to the idealized register-environment coupling will cause decoherence in any realistic setting. Expanding a measure for state preservation, the dynamical fidelity, in powers of the strength of the perturbations, we prove stability to linear order is a generic property of quantum state evolution. The effect of noise perturbation is quantified by a concise expression for the strength of the quadratic, lead…
We explore a strategy for protecting the evolution of a qubit against the effects of environmental noise based on the application of controlled time-dependent perturbations. In the case of a purely decohering coupling, an explicit sequence of control operations is designed, able to average out the decoherence of the qubit with high efficiency. We argue that, in principle, the effects of arbitrary qubit-environment interactions can be removed through suitable decoupling perturbations acting on the system dynamics over time scales comparable to the correlation time of the environment.
The decoherence of a test particle interacting with an ideal gas is studied by the help of the effective Lagrangian, derived in the leading order of the perturbation expansion and in order $\ord{\partial^2_t}$. The stationary decoherence time is found to be comparable to or longer than the diffusion time. The decoherence time reaches its minimal value for classical, completely decohered environment, suggesting that physical decoherence is slowed down as compared with diffusion by the quantum coherence of the environment.
We investigate the sensitivity of quantum systems that are chaotic in a classical limit, to small perturbations of their equations of motion. This sensitivity, originally studied in the context of defining quantum chaos, is relevant to decoherence in situations when the environment has a chaotic classical counterpart.
We study the problem of robust performance of quantum systems under structured uncertainties. A specific feature of closed (Hamiltonian) quantum systems is that their poles lie on the imaginary axis and that neither a coherent controller nor physically relevant structured uncertainties can alter this situation. This changes for open systems where decoherence ensures asymptotic stability and creates a unique landscape of pure performance robustness, with the distinctive feature that closed-loop stability is secured by the underlying physics and needs not be enforced. This stability, however, is…
High contrast matter-wave interferometry is essential in various fundamental quantum mechanical experiments as well as for technical applications. Thereby, contrast and sensitivity are typically reduced by decoherence and dephasing effects. While decoherence accounts for a general loss of quantum information in a system due to entanglement with the environment, dephasing is due to collective time-dependent external phase shifts, which can be related to temperature drifts, mechanical vibrations or electromagnetic oscillations. In contrast to decoherence, dephasing can in principle be reversed. …
We present a general master equation for the quantum dynamics of a scalar bosonic particle interacting with an external weak and stochastic gravitational field. The dynamics predicts decoherence in position as well as in momentum. We show how the master equation reproduces the results present in the literature by taking appropriate limits, thus explaining the apparent contradiction in their dynamical description. We apply our model to a matter wave experiment, providing a practical formula for determining of the magnitude of gravitational decoherence. We compare it with the standard experiment…
It was shown recently [D.A. Lidar et al., Phys. Rev. Lett. 81, 2594 (1998)] that within the framework of the semigroup Markovian master equation, decoherence-free (DF) subspaces exist which are stable to first order in time to a perturbation. Here this result is extended to the non-Markovian regime and generalized. In particular, it is shown that within both the semigroup and the non-Markovian operator sum representation, DF subspaces are stable to all orders in time to a symmetry-breaking perturbation. DF subspaces are thus ideal for quantum memory applications. For quantum computation, howev…
We discuss the possible role of isocurvature perturbations for the quantum decoherence of the curvature perturbation during inflation. We point out that if the inflaton trajectory in field space is curved, the adiabatic mode is generically coupled to the isocurvature mode and thus tracing out the latter can cause the curvature perturbation to decohere. We explicitly investigate this suggestion in a model of inflation with two decoupled massive fields and find that decoherence is effective for a wide range of mass ratios. In particular, we calculate the entanglement entropy for this model and s…
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.
As opposed to traditional methods of multiple-quantum NMR spectroscopy authors of the article [G.A. Alvarez, D. Suter, Phys. Rev. A 84, 012320 (2011)] generated the effective double-quantum Hamiltonian, with the slight adding usual secular dipole-dipole Hamiltonian to the first one at the stage of the correlations preparing (so the perturbation appeared). At this framework the width of MQ spectra reveals tending to any constant amount with the growing up of the time. Also there were shown that the spectral width decreases with increasing perturbation strength. The growing up of the cluster siz…
Quantum decoherence is the disappearance of simple phase relations within a discrete quantum system as a result of interactions with an environment. For many applications, the question is not necessarily how to avoid (inevitable) system-environment interactions, but rather how to design environments that optimally preserve a system's phase relations in spite of such interactions. The formation of system-environment entanglement is a major driving mechanism for decoherence, and a detailed understanding of this process could inform strategies for conserving coherence optimally. This requires sca…
The robustness of quantum transport under various perturbations is analyzed in disordered interacting many-body systems, which are constructed from the embedded Gaussian random matrix ensembles (EGEs). The transport efficiency can be enhanced drastically, if centrosymmetry (csEGE) is imposed. When the csEGE is perturbed with an ordinary EGE, the transport efficiency in the optimal cases is reduced significantly, while in the suboptimal cases the changes are less pronounced. Qualitatively the same behavior is observed, when parity and centrosymmetry are broken by block perturbations. Analyzing …
Reliable processing of quantum information for developing quantum technologies requires precise control of out-of-equilibrium many-bodysystems. This is a highly challenging task as the fragility of quantum states to external perturbations increases with the system-size. Here, we report on a series of experimental quantum simulations that quantify the sensitivity of a controlled Hamiltonian evolution to perturbations that drive the system away from the targeted evolution. Based on out-of-time ordered correlations, we demonstrate that the decay-rate of the process fidelity increases with the eff…
In the long quest to identify and compensate the sources of decoherence in many-body systems far from the ground state, the varied family of Loschmidt echoes (LEs) became an invaluable tool in several experimental techniques. A LE involves a time-reversal procedure to assess the effect of perturbations in a quantum excitation dynamics. However, when addressing macroscopic systems one is repeatedly confronted with limitations that seem insurmountable. This led to formulate the \textit{central hypothesis of irreversibility} stating that the time-scale of decoherence, $T_3$, is proportional to th…
Transition to the semiclassical behaviour and the decoherence process for inhomogeneous perturbations generated from the vacuum state during an inflationary stage in the early Universe are considered both in the Heisenberg and the Schrödinger representations to show explicitly that both approaches lead to the same prediction: the equivalence of these quantum perturbations to classical perturbations having stochastic Gaussian amplitudes and belonging to the quasi-isotropic mode. This equivalence and the decoherence are achieved once the exponentially small (in terms of the squeezing parameter $…
We study the effects of non-hermitian perturbation on a quantum kicked model exhibiting a localization transition. Using an exact renormalization scheme, we show that the critical line separating the extended and localized phases approaches its semiclassical limit as the imaginary part of the kicking parameter is steadily increased. Further, the metastability of the quantum states appears to be directly correlated with the deviation between the semi-classical and quantum results. This direct evidence of quantum-classical correspondence suggests that non-hermitian perturbations may be used to m…
We study decoherence in an interacting qubit system described by infinite range Heisenberg model (IRHM) in a situation where the system is coupled to a bath of local optical phonons. Using perturbation theory in polaron frame of reference, we derive an effective Hamiltonian that is valid in the regime of strong spin-phonon coupling under non-adiabatic conditions. It is shown that the effective Hamiltonian commutes with the IRHM upto leading orders of perturbation and thus has the same eigenstates as the IRHM. Using a quantum master equation with Markovian approximation of dynamical evolution, …
In general, a quantum algorithm wants to avoid decoherence or perturbation, since such factors may cause errors in the algorithm. In this letter, we will supply the answer to the interesting question: can the factors seemingly harmful to a quantum algorithm(for example, perturbations) enhance the algorithm? We show that some perturbations to the generalized quantum search Hamiltonian can reduce the running time and enhance the success probability. We also provide the narrow bound to the perturbation which can be beneficial to quantum search. In addition, we show that the error induced by a per…
We examine environmental decoherence of cosmological perturbations in order to study the quantum-to-classical transition and the impact of noise on entanglement during inflation. Given an explicit interaction between the system and environment, we derive a quantum master equation for the reduced density matrix of perturbations, drawing parallels with quantum Brownian motion, where we see the emergence of fluctuation and dissipation terms. Although the master equation is not in Lindblad form, we see how typical solutions exhibit positivity on super-horizon scales, leading to a physically meanin…
We study the decoherence of a one-particle system, whose classical correpondent is chaotic, when it evolves coupled to a weak quenched environment. This is done by analytical evaluation of the Loschmidt Echo, (i.e. the revival of a localized density excitation upon reversal of its time evolution), in presence of the perturbation. We predict an exponential decay for the Loschmidt Echo with a (decoherence) rate which is asymptotically given by the mean Lyapunov exponent of the classical system, and therefore independent of the perturbation strength, within a given range of strengths. Our results…
We address the question on how weak perturbations, that are quite ineffective in small many-body systems, can lead to decoherence and hence to irreversibility when they proliferate as the system size increases. This question is at the heart of solid state NMR. There, an initially local polarization spreads all over due to spin-spin interactions that conserve the total spin projection, leading to an equilibration of the polarization. In principle, this quantum dynamics can be reversed by changing the sign of the Hamiltonian. However, the reversal is usually perturbed by non reversible interacti…
There exists the well known approximate expression describing the large time behaviour of matrix elements of the evolution operator in quantum theory: <U(t)>=exp(at)+... This expression plays the crucial role in considerations of problems of quantum decoherence, radiation, decay, scattering theory, stochastic limit, derivation of master and kinetic equations etc. This expression was obtained in the Weisskopf-Wigner approximation and in the van Hove (stochastic) limit. We derive the exact general formula which includes the higher order corrections to the above approximate expression: <U(t)>=exp…
We define a quantity, the so-called purity fidelity, which measures the rate of dynamical irreversibility due to decoherence, observed e.g in echo experiments, in the presence of an arbitrary small perturbation of the total (system + environment) Hamiltonian. We derive a linear response formula for the purity fidelity in terms of integrated time correlation functions of the perturbation. Our relation predicts, similarly to the case of fidelity decay, faster decay of purity fidelity the slower decay of time correlations is. In particular, we find exponential decay in quantum mixing regime and f…
We study the inflationary quantum-to-classical transition for the adiabatic curvature perturbation $ζ$ due to quantum decoherence, focusing on the role played by squeezed-limit mode couplings. We evolve the quantum state $Ψ$ in the Schrödinger picture, for a generic cubic coupling to additional environment degrees of freedom. Focusing on the case of minimal gravitational interactions, we find the evolution of the reduced density matrix for a given long-wavelength fluctuation by tracing out the other (mostly shorterwavelength) modes of $ζ$ as an environment. We show that inflation produces phas…
The Loschmidt echo (LE) is a measure of the sensitivity of quantum mechanics to perturbations in the evolution operator. It is defined as the overlap of two wave functions evolved from the same initial state but with slightly different Hamiltonians. Thus, it also serves as a quantification of irreversibility in quantum mechanics. In this thesis the LE is studied in systems that have a classical counterpart with dynamical instability, that is, classically chaotic. An analytical treatment that makes use of the semiclassical approximation is presented. It is shown that, under certain regime of th…
Grover's database search algorithm, although discovered in the context of quantum computation, can be implemented using any 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.
