Alexandros Ghionis | Searcharxiv

arXiv2022

Quasi-bialgebras from set-theoretic type solutions of the Yang-Baxter equation

We examine classes of quantum algebras emerging from involutive, non-degenerate set-theoretic solutions of the Yang-Baxter equation and their q-analogues. After providing some universal results on quasi-bialgebras and admissible Drinfeld twists we show that the quantum algebras produced from set-theoretic solutions and their q-analogues are in fact quasi-triangular quasi-bialgebras. Specific illustrative examples compatible with our generic findings are worked out. In the q-deformed case of set-theoretic solutions we also construct admissible Drinfeld twists similar to the set-theoretic ones, subject to certain extra constraints dictated by the q-deformation. These findings greatly generalise recent relevant results on set theoretic solutions and their q-deformed analogues.

math.QA↗

arXiv2020

Not-so-adiabatic quantum computation for the shortest vector problem

Since quantum computers are known to break the vast majority of currently-used cryptographic protocols, a variety of new protocols are being developed that are conjectured, but not proven to be safe against quantum attacks. Among the most promising is lattice-based cryptography, where security relies upon problems like the shortest vector problem. We analyse the potential of adiabatic quantum computation for attacks on lattice-based cryptography, and give numerical evidence that even outside the adiabatic regime such methods can facilitate the solution of the shortest vector and similar problems.

quant-ph↗