It is proved that a continuous-time quantum walk effected by a generalized Laplacian, which can arise in spin chains, can solve a computational problem more quickly than typical quantum walks governed by the standard Laplacian or adjacency matrix.
Abstract
Quantum walks are the quantum analogues of classical random walks or Markov chains. They are universal models of quantum computing, and they underpin a variety of quantum algorithms. We prove that a continuous-time quantum walk effected by a generalized Laplacian, which can arise in spin chains, can solve a computational problem more quickly than typical quantum walks governed by the standard Laplacian or adjacency matrix. This generalized Laplacian consists of the standard Laplacian plus a real-valued multiple of the degree matrix, and we prove that as the magnitude of the multiple of the degree matrix is increased, its corresponding quantum walk can search the complete bipartite graph with multiple marked vertices in time that approaches the optimal. This raises the potential for the generalized Laplacian quantum walk to be a useful method for developing additional faster quantum algorithms.
We study the geometric spread of discrete-time quantum walks using Connes'distance formula. We introduce its discrete analogue by adapting the continuous spectral metric to the lattice, with the Dirac operator replaced by the unitary step operator. Focusing first on a (2+1)-dimensional quantum walk, we evaluate the dyn...
R. Trabelsi, A. Reyes-Lega, P. Arrighi· 0 citations
This lecture starts the next paradigm for quantum algorithms: quantum walks, which mimic random walks in a way that allows speeding up the algorithmic applications, including sampling from complicated distributions and searching with spatial constraints.
How rapidly does order give way to randomness, and can quantum coherence accelerate this process? We address these questions through the paradigmatic problem of card shuffling, formulated as a random walk on the symmetric group $S_n$. We first recast the random-transposition walk studied by Diaconis and Shahshahani, as...
Feng He, Arthur Hutsalyuk, G. Mussardo et al.· 0 citations
We study disorder-free localization in a spin-coupled quantum walk on the hypercube within the quantum Bernoulli noises framework. We derive a general criterion for disorder-free localization: it occurs if and only if some spectral subspace of a reduced unitary evolution contains a vector whose position marginal probab...
One-dimensional quantum--classical hybrid walks are introduced by combining quantum and classical steps under periodic and random protocols. Exact diffusion coefficients are derived for both protocols throughout the diffusive regime. The exact results show how diffusion depends on the average frequency and temporal arr...
In this work, we present a quantum algorithm for simulating non-Markovian quantum dynamics based on the Feynman–Vernon influence functional formalism, which provides an exact description of the dynamics of a quantum system linearly coupled to a harmonic bath. In condensed-phase environments, the bath correlation functi...
Avin Seneviratne, Peter L. Walters, Fei Wang· Journal of Physical Chemistr...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.