scientific article; zbMATH DE number 2222672

From MaRDI portal
Publication:5701490





The central part of \textit{P. Shor's} factoring algorithm [SIAM J. Comput. 26, No. 5, 1484--1509 (1997; Zbl 1005.11065)] is the determination of the period of a function \(\Phi: {\mathbb Z} \to {\mathbb Z}\;\roman{mod}\;N\). This is generalized in the present paper to functions \(\Phi: {\mathbb R} \to {\mathbb R}\). The basic idea is to follow Shor's original work as close as possible, but to describe quantum registers by rigged Hilbert spaces \({\mathcal S} \subset {\mathcal H} \subset {\mathcal S}'\), such that each \(x \in {\mathbb R}\) is represented by a linear functional \(| x\rangle \in {\mathcal S}'\). Unfortunately the functional-analytical details of this approach are not worked out properly. It is also unclear how (and whether) the proposed algorithm can be implemented physically. For the entire collection see [Zbl 1073.94002].











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5701490)