26 citations · 53 across the 14 of their papers we have counts for
3 papers · 1 filter
Classification of coined quantum walks on the line and comparison to correlated classical random walks
Lukas Hantzko, Lennart Binkowski
We present a comprehensive classification of one-dimensional coined quantum walks on the infinite line, focusing on the spatial probability distributions they induce. Building on p…
Quantum Fisher-Yates shuffle: Unifying methods for generating uniform superpositions of permutations
Lennart Binkowski, Marvin Schwiering
Uniform superpositions over permutations play a central role in quantum error correction, cryptography, and combinatorial optimisation. We introduce a simple yet powerful quantisat…
A quantum search method for quadratic and multidimensional knapsack problems
Sören Wilkening, Andreea-Iulia Lefterovici, Lennart Binkowski +5
Solving combinatorial optimization problems is a promising application area for quantum algorithms in real-world scenarios. In this work, we extend the "Quantum Tree Generator" (QT…