Universality of the fully connected vertex in Laplacian continuous-time quantum walk problems

Abstract

A fully connected vertex $w$ in a simple graph $G$ of order $N$ is a vertex connected to all the other $N-1$ vertices. Upon denoting by $L$ the Laplacian matrix of the graph, we prove that the continuous-time quantum walk (CTQW) -- with Hamiltonian $H=\gamma L$ -- of a walker initially localized at $|w⟩$ does not depend on the graph $G$. We also prove that for any Grover-like CTQW -- with Hamiltonian $H=\gamma L+{\sum }_w{\lambda }_w|w⟩⟨w|$ -- the probability amplitude at the fully connected marked vertices $w$ does not depend on $G$. The result does not hold for CTQW with Hamiltonian $H=\gamma A$ (adjacency matrix). We apply our results to spatial search and quantum transport for single and multiple fully connected marked vertices, proving that CTQWs on any graph $G$ inherit the properties already known for the complete graph of the same order, including the optimality of the spatial search. Our results provide a unified framework for several partial results already reported in literature for fully connected vertices, such as the equivalence of CTQW and of spatial search for the central vertex of the star and wheel graph, and any vertex of the complete graph.

arXiv comment22 pages, 2 figures, accepted version

References in corpus (28)

• The Quantum Jump Approach to Dissipative Dynamics in Quantum Optics
• Quantum Computation and Decision Trees
• Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
• Perfect state transfer in quantum spin networks
• Universal computation by quantum walk
• Environment-Assisted Quantum Transport
• Spatial search by quantum walk
• Highly efficient energy excitation transfer in light-harvesting complexes: The fundamental role of noise-assisted transport
• Quantum Search by Local Adiabatic Evolution
• Continuous-Time Quantum Walks: Models for Coherent Transport on Complex Networks
• Efficiency of energy transfer in a light-harvesting system under quantum coherence
• Systematic Dimensionality Reduction for Quantum Walks: Optimal Spatial Search and Transport on Non-Regular Graphs
• Laplacian versus Adjacency Matrix in Quantum Walk Search
• Exact analytical results for quantum walks on star graph
• Quantum Logic with Interacting Bosons in 1D
• On the optimality of spatial search by continuous-time quantum walk
• Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm
• Spatial Search by Continuous-Time Quantum Walk with Multiple Marked Vertices
• Generalized quantum-classical correspondence for random walks on graphs
• Quantum spatial search on graphs subject to dynamical noise
• Continuous-time quantum walks on dynamical percolation graphs
• Quantum-classical dynamical distance and quantumness of quantum walks
• Quantum-classical distance as a tool to design optimal chiral quantum walk
• Transport efficiency of continuous-time quantum walks on graphs
• Continuous-time quantum walks in the presence of a quadratic perturbation
• Role of symmetry in quantum search via continuous-time quantum walk
• Hybrid quantum network design against unauthorized secret-key generation, and its memory cost
• Equivalent Laplacian and Adjacency Quantum Walks on Irregular Graphs