3 papers
quant-ph2026
Exhaustive and feasible parametrisation with applications to the travelling salesperson problem
Marvin Schwiering, Timo Ziegler, Lennart Binkowski +1
This paper introduces the concept of exhaustively parametrised, feasibility-respecting quantum circuits for constrained combinatorial optimisation problems. Such circuits can reach…
quant-ph2025
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…
quant-ph2024
A 3D lattice defect and efficient computations in topological MBQC
Gabrielle Tournaire, Marvin Schwiering, Robert Raussendorf +1
We describe an efficient, fully fault-tolerant implementation of Measurement-Based Quantum Computation (MBQC) in the 3D cluster state. The two key novelties are (i) the introductio…