SearcharxivSearch

arXiv subjects

G. Abal

Publications and source records attributed to G. Abal.

17 recordsLinked to original sources

Spatial quantum search in a triangular network

The spatial search problem consists in minimizing the number of steps required to find a given site in a network, under the restriction that only oracle queries or translations to neighboring sites are allowed. We propose a quantum algorithm for the spatial search problem on a triangular lattice with N sites and torus-like boundary conditions. The proposed algortithm is a special case of the general framework for abstract search proposed by Ambainis, Kempe and Rivosh [AKR05] (AKR) and Tulsi [Tulsi08], applied to a triangular network. The AKR-Tulsi formalism was employed to show that the time complexity of the quantum search on the triangular lattice is O(sqrt(N logN)).

quant-ph

Mixing Times in Quantum Walks on Two-Dimensional Grids

Mixing properties of discrete-time quantum walks on two-dimensional grids with torus-like boundary conditions are analyzed, focusing on their connection to the complexity of the corresponding abstract search algorithm. In particular, an exact expression for the stationary distribution of the coherent walk over odd-sided lattices is obtained after solving the eigenproblem for the evolution operator for this particular graph. The limiting distribution and mixing time of a quantum walk with a coin operator modified as in the abstract search algorithm are obtained numerically. On the basis of these results, the relation between the mixing time of the modified walk and the running time of the corresponding abstract search algorithm is discussed.

quant-ph

Spatial search in a honeycomb network

The spatial search problem consists in minimizing the number of steps required to find a given site in a network, under the restriction that only oracle queries or translations to neighboring sites are allowed. In this paper, a quantum algorithm for the spatial search problem on a honeycomb lattice with $N$ sites and torus-like boundary conditions. The search algorithm is based on a modified quantum walk on a hexagonal lattice and the general framework proposed by Ambainis, Kempe and Rivosh is used to show that the time complexity of this quantum search algorithm is $O(\sqrt{N \log N})$.

quant-ph

Decoherence in Search Algorithms

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.

quant-ph

Quantum walk on the line: entanglement and non-local initial conditions

The conditional shift in the evolution operator of a quantum walk generates entanglement between the coin and position degrees of freedom. This entanglement can be quantified by the von Neumann entropy of the reduced density operator (entropy of entanglement). In the long time limit, it converges to a well defined value which depends on the initial state. Exact expressions for the asymptotic (long-time) entanglement are obtained for (i) localized initial conditions and (ii) initial conditions in the position subspace spanned by the +1 and -1 position eigenstates.

quant-ph

Mixing Times in Quantum Walks on the Hypercube

The mixing time of a discrete-time quantum walk on the hypercube is considered. The mean probability distribution of a Markov chain on a hypercube is known to mix to a uniform distribution in time O(n log n). We show that the mean probability distribution of a discrete-time quantum walk on a hypercube mixes to a (generally non-uniform) distribution pi(x) in time O(n) and the stationary distribution is determined by the initial state of the walk. An explicit expression for pi(x) is derived for the particular case of a symmetric walk. These results are consistent with those obtained previously for a continuous-time quantum walk. The effect of decoherence due to randomly breaking links between connected sites in the hypercube is also considered. We find that the probability distribution mixes to the uniform distribution as expected. However, the mixing time has a minimum at a critical decoherence rate $p \approx 0.1$. A similar effect was previously reported for the QW on the N-cycle with decoherence from repeated measurements of position. A controlled amount of decoherence helps to obtain--and preserve--a uniform distribution over the $2^n$ sites of the hypercube in the shortest possible time.

quant-ph

Asymptotic entanglement in the discrete-time quantum walk

The coin-position entanglement generated by the evolution operator of a discrete--time quantum walk converges, in the long time limit, to a well defined value which depends on the initial state. We also discuss the asymptotic bi-partite entanglement generated by several non-separable coin operations for two coherent quantum walkers, for which the entropy of entanglement increases logarithmically.

quant-ph

Decoherent quantum walks driven by a generic coin operation

We consider the effect of different unitary noise mechanisms on the evolution of a quantum walk (QW) on a linear chain with a generic coin operation: (i) bit-flip channel noise, restricted to the coin subspace of the QW, and (ii) topological noise caused by randomly broken links in the linear chain. Similarities and differences in the respective decoherent dynamics of the walker as a function of the probability per unit time of a decoherent event taking place are discussed.

quant-ph

Conditional Quantum Walk and Iterated Quantum Games

Iterated bipartite quantum games are implemented in terms of the discrete-time quantum walk on the line. Our proposal allows for conditional strategies, as two rational agents make a choice from a restricted set of two-qubit unitary operations. Several frequently used classical strategies give rise to families of corresponding quantum strategies. A quantum version of the Prisoner's Dilemma in which both players use mixed strategies is presented as a specific example. Since there are now quantum walk physical implementations at a proof-of principle stage, this connection may represent a step towards the experimental realization of quantum games.

quant-ph

Effects of non-local initial conditions in the Quantum Walk on the line

We report an enhancement of the decay rate of the survival probability when non-local initial conditions in position space are considered in the Quantum Walk on the line. It is shown how this interference effect can be understood analytically by using previously derived results. Within a restricted position subspace, the enhanced decay is correlated with a maximum asymptotic entanglement level while the normal decay rate corresponds to initial relative phases associated to a minimum entanglement level.

quant-ph

Generalized Quantum Walk in Momentum Space

We consider a new model of quantum walk on a one-dimensional momentum space that includes both discrete jumps and continuous drift. Its time evolution has two stages; a Markov diffusion followed by localized dynamics. As in the well known quantum kicked rotor, this model can be mapped into a localized one-dimensional Anderson model. For exceptional (rational) values of its scale parameter, the system exhibits resonant behavior and reduce to the usual discrete time quantum walk on the line.

quant-ph

Decoherence in the quantum walk on the line

We investigate the quantum walk on the line when decoherences are introduced either through simultaneous measurements of the chirality and particle position, or as a result of broken links. Both mechanisms drive the system to a classical diffusive behavior. In the case of measurements, we show that the diffusion coefficient is proportional to the variance of the initially localized quantum random walker just before the first measurement. When links between neighboring sites are randomly broken with probability $p$ per unit time, the evolution becomes decoherent after a characteristic time that scales as $1/p$. The fact that the quadratic increase of the variance is eventually lost even for very small frequencies of disrupting events, suggests that the implementation of a quantum walk on a real physical system may be severely limited by thermal noise and lattice imperfections.

quant-ph

Quantum random walk on the line as a markovian process

We analyze in detail the discrete--time quantum walk on the line by separating the quantum evolution equation into Markovian and interference terms. As a result of this separation, it is possible to show analytically that the quadratic increase in the variance of the quantum walker's position with time is a direct consequence of the coherence of the quantum evolution. If the evolution is decoherent, as in the classical case, the variance is shown to increase linearly with time, as expected. Furthermore we show that this system has an evolution operator analogous to that of a resonant quantum kicked rotor. As this rotator may be described through a quantum computational algorithm, one may employ this algorithm to describe the time evolution of the quantum walker.

quant-ph

Intrinsic Decoherence and Irreversibility in the Quasiperiodic Kicked Rotor

We show that some classically chaotic quantum systems uncoupled from noisy environments may generate intrinsic decoherence with all its associated effects. In particular, we have observed time irreversibility and high sensitivity to small perturbations in the initial conditions in a quasiperiodic version of the kicked rotor. The existence of simple quantum systems with intrinsic decoherence clarifies the quantum--classical correspondence in chaotic systems.

quant-ph

Markovian Behaviour and Constrained Maximization of the Entropy in Chaotic Quantum Systems

The separation of the Schrödinger equation into a Markovian and an interference term provides a new insight in the quantum dynamics of classically chaotic systems. The competition between these two terms determines the localized or diffusive character of the dynamics. In the case of the Kicked Rotor, we show how the constrained maximization of the entropy implies exponential localization.

quant-ph

Dynamical Localization in Quasi-Periodic Driven Systems

We investigate how the time dependence of the Hamiltonian determines the occurrence of Dynamical Localization (DL) in driven quantum systems with two incommensurate frequencies. If both frequencies are associated to impulsive terms, DL is permanently destroyed. In this case, we show that the evolution is similar to a decoherent case. On the other hand, if both frequencies are associated to smooth driving functions, DL persists although on a time scale longer than in the periodic case. When the driving function consists of a series of pulses of duration $σ$, we show that the localization time increases as $σ^{-2}$ as the impulsive limit, $σ\to 0$, is approached. In the intermediate case, in which only one of the frequencies is associated to an impulsive term in the Hamiltonian, a transition from a localized to a delocalized dynamics takes place at a certain critical value of the strength parameter. We provide an estimate for this critical value, based on analytical considerations. We show how, in all cases, the frequency spectrum of the dynamical response can be used to understand the global features of the motion. All results are numerically checked.

nlin.CD

The Quantum Adiabatic Approximation in Chaotic Systems

Quantum systems with chaotic classical counterparts cannot be treated by perturbative techniques or any kind of adiabatic approximations. This is so, in spite of the quantum suppression of classical chaos. We explicitly calculate the adiabaticity parameter for the case of a Fermi Accelerator and show that the adiabatic expansion of the evolution operator is divergent. The relevance of this situation for the understanding of quantal effects in the one body dissipation mechanism in nuclear reactions is briefly discussed.

chao-dyn