Continuous-time quantum walks in the presence of a quadratic perturbation

Abstract

We address the properties of continuous-time quantum walks with Hamiltonians of the form $\mathcal{H}=L+\lambda L^2$, being $L$ the Laplacian matrix of the underlying graph and being the perturbation $\lambda L^2$ motivated by its potential use to introduce next-nearest-neighbor hopping. We consider cycle, complete, and star graphs because paradigmatic models with low/high connectivity and/or symmetry. First, we investigate the dynamics of an initially localized walker. Then, we devote attention to estimating the perturbation parameter $\lambda$ using only a snapshot of the walker dynamics. Our analysis shows that a walker on a cycle graph is spreading ballistically independently of the perturbation, whereas on complete and star graphs one observes perturbation-dependent revivals and strong localization phenomena. Concerning the estimation of the perturbation, we determine the walker preparations and the simple graphs that maximize the Quantum Fisher Information. We also assess the performance of position measurement, which turns out to be optimal, or nearly optimal, in several situations of interest. Besides fundamental interest, our study may find applications in designing enhanced algorithms on graphs.

arXiv comment21 pages, 16 figures. Version accepted for publication

References in corpus (36)

• Quantifying Coherence
• Quantum Computation and Decision Trees
• Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
• Universal computation by quantum walk
• Quantum walks of correlated particles
• Spatial search by quantum walk
• An example of the difference between quantum and classical random walks
• Strongly Correlated Quantum Walks in Optical Lattices
• Continuous-Time Quantum Walks: Models for Coherent Transport on Complex Networks
• Limits of quantum speedup in photosynthetic light harvesting
• Two-particle quantum walks applied to the graph isomorphism problem
• Quantum walks on general graphs
• A random walk approach to quantum algorithms
• Laplacian versus Adjacency Matrix in Quantum Walk Search
• Universally Optimal Noisy Quantum Walks on Complex Networks
• Exact analytical results for quantum walks on star graph
• On the discontinuity of the quantum Fisher information for quantum statistical models with parameter dependent rank
• Quantumness of noisy quantum walks: a comparison between measurement-induced disturbance and quantum discord
• Quantum metrology beyond the Quantum Cramér-Rao theorem
• Delocalization and Heisenberg's uncertainty relation
• Continuous-time quantum walks on star graphs
• A quantum-walk-inspired adiabatic algorithm for graph isomorphism
• Continuous-Time Quantum Search on Balanced Trees
• Quantum Search with Multiple Walk Steps per Oracle Query
• Continuous-time quantum walk on spatially correlated noisy lattices
• Quantum spatial search on graphs subject to dynamical noise
• Noisy quantum walks of two indistinguishable interacting particles
• Quantum state transfer via Bloch oscillations
• Continuous-Time Quantum Walks on Dynamic Graphs
• Machine learning transfer efficiencies for noisy quantum walks
• Probabilistic low-rank factorization accelerates tensor network simulations of critical quantum many-body ground states
• Quantum search with a continuous-time quantum walk in momentum space
• Irreconcilable Difference Between Quantum Walks and Adiabatic Quantum Computing
• Estimation of general Hamiltonian parameters via controlled energy measurements
• Non-Markovianity is not a resource for quantum spatial search on a star graph subject to generalized percolation
• Overcomplete quantum tomography of a path-entangled two-photon state

Cited by in corpus (6)

• Floquet engineering of continuous-time quantum walks: towards the simulation of complex and next-to-nearest neighbor couplings
• Steepest Entropy Ascent Solution for a Continuous-Time Quantum Walker
• Clustering-induced localization of quantum walks on networks
• Decoherence and classicalization of continuous-time quantum walks on graphs
• Dissipation in fermionic two-body continuous-time quantum walk under the steepest entropy ascent formalism
• Universality of the fully connected vertex in Laplacian continuous-time quantum walk problems