Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm

DOI10.1140/epjb/e2007-00281-5zbMath1189.81122arXivquant-ph/0606241OpenAlexW2015020136WikidataQ62039062 ScholiaQ62039062MaRDI QIDQ978756

J. Martínez

Publication date: 25 June 2010

Published in: The European Physical Journal B. Condensed Matter and Complex Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0606241

Mathematics Subject Classification ID

Quantum stochastic calculus (81S25) Foundations, quantum information and its processing, quantum axioms, and philosophy (81P99) Dynamics of random walks, random surfaces, lattice animals, etc. in time-dependent statistical mechanics (82C41)

Related Items (18)

Universality of the fully connected vertex in Laplacian continuous-time quantum walk problems ⋮ Quantum Walks ⋮ Overview: recent development and applications of reduction and lackadaisicalness techniques for spatial search quantum walk in the near term ⋮ Quantum search in structured database using local adiabatic evolution and spectral methods ⋮ Bose-Mesner algebra on finite \(G/H\) coset graphs and its application on continuous time quantum walks ⋮ STUDY OF CONTINUOUS-TIME QUANTUM WALKS ON QUOTIENT GRAPHS VIA QUANTUM PROBABILITY THEORY ⋮ SYMMETRY AND QUANTUM TRANSPORT ON NETWORKS ⋮ Perfect state transfer of a qudit over underlying networks of group association schemes ⋮ Generating a GHZ state in 2m-qubit spin network ⋮ Quantum walks: a comprehensive review ⋮ Continuous-time quantum walks on semi-regular spidernet graphs via quantum probability theory ⋮ Evaluation of effective resistances in pseudo-distance-regular resistor networks ⋮ THE EFFECT OF DECOHERENCE ON MIXING TIME IN CONTINUOUS-TIME QUANTUM WALKS ON ONE-DIMENSIONAL REGULAR NETWORKS ⋮ Quantum central limit theorem for continuous-time quantum walks on odd graphs in quantum probability theory ⋮ CONTINUOUS TIME QUANTUM WALKS AND QUOTIENT GRAPHS ⋮ Continuous-time quantum walks on star graphs ⋮ Recursive calculation of effective resistances in distance-regular networks based on Bose–Mesner algebra and Christoffel–Darboux identity ⋮ Calculating effective resistances on underlying networks of association schemes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The subconstituent algebra of an association scheme. I
• Investigation of continuous-time quantum walk via spectral distribution associated with adjacency matrix
• Limit laws for random matrices and free products
• Introduction to spectral theory. With applications to Schrödinger operators
• An example of the difference between quantum and classical random walks
• Theory of resistor networks: the two-point resistance
• Investigation of continuous-time quantum walk via modules of Bose–Mesner and Terwilliger algebras
• METHOD FOR IMPLEMENTATION OF UNIVERSAL QUANTUM LOGIC GATES IN A SCALABLE ISING SPIN QUANTUM COMPUTER
• One-dimensional quantum walks
• Quantum walks on graphs
• HANS BETHE'S CONTRIBUTIONS TO SOLID-STATE PHYSICS
• On the Homotopy Groups of the Wedge of Spheres
• Markoff process and the Dirichlet problem
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

This page was built for publication: Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm