Python Turtle is a easy using and interesting packages, with codes on ipykernel:
!pip install PythonTurtle
And you only execute below codes, and can get the result.
from turtle import *
for steps in range(100):
for c in ('blue', 'red', 'green'):
color(c)
poorbees changed 2 years agoView mode Like Bookmark
證券價格、布朗運動
application: 標準普爾指數、飛鏢試驗、擲硬幣比賽
馬爾可夫鏈(Markov chain)、馬可夫過程(Markov process)、醉漢走路(drunkard's walk)
triangular finding problem
.Quantum walks
Quantum walks are the quantum equivalent of the classical Markov chain. Due to superposition, a quantum walk will take all possible paths simultaneously until we measure the circuit. Due to quantum interference, some state will cancel out. This makes quantum walk algorithms faster than classical ones, since we can design them in such way that wrong answers quickly cancel out. There are two common models for quantum walks, coined quantum walks and Szegedy quantum walks, which are equivalent under certain circumstances. A coined quantum walk is a walk on the vertices of the graph while Szegedy quantum walk takes place on the edges. Before we show how we can implement a quantum walk, we will introduce both models.
poorbees changed 2 years agoView mode Like Bookmark