Abstract
AbstractThis is a survey of recent results on quantum algorithms for the computation of invariants of number fields, namely the class number and the regulator. Most known classical algorithms for the computation of these values are of subexponential complexity and depend on the truth of a still unproven hypothesis of analytic number theory. We use an important number theoretic concept, Minkowski's Geometry of Numbers, to visualize these invariants, and describe the quantum algorithms developed by Hallgren, Schmidt and Vollmer which compute these invariants using a polynomial number of steps. Computational techniques in number fields, which are necessary to justify the classical part of these quantum algorithms, are the focus of the research of our project group, and are explained in detail.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
