QSWalk.jl: simulating the evolution of open quantum systems on graphs

The Swiss Army Knife of Applied Quantum Technology (Experimental Tech)

QI package for Mathematica

QuantumWalk.jl: Package for building algorithms based on quantum walks

Quantum Walk Graph Classifier

In this thesis we study the properties of quantum walks with time dependent Hamiltonians, focusing in particular on the application to the quantum search problem on graphs. We study the search, localization and give a measure of robustness.

Source code of Hiperwalk project

Rule based optimizer of quantum walk

Continuous-time quantum walk Python package and GUI

Implementation and analysis of different DTQW schemes in Qiskit.

Simulation frameworks for classical, quantum, and hybrid classical-quantum walks on arbitrary networks.

Mathematica package to handle quantum walks.

Circuital implementation of a Quantum Random Walk on a Johnson graph using qiskit

Code and data used for the paper: Quantum state engineering using one-dimensional discrete-time quantum walks.

The relationship of the spectral dimension and spatial search on a fractal lattice using quantum walk

Simulates a quantum walk on a 2D lattice in Fortran

Provides methods concerning checking and existance of exceptional configuration for quantum walks.

In this paper, I’ll provide an overall introduction of of quantum walks and its application to two search problems 1. The Historic Quantum random-walk search algorithm 2. A recent generalization for Spatial Search