Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields Jean-Fran¸cois Biasse∗ Abstract This paper gives polynomial time quantum algorithms for

First Page		Document Content
Date: 2018-07-17 14:44:28		Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields Jean-Fran¸cois Biasse∗ Abstract This paper gives polynomial time quantum algorithms for Add to Reading List Source URL: fangsong.info Download Document from Source Website File Size: 447,15 KB Share Document on Facebook