2004/05/17 by Wim van Dam, van Dam, Wim · 1 voice · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Coding theory and cryptography #Computability, Logic, AI Algorithms #Quantum Computing Algorithms and Architecture #math.AG #quant-ph
paper · pdf · doi:10.48550/arxiv.quant-ph/0405081
18 pages, AMS-LaTeX
arxiv created 2004/05/17 · openalex publication_date 2004/05/17 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A possible connection between quantum computing and Zeta functions of finite field equations is described. Inspired by the 'spectral approach' to the Riemann conjecture, the assumption is that the zeroes of such Zeta functions correspond to the eigenvalues of finite dimensional unitary operators of natural quantum mechanical systems. The notion of universal, efficient quantum computation is used to model the desired quantum systems. Using eigenvalue estimation, such quantum circuits would be able to approximately count the number of solutions of finite field equations with an accuracy that does not appear to be feasible with a classical computer. For certain equations (Fermat hypersurfaces) it is show that one can indeed model their Zeta functions with efficient quantum algorithms, which gives some evidence in favor of the proposal of this article.