Solving Shift Problems and Hidden Coset Problem Using the Fourier Transform

Simple item page
dc.creatorIp, Lawrence
dc.date2002-05-07
dc.date.accessioned2026-07-07T06:04:07Z
dc.date.available2026-07-07T06:04:07Z
dc.descriptionWe give a quantum algorithm for solving a shifted multiplicative character problem over Z/nZ and finite fields. We show that the algorithm can be interpreted as a matrix factorization or as solving a deconvolution problem and give sufficient conditions for a shift problem to be solved efficiently by our algorithm. We also show that combining the shift problem with the hidden subgroup problem results in a hidden coset problem. This naturally captures the redundancy in the shift due to the periodic structure of multiplicative characters over Z/nZ.
dc.description15 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0205034
dc.identifierhttp://arxiv.org/abs/quant-ph/0205034
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/90189
dc.subjectQuantum Physics
dc.titleSolving Shift Problems and Hidden Coset Problem Using the Fourier Transform
dc.typetext

Files

Collections

arXiv