DocTestSetup = quote
using QuantumWalk, LightGraphs
end
Implementation of the continuous-time quantum walk. The model is defined for an arbitrary undirected graph. Hamiltonian is chosen to be adjacency, normalized Laplacian or Laplacian matrix. After the evolution, the state is measured in the canonical basis. The evolution is defined on a system of size equal to graph order. The precise definition can be found in Spatial search by quantum walk by Childs and Goldstone, where both pure walk and search dynamics are described.
The abstract supertype is AbstractCTQW
with its default realization CTQW
, utilizing sparse matrices. Alternative realization is CTQWDense
, which works on standard matrices. The model includes the following types and methods:
Order = [:type, :function]
Modules = [QuantumWalk]
Pages = ["ctqw.md"]
AbstractCTQW
CTQW
CTQWDense
QWEvolution(::Type{U}, ::AbstractCTQW) where U<:Number
QWSearch(::Type{T}, ::AbstractCTQW, ::Vector{Int}, ::Real = 0., ::T) where T<:Number
check_qwdynamics(::Type{QWSearch}, ::AbstractCTQW, ::Dict{Symbol}, ::Vector{Int})
check_qwdynamics(::Type{QWEvolution}, ::AbstractCTQW, ::Dict{Symbol})
matrix(::AbstractCTQW)