Hiperwalk
Simulations of quantum walks on graphs using HPC
Hiperwalk project page released!
2023-05-31

Quantum Walks
Hiperwalk simulates both continuous-time and discrete-time quantum walks, effectively modeling quantum systems on large graphs.

Heterogeneous HPC
Hiperwalk facilitates quantum walk simulations, leveraging the power of heterogeneous HPC using CPUs, GPUs, and acceleration cards.

Open source
Distributed under LGPL3, Hiperwalk is developed and maintained publicly on GitHub.

Try Hiperwalk

Use the interactive shell to try Hiperwalk in the browser

import hiperwalk as hpw
import numpy as np

N = 128
# adjacency matrix of complete graph with self loops
A = np.ones((N, N))
graph = hpw.Graph(A)
qw = hpw.Coined(graph,
                shift='flipflop',
                coin='G',
                marked={'-G': [0]})
t_final = (round(4*np.pi*np.sqrt(N)/4),1)
states = qw.simulate(time=t_final,
                     state=qw.uniform_state())
marked_prob = qw.success_probability(states)
hpw.plot_success_probability(t_final,
                             marked_prob,
                             figsize=(9,3))