Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Preprint . 2025
License: CC BY
Data sources: ZENODO
ZENODO
Preprint . 2026
License: CC BY
Data sources: Datacite
ZENODO
Preprint . 2025
License: CC BY
Data sources: Datacite
ZENODO
Preprint . 2026
License: CC BY
Data sources: Datacite
versions View all 3 versions
addClaim

Scalable Framework for Riemann Hypothesis Falsification: Quantum Algorithmic Complexity and Conformal Invariance Constraints

Authors: zhou, changzheng; zhou, ziqing;

Scalable Framework for Riemann Hypothesis Falsification: Quantum Algorithmic Complexity and Conformal Invariance Constraints

Abstract

 This paper proposes a scalable quantum-classical hybrid computational framework for falsifying the Riemann hypothesis within finite ranges of nontrivial zeros. Core innovations include: (1) A hierarchical phase estimation algorithm achieving polynomial-time complexity verification for zeros at scales up to T = 1015; (2) A conformal field theory-based boundary operator ˆRN with conformally invariant norm ∥ · ∥CFT, eliminating arbitrary threshold selection; (3) A fault-tolerant implementation scheme using ion trap quantum processors. Theoretically, verification of zeros deviating from the critical line with |Im(s)| 0.97 fidelity at T =1010 on an ion trap platform (d = 7 surface code) with 36-hour runtime

Keywords

Riemann hypothesis; Quantum algorithms; Conformal invariance; Ion trap quantum computing; Surface code error correction; Complexity analysis; Zero veri f icatio, Riemann hypothesis; Quantum algorithms; Conformal invariance; Ion trap quantum computing; Surface code error correction; Complexity analysis; Zero veri f icatio

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Green