✦ LIBER ✦

Framework for discrete-time quantum walks and a symmetric walk on a binary tree

✍ Scribed by Dimcovic, Zlatko; Rockwell, Daniel; Milligan, Ian; Burton, Robert; Nguyen, Thinh; Kovchegov, Yevgeniy

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Time averaged distribution of a discrete

✍ Yusuke Ide, Norio Konno, Etsuo Segawa 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 171 KB

A Spanning Tree Method for Bounding Hitt

✍ Cogill, Randy; Peng, Cheng 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 270 KB

Fundamental solution and discrete random

✍ S. Shen; F. Liu; V. Anh 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 387 KB

Saddle-point approximations and space-ti

✍ Steven P. Lalley 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 830 KB

Arrival Time and Jump Size for a Random

✍ Bratiichuk, N. S. 📂 Article 📅 1991 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 1008 KB

Polynomial-Time Algorithms for Prime Fac

✍ Shor, Peter W. 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 430 KB