Efficient computations in central simple algebras using Amitsur cohomology

arXiv2307.00261MaRDI QIDQ6442213FDOQ6442213

Publication date: 1 July 2023

Abstract: We present an efficient computational representation of central simple algebras using Brauer factor sets. Using this representation and polynomial quantum algorithms for number theoretical tasks such as factoring and

S

-unit group computation, we give a polynomial quantum algorithm for the explicit isomorphism problem over number field, which relies on a heuristic concerning the irreducibility of the characteristic polynomial of a random matrix with algebraic integer coefficients. We present another version of the algorithm which does not need any heuristic but which is only polynomial if the degree of the input algebra is bounded.

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Algebraic number theory computations (11Y40) Separable algebras (e.g., quaternion algebras, Azumaya algebras, etc.) (16H05)

This page was built for publication: Efficient computations in central simple algebras using Amitsur cohomology

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6442213)