Fast quantum algorithms for computing the unit group and class group of a number field
暂无分享,去创建一个
[1] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..
[2] Michael E. Pohst,et al. Computing a lattice basis from a system of generating vectors , 1987, EUROCAL.
[3] H. Lenstra,et al. Algorithms in algebraic number theory , 1992, math/9204234.
[4] Ulrich Vollmer,et al. Polynomial time quantum algorithm for the computation of the unit group of a number field , 2005, STOC '05.
[5] Shafi Goldwasser,et al. Complexity of lattice problems , 2002 .
[6] Shafi Goldwasser,et al. Complexity of lattice problems - a cryptographic perspective , 2002, The Kluwer international series in engineering and computer science.
[7] Daniel R. Simon,et al. On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[8] Christoph Thiel. On the complexity of some problems in algorithmic algebraic number theory , 1995 .
[9] Henri Cohen,et al. A course in computational algebraic number theory , 1993, Graduate texts in mathematics.
[10] Christoph Thiel,et al. Under the assumption of the generalized Riemann Hyothesis verifying the class number belongs to NPcapCo-NP , 1994, ANTS.
[11] Sean Hallgren,et al. Quantum Fourier sampling simplified , 1999, STOC '99.