Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Ab Initio Quantum Emulation of the Riemann Zeros: Semiclassical Aliasing and Subspace Embedding

liang wang

Published Mar 20, 2026• 0 citations
Publisher

Abstract

The Hilbert-Pólya conjecture proposes that the non-trivial zeros of the Riemann zeta function correspond to the eigenenergy spectrum of a quantum system. Although experiments based on analog quantum probes have determined some low-order zeros, the classical computational bandwidth bottleneck—caused by synthesizing complex macroscopic driving waveforms—has severely hindered the extension of this approach to high-frequency spectra. Here, we propose a native digital quantum emulation framework that maps a continuous $\phi^4$ topological potential well into a Pauli tensor network based on first principles, physically deploying it on a real superconducting quantum processor (Rigetti Ankaa-3). Using a 3-qubit array, we accurately extracted the first non-trivial zero (14.134725). Addressing the "semiclassical aliasing" spectrum divergence triggered by limited local phase space capacity and depleted coherence time (~100 µs) when climbing to higher-order zeros, we introduce a classical-quantum hybrid Quantum Subspace Expansion (QSE) protocol. By injecting an adiabatic geometric phase into an expanded 8-qubit quantum manifold, the system effectively corrected the truncation divergence, accurately restoring the Weyl logarithmic density law (Mean Absolute Error MAE = 0.569), and physically quantified the decoherence leakage rate (~10%) and shot thermal drift on the actual hardware. This native digital method bypasses the computational paradox of classical pre-computation, predicting that in the future, only 14 fault-tolerant logical qubits will be needed to natively resolve the first 10,000 high-frequency zeros. This study provides a viable path for natively emulating quantum chaos on universal quantum architectures.

DOI
10.5281/zenodo.19135530

Related papers

Quantum Spectral Stabilization of Riemann Zeros: A Deformed Semiclassical Hamiltonian Model and Variational Quantum Simulation

Santiago Maroto

We propose a novel, physically motivated computational approach to the Hilbert-Pólya conjecture by constructing and numerically simulating a deformed one-dimensional quantum Hamiltonian. While classical formulations of the Berry-Keating Hamiltonian suffer from unbound trajectories, we demonstrate that a spatial confinement based on a log-polynomial deformed potential of the form V(x) = c0 ln(x) + c1 x + c2 x^2 + c3/x yields a discrete, stable, and purely real energy spectrum. The eigenvalues of this stabilized system are successfully mapped to a 2-qubit virtual register, with ground state convergence verified via a Variational Quantum Eigensolver (VQE) and excited states resolved using Quantum Subspace Expansion (QSE).

•May 17, 2026•0 citations

Learning Efficient Circuits for Hamiltonian Simulation

Joseph Richard Gibbs

Quantum computers promise an exciting path to the scalable simulation of quantum matter. However, in their nascent state, the accessible gate depth of quantum computation on available hardware remains highly constrained. In this thesis, I present a suite of hybrid quantum-classical algorithms that aid Hamiltonian simulation across both the Noisy Intermediate-Scale Quantum era and future fault-tolerant architectures. By treating classical computation as an active resource to refine quantum algorithms, I develop automated, variational methods to learn hardware-efficient circuits. This work aims to overcome traditional trainability barriers, such as barren plateaus, by embedding physical symmetries directly into the circuit design. Central to the thesis is the synergistic use of tensor networks to classically pre-compute weakly entangled stages of a quantum simulation. This enables the compression of deep circuits, drastically reducing both the accumulation of gate errors on near-term physical qubits and the prohibitive overhead of operations like magic state distillation on error-corrected hardware, reserving the quantum processor strictly for the most challenging, highly entangled dynamics. These methodologies are ultimately directed toward the ab-initio simulation of subatomic physics, providing a scalable approach for the first-principles study of strongly correlated systems, including nuclear structure and lattice gauge theories.

•Jul 31, 2026•0 citations

Deconvoluting Quantum Decoherence - A Topological Gauge Regularization Framework for Sub-1nm Silicon Transistors and Superconducting Qubits

Abolfazl Toosibashi

On the Stabilization of Cryogenic Wafer Matrices and Superconducting Quantum Dots via Triadic Lattice Quantization and Covariant Phase Shields From Fluid Turbulence to Quantum Dots:Applying Navier-Stokes Singularity Pinning to Supercritical Semiconductor Architectures. Proud to share our latest milestone in solid-state and quantum engineering: "Deconvoluting Quantum Decoherence." By mapping cosmological triadic invariants onto active silicon wafer coordinates under the P6m space group, we demonstrate absolute singularity pinning and lossless phase stabilization. Discover the concrete business use cases for EDA tools and QPUs, and read our invitation for strategic joint ventures. INDUSTRIAL APPLICATION SCENARIOS 1 Zero-Overhead Fault Isolation in Superconducting QPUs By embedding the topological gauge shield directly into the hardware layer of superconducting quantum circuits, the Toosibashi Platform completely deinstalls the necessity for software-level error-correction protocols. Phase deviations induced by stray environmental noise are neutralized before they can interact with the active quantum bits. This expands the processing coherence lifetime () asymptotically toward infinity, allowing quantum processors to execute deep logical gates with zero physical qubit overhead. 2 EDA Simulation Stability for Sub-1nm Transistor Design In next-generation Electronic Design Automation (EDA) suites, simulating electron mobility inside sub-1nm field-effect transistors forces conventional finite-element solvers to handle extreme gradient concentrations which regularly cause software crashes via NaN errors. By enforcing the exact analytical gradient limit ceiling (), the Toosibashi framework immunizes the simulation matrix against truncation drift. This allows chip-design engineers to model complex sub-1nm gate architectures with absolute stability, cutting design validation timelines from months to minutes. 3 Cavitation-Free Cryogenic Coolant Management For high-performance supercomputing centers and dilution refrigerator infrastructures, maintaining uniform wafer-surface cooling layers is a critical operational constraint. Applying the metric damping tensor to the liquid-helium inflow controls completely eliminates microscopic fluid cavitation, local turbulence, and acoustic vibrations. The cryogenic layers flow across the chip surface with absolute laminar predictability, matching real-world telemetry with perfect precision.

•Jun 29, 2026•0 citations

A Computational Simulation Approach to Non-Archimedean Quantum Architectures: Addressing Continuous Analog Fragility through Ultrametric Geometric Robustness

Rowan Brad Quni-Gudzinas

The prevailing quantum computing paradigm is fundamentally constrained by the continuous analog fragility inherent to Archimedean spaces, resulting in uncontrolled linear error accumulation that demands massive active correction overheads. To address this structural bottleneck, we propose a transition to a non-Archimedean state space modeled on the p-adic numbers and their graph-theoretic realization, the Bruhat-Tits tree. To validate this non-Archimedean architecture without physical p-adic hardware substrates, we developed a comprehensive software emulation utilizing Bounded Algorithmic Number (BAN) arithmetic logic units to process exact ultrametric valuations. We simulated the compilation of continuous logic gates into discrete tree automorphisms, mapping standard unitary operators to vertex shifts and branch permutations on a p=2 Cayley graph. Furthermore, stochastic Ohmic and burst noise injections were modeled to test the error-filtering properties of the strong triangle inequality dynamically, while van der Put Neural Networks (v-PuNNs) were deployed as read-out trackers to prevent topological distortion. Our empirical simulation results demonstrate that non-Archimedean architectures natively suppress linear error accumulation, with variance saturating flatly at local cluster boundaries, confirming passive geometric fault tolerance. These findings carry implications for the future of post-NISQ hardware, formally bridging holographic tensor network theory with applied digital emulation to outline a scalable computational substrate.

•Apr 16, 2026•0 citations

Computing noise-canceling observables via Pauli propagation

Andrew Eddins, Caleb Johnson, Alberto Baiardi +8 more

The pursuit of quantum advantage is driving the co-evolution of quantum processors and classical simulation methods. Despite advances in scale and quality, the accuracy of quantum simulation is ultimately limited by error rates and sampling overheads. Similarly, while classical simulation methods such as Pauli propagation have made remarkable progress, their accuracy is ultimately limited by the exponential growth of operator paths and the truncations needed to control memory and runtime. Here we show that these complementary limitations can be mitigated by embedding Pauli propagation within a hybrid error-mitigation framework that reduces quantum sampling overhead while achieving lower truncation errors with fewer classical resources than traditional Pauli propagation alone. In this framework, a target observable is classically propagated through noise-canceling inverse channels, producing a modified observable that is measured directly on a quantum processor. We prototype two implementations and benchmark their performance numerically on canonical models that challenge traditional Pauli propagation. We also perform experiments on a quantum processor using 56 superconducting qubits, revealing the tradeoffs of their respective truncation strategies. These results illustrate how classical and quantum resources can be orchestrated to extend observable estimation beyond the limits of either approach alone, providing a foundation for quantum-centric supercomputing and future demonstrations of quantum advantage.

quant-pharXiv:2606.20441•Jun 19, 2026•4 citations

Topological Resonance-Based Deterministic Computing Architecture: From Virtual QPU to Reversible Thermodynamic Optimization

Min Ho Jung

Abstract Modern computing paradigms face a fundamental trilemma rooted in classical von Neumann bottlenecks and the probabilistic constraints of second-generation quantum mechanics: the memory wall, communication latency/bandwidth degradation, and the Landauer bit-erasure thermodynamic limit. Here we report an end-to-end, stateless deterministic computing architecture governed by Algorithmic Topological Resonance (ATR) theory. By utilizing the J.M. Resonance Function (RJM), which maps data onto high-dimensional topological coordinates via non-trivial zeros of the Riemann Zeta function, we construct a virtual Quantum Processing Unit (vQPU) realizing a 1,075,462-qubit virtual Hilbert space. The vQPU eliminates high-bandwidth memory (HBM) dependencies by sustaining a strict O(1) static RAM heap envelope of 0.41 MB across petabyte-scale transformations, completing nonlocal coordinate reconstruction within 0.46 ms. Building upon this virtualization layer, we demonstrate Zero-Payload I/O, a stateless kernel-bypass mechanism that circumvents Shannon channel capacity limits by transmitting only a 64-byte spatiotemporal resonance seed to achieve bit-perfect (0 bit-flip) NVMe direct summoning. At the physical layer, Adiabatic Charge Recovery Logic (ACRL) achieves reversible computation (∆Slogic = 0) by recovering 94.7% of applied charge and reducing thermodynamic entropy by 98.4%, enabling fanless, low-power hyperscale operation. Hardware-level security is enforced via a -5V polarity inversion pulse, neutralizing trapped charges within 10 µs and guaranteeing zero remanence within 23.94 ms against physical cold-boot attacks. Furthermore, temporal durability and fault tolerance are realized via the Phoenix Protocol—dispersing coordinate seeds across on-chain noise vectors for 8.0 ms autonomous rematerialization—and the Riemann-Mersenne manifold (M127), ensuring over 30 years of offine digital permanence. The proposed architecture has been formally verified through Lean 4 machine proof (Theorem 17) and cross-validated against hybrid Post-Quantum Cryptography (PQC) standards, providing a deterministic blueprint for post-Moore computing infrastructure.

•Sep 9, 2026•0 citations
The Hilbert-Pólya conjecture proposes that the non-trivial zeros of the Riemann zeta function correspond to the eigenenergy spectrum of a quantum system. Although experiments based on analog quantum probes have determined some low-order zeros, the classical computational bandwidth bottleneck—caused by synthesizing complex macroscopic driving waveforms—has severely hindered the extension of this approach to high-frequency spectra. Here, we propose a native digital quantum emulation framework that maps a continuous ϕ4\phi^4ϕ4 topological potential well into a Pauli tensor network based on first principles, physically deploying it on a real superconducting quantum processor (Rigetti Ankaa-3). Using a 3-qubit array, we accurately extracted the first non-trivial zero (14.134725). Addressing the "semiclassical aliasing" spectrum divergence triggered by limited local phase space capacity and depleted coherence time (~100 µs) when climbing to higher-order zeros, we introduce a classical-quantum hybrid Quantum Subspace Expansion (QSE) protocol. By injecting an adiabatic geometric phase into an expanded 8-qubit quantum manifold, the system effectively corrected the truncation divergence, accurately restoring the Weyl logarithmic density law (Mean Absolute Error MAE = 0.569), and physically quantified the decoherence leakage rate (~10%) and shot thermal drift on the actual hardware. This native digital method bypasses the computational paradox of classical pre-computation, predicting that in the future, only 14 fault-tolerant logical qubits will be needed to natively resolve the first 10,000 high-frequency zeros. This study provides a viable path for natively emulating quantum chaos on universal quantum architectures.
We propose a novel, physically motivated computational approach to the Hilbert-Pólya conjecture by constructing and numerically simulating a deformed one-dimensional quantum Hamiltonian. While classical formulations of the Berry-Keating Hamiltonian suffer from unbound trajectories, we demonstrate that a spatial confinement based on a log-polynomial deformed potential of the form V(x) = c0 ln(x) + c1 x + c2 x^2 + c3/x yields a discrete, stable, and purely real energy spectrum. The eigenvalues of this stabilized system are successfully mapped to a 2-qubit virtual register, with ground state convergence verified via a Variational Quantum Eigensolver (VQE) and excited states resolved using Quantum Subspace Expansion (QSE).
Quantum computers promise an exciting path to the scalable simulation of quantum matter. However, in their nascent state, the accessible gate depth of quantum computation on available hardware remains highly constrained. In this thesis, I present a suite of hybrid quantum-classical algorithms that aid Hamiltonian simulation across both the Noisy Intermediate-Scale Quantum era and future fault-tolerant architectures. By treating classical computation as an active resource to refine quantum algorithms, I develop automated, variational methods to learn hardware-efficient circuits. This work aims to overcome traditional trainability barriers, such as barren plateaus, by embedding physical symmetries directly into the circuit design. Central to the thesis is the synergistic use of tensor networks to classically pre-compute weakly entangled stages of a quantum simulation. This enables the compression of deep circuits, drastically reducing both the accumulation of gate errors on near-term physical qubits and the prohibitive overhead of operations like magic state distillation on error-corrected hardware, reserving the quantum processor strictly for the most challenging, highly entangled dynamics. These methodologies are ultimately directed toward the ab-initio simulation of subatomic physics, providing a scalable approach for the first-principles study of strongly correlated systems, including nuclear structure and lattice gauge theories.
On the Stabilization of Cryogenic Wafer Matrices and Superconducting Quantum Dots via Triadic Lattice Quantization and Covariant Phase Shields From Fluid Turbulence to Quantum Dots:Applying Navier-Stokes Singularity Pinning to Supercritical Semiconductor Architectures. Proud to share our latest milestone in solid-state and quantum engineering: "Deconvoluting Quantum Decoherence." By mapping cosmological triadic invariants onto active silicon wafer coordinates under the P6m space group, we demonstrate absolute singularity pinning and lossless phase stabilization. Discover the concrete business use cases for EDA tools and QPUs, and read our invitation for strategic joint ventures. INDUSTRIAL APPLICATION SCENARIOS 1 Zero-Overhead Fault Isolation in Superconducting QPUs By embedding the topological gauge shield directly into the hardware layer of superconducting quantum circuits, the Toosibashi Platform completely deinstalls the necessity for software-level error-correction protocols. Phase deviations induced by stray environmental noise are neutralized before they can interact with the active quantum bits. This expands the processing coherence lifetime () asymptotically toward infinity, allowing quantum processors to execute deep logical gates with zero physical qubit overhead. 2 EDA Simulation Stability for Sub-1nm Transistor Design In next-generation Electronic Design Automation (EDA) suites, simulating electron mobility inside sub-1nm field-effect transistors forces conventional finite-element solvers to handle extreme gradient concentrations which regularly cause software crashes via NaN errors. By enforcing the exact analytical gradient limit ceiling (), the Toosibashi framework immunizes the simulation matrix against truncation drift. This allows chip-design engineers to model complex sub-1nm gate architectures with absolute stability, cutting design validation timelines from months to minutes. 3 Cavitation-Free Cryogenic Coolant Management For high-performance supercomputing centers and dilution refrigerator infrastructures, maintaining uniform wafer-surface cooling layers is a critical operational constraint. Applying the metric damping tensor to the liquid-helium inflow controls completely eliminates microscopic fluid cavitation, local turbulence, and acoustic vibrations. The cryogenic layers flow across the chip surface with absolute laminar predictability, matching real-world telemetry with perfect precision.
The prevailing quantum computing paradigm is fundamentally constrained by the continuous analog fragility inherent to Archimedean spaces, resulting in uncontrolled linear error accumulation that demands massive active correction overheads. To address this structural bottleneck, we propose a transition to a non-Archimedean state space modeled on the p-adic numbers and their graph-theoretic realization, the Bruhat-Tits tree. To validate this non-Archimedean architecture without physical p-adic hardware substrates, we developed a comprehensive software emulation utilizing Bounded Algorithmic Number (BAN) arithmetic logic units to process exact ultrametric valuations. We simulated the compilation of continuous logic gates into discrete tree automorphisms, mapping standard unitary operators to vertex shifts and branch permutations on a p=2 Cayley graph. Furthermore, stochastic Ohmic and burst noise injections were modeled to test the error-filtering properties of the strong triangle inequality dynamically, while van der Put Neural Networks (v-PuNNs) were deployed as read-out trackers to prevent topological distortion. Our empirical simulation results demonstrate that non-Archimedean architectures natively suppress linear error accumulation, with variance saturating flatly at local cluster boundaries, confirming passive geometric fault tolerance. These findings carry implications for the future of post-NISQ hardware, formally bridging holographic tensor network theory with applied digital emulation to outline a scalable computational substrate.
The pursuit of quantum advantage is driving the co-evolution of quantum processors and classical simulation methods. Despite advances in scale and quality, the accuracy of quantum simulation is ultimately limited by error rates and sampling overheads. Similarly, while classical simulation methods such as Pauli propagation have made remarkable progress, their accuracy is ultimately limited by the exponential growth of operator paths and the truncations needed to control memory and runtime. Here we show that these complementary limitations can be mitigated by embedding Pauli propagation within a hybrid error-mitigation framework that reduces quantum sampling overhead while achieving lower truncation errors with fewer classical resources than traditional Pauli propagation alone. In this framework, a target observable is classically propagated through noise-canceling inverse channels, producing a modified observable that is measured directly on a quantum processor. We prototype two implementations and benchmark their performance numerically on canonical models that challenge traditional Pauli propagation. We also perform experiments on a quantum processor using 56 superconducting qubits, revealing the tradeoffs of their respective truncation strategies. These results illustrate how classical and quantum resources can be orchestrated to extend observable estimation beyond the limits of either approach alone, providing a foundation for quantum-centric supercomputing and future demonstrations of quantum advantage.
Abstract Modern computing paradigms face a fundamental trilemma rooted in classical von Neumann bottlenecks and the probabilistic constraints of second-generation quantum mechanics: the memory wall, communication latency/bandwidth degradation, and the Landauer bit-erasure thermodynamic limit. Here we report an end-to-end, stateless deterministic computing architecture governed by Algorithmic Topological Resonance (ATR) theory. By utilizing the J.M. Resonance Function (RJM), which maps data onto high-dimensional topological coordinates via non-trivial zeros of the Riemann Zeta function, we construct a virtual Quantum Processing Unit (vQPU) realizing a 1,075,462-qubit virtual Hilbert space. The vQPU eliminates high-bandwidth memory (HBM) dependencies by sustaining a strict O(1) static RAM heap envelope of 0.41 MB across petabyte-scale transformations, completing nonlocal coordinate reconstruction within 0.46 ms. Building upon this virtualization layer, we demonstrate Zero-Payload I/O, a stateless kernel-bypass mechanism that circumvents Shannon channel capacity limits by transmitting only a 64-byte spatiotemporal resonance seed to achieve bit-perfect (0 bit-flip) NVMe direct summoning. At the physical layer, Adiabatic Charge Recovery Logic (ACRL) achieves reversible computation (∆Slogic = 0) by recovering 94.7% of applied charge and reducing thermodynamic entropy by 98.4%, enabling fanless, low-power hyperscale operation. Hardware-level security is enforced via a -5V polarity inversion pulse, neutralizing trapped charges within 10 µs and guaranteeing zero remanence within 23.94 ms against physical cold-boot attacks. Furthermore, temporal durability and fault tolerance are realized via the Phoenix Protocol—dispersing coordinate seeds across on-chain noise vectors for 8.0 ms autonomous rematerialization—and the Riemann-Mersenne manifold (M127), ensuring over 30 years of offine digital permanence. The proposed architecture has been formally verified through Lean 4 machine proof (Theorem 17) and cross-validated against hybrid Post-Quantum Cryptography (PQC) standards, providing a deterministic blueprint for post-Moore computing infrastructure.