Polynomial time quantum algorithm for the computation of the unit group of a number field
From MaRDI portal
Publication:3581442
DOI10.1145/1060590.1060661zbMath1192.81099OpenAlexW2066284946WikidataQ56059912 ScholiaQ56059912MaRDI QIDQ3581442
Arthur Schmidt, Ulrich Vollmer
Publication date: 16 August 2010
Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1060590.1060661
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Sample complexity of hidden subgroup problem ⋮ Quantum algorithm based on the \(\varepsilon\)-random linear disequations for the continuous hidden shift problem ⋮ The number behind the simplest SIC-POVM ⋮ The special case of cyclotomic fields in quantum algorithms for unit groups ⋮ On the probability of generating a lattice ⋮ Controlled SWAP attack and improved quantum encryption of arbitrated quantum signature schemes ⋮ Deterministic algorithms for the hidden subgroup problem ⋮ On the quantum complexity of the continuous hidden subgroup problem
This page was built for publication: Polynomial time quantum algorithm for the computation of the unit group of a number field
