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

THE COMPUTATIONAL REDUCIBILITY THEOREM

Materov

Published Jul 3, 2026• 0 citations
Publisher

Abstract

Abstract Wolfram's Principle of Computational Irreducibility asserts that for most non-trivial discrete systems there exists no analytical shortcut: to determine the state at time T, one must simulate all T steps. For finite-dimensional unitary graph systems, the evolution admits an exact spectral representation for a specific class of systems: finite quantum graphs with unitary evolution. Knowledge of the spectral slice - the quantum state |Ψ(t₀)⟩ and the spectrum of the evolution operator Û - fully and exactly determines the state at any moment T without stepping through intermediate times. The theorem is a principled, not a practical result: algorithmic complexity O( ) remains exponential. Practical significance is achieved in the coarse-graining limit at scale ℓ >> a, where the problem reduces to polynomial complexity. Three conditions - finiteness, unitarity, linearity - constitute the exact domain of applicability.

DOI
10.5281/zenodo.21163798

Related papers

Computational Reducibility theorem

Sergej Materov

Computational Reducibility Theorem.Against S. Wolfram's Principle of Computational Irreducibility:The sufficiency of a single slice to predict the entire evolution.Time is not a fundamental step-by-step process—it emerges from the spectrum of the evolutionary operator. Therefore, the "future" is not ontologically inaccessible: it is already fully encoded in the spectral structure of the present. Computational reducibility is not a trick involving substitution into a formula. It reflects the fact that in Quantumograph, time and spectrum are the same thing, described in different languages.A Blow to Cryptography?Implications and Practical Outlook. The main consequence is not a universal cryptanalytic breakthrough, but a precise separation between principled and operational predictability. Exact microstate prediction remains exponentially costly, whereas coarse-grained observables admit polynomial forecasting. This makes the framework relevant for model reduction, spectral inference, and device-level analysis, while the cryptographic threat landscape remains governed by dedicated quantum algorithms and by the ongoing transition to post-quantum cryptography.

•Mar 30, 2023•0 citations

Computational Reducibility theorem

Sergej Materov

A Principled Limitation of Wolfram's Computational Irreducibility for Finite Unitary Quantum Systems. The sufficiency of a single slice to predict the entire evolution. After diagonalization, prediction cost is independent of the time horizon. Time is not a fundamental step-by-step process—it emerges from the spectrum of the evolutionary operator. Therefore, the "future" is not ontologically inaccessible: it is already fully encoded in the spectral structure of the present. Computational reducibility is not a trick involving substitution into a formula. It reflects the fact that in Quantumograph, time and spectrum are the same thing, described in different languages.

•Apr 2, 2026•2 citations

Between Computability and Physical Realizability: The Computational Reducibility Theorem and the Fundamental Limit of Quantum Computation

Materov

This note connects two claims in the Quantumograph program. The Computational Reducibility Theorem shows that a finite unitary quantum graph is, in principle, exactly forecastable from one spectral slice: the state at one time together with the spectrum of the evolution operator. The Fundamental Limit of Quantum Computation (FLQC) adds a physical constraint: any realizable quantum device has a finite phase resolution, so exact spectral data and exact phase gates cannot be implemented with arbitrary precision. Realism, in this setting, is the position between these two statements. The universe is computable in principle, but nature imposes a nonzero floor on the precision with which that computability can be instantiated. The note derives the phase floor, compares it with the phase resolution required by QFT- and Shor-type circuits, and gives a concrete experimental signature on superconducting quantum processors.

•Jun 18, 2026•0 citations

Optimal Scaling Quantum Linear-Systems Solver via Discrete Adiabatic Theorem

Pedro C. S. Costa, Dong An, Yuval R. Sanders +3 more

Recently, several approaches to solving linear systems on a quantum computer have been formulated in terms of the quantum adiabatic theorem for a continuously varying Hamiltonian.Such approaches have enabled near-linear scaling in the condition number κ of the linear system, without requiring a complicated variable-time amplitude amplification procedure.However, the most efficient of those procedures is still asymptotically suboptimal by a factor of log(κ).Here, we prove a rigorous form of the adiabatic theorem that bounds the error in terms of the spectral gap for intrinsically discrete-time evolutions.In combination with the qubitized quantum walk, our discrete adiabatic theorem gives a speed-up for all adiabatic algorithms.Here, we use this combination to develop a quantum algorithm for solving linear systems that is asymptotically optimal, in the sense that the complexity is strictly linear in κ, matching a known lower bound on the complexity.Our O[κ log(1/ )] complexity is also optimal in terms of the combined scaling in κ and the precision .Compared to existing suboptimal methods, our algorithm is simpler and easier to implement.Moreover, we determine the constant factors in the algorithm, which would be suitable for determining the complexity in terms of gate counts for specific applications.

arXiv:2111.08152•PRX Quantum•Oct 7, 2022•196 citations

Quantum Prediction of Transport Dynamics in Discretized State Spaces

Felix Govaers

We propose a gate-based quantum algorithm for the prediction step of Bayesian state estimation based on the Fokker-Planck equation on a discretized position-velocity state space. The probability density is encoded in the amplitudes of a quantum state, enabling a compact representation of high-dimensional distributions. Exploiting the circulant structure of finite-difference operators, the evolution is realized in the spectral domain using quantum Fourier transforms and phase rotations. A key result is that the drift component can be implemented exactly in amplitude space, leading to an accurate reproduction of the classical transport dynamics. In contrast, the diffusion term does not admit a linear representation in amplitude space due to the nonlinear relation between probability density and wave function. To enable a quantum implementation, we introduce a unitary surrogate based on a Wick rotation, transforming diffusion into a dispersive phase evolution. This yields a fully unitary propagation that can be implemented efficiently on a gate-based quantum computer. The proposed method is evaluated numerically for different scenarios and shows strong agreement with the exact solution of the Fokker-Planck equation. The approach demonstrates the potential of quantum computing for Bayesian state estimation, as the representable state space grows exponentially with the number of qubits. This allows the efficient representation and propagation of probability densities that would otherwise require complex tensor decompositions on classical hardware, making the method a promising candidate for high-dimensional filtering problems.

quant-pharXiv:2604.24161•Apr 28, 2026•0 citations

COMPUTATIONAL REDUCIBILITY OF FINITE UNITARY QUANTUM SYSTEMS (technical note)

Materov

COMPUTATIONAL REDUCIBILITY OF FINITE UNITARY QUANTUM SYSTEMS (technical note). A Theory-Independent Result.

•Aug 10, 2026•2 citations
Abstract Wolfram's Principle of Computational Irreducibility asserts that for most non-trivial discrete systems there exists no analytical shortcut: to determine the state at time T, one must simulate all T steps. For finite-dimensional unitary graph systems, the evolution admits an exact spectral representation for a specific class of systems: finite quantum graphs with unitary evolution. Knowledge of the spectral slice - the quantum state |Ψ(t₀)⟩ and the spectrum of the evolution operator Û - fully and exactly determines the state at any moment T without stepping through intermediate times. The theorem is a principled, not a practical result: algorithmic complexity O( ) remains exponential. Practical significance is achieved in the coarse-graining limit at scale ℓ >> a, where the problem reduces to polynomial complexity. Three conditions - finiteness, unitarity, linearity - constitute the exact domain of applicability.
Computational Reducibility Theorem.Against S. Wolfram's Principle of Computational Irreducibility:The sufficiency of a single slice to predict the entire evolution.Time is not a fundamental step-by-step process—it emerges from the spectrum of the evolutionary operator. Therefore, the "future" is not ontologically inaccessible: it is already fully encoded in the spectral structure of the present. Computational reducibility is not a trick involving substitution into a formula. It reflects the fact that in Quantumograph, time and spectrum are the same thing, described in different languages.A Blow to Cryptography?Implications and Practical Outlook. The main consequence is not a universal cryptanalytic breakthrough, but a precise separation between principled and operational predictability. Exact microstate prediction remains exponentially costly, whereas coarse-grained observables admit polynomial forecasting. This makes the framework relevant for model reduction, spectral inference, and device-level analysis, while the cryptographic threat landscape remains governed by dedicated quantum algorithms and by the ongoing transition to post-quantum cryptography.
A Principled Limitation of Wolfram's Computational Irreducibility for Finite Unitary Quantum Systems. The sufficiency of a single slice to predict the entire evolution. After diagonalization, prediction cost is independent of the time horizon. Time is not a fundamental step-by-step process—it emerges from the spectrum of the evolutionary operator. Therefore, the "future" is not ontologically inaccessible: it is already fully encoded in the spectral structure of the present. Computational reducibility is not a trick involving substitution into a formula. It reflects the fact that in Quantumograph, time and spectrum are the same thing, described in different languages.
This note connects two claims in the Quantumograph program. The Computational Reducibility Theorem shows that a finite unitary quantum graph is, in principle, exactly forecastable from one spectral slice: the state at one time together with the spectrum of the evolution operator. The Fundamental Limit of Quantum Computation (FLQC) adds a physical constraint: any realizable quantum device has a finite phase resolution, so exact spectral data and exact phase gates cannot be implemented with arbitrary precision. Realism, in this setting, is the position between these two statements. The universe is computable in principle, but nature imposes a nonzero floor on the precision with which that computability can be instantiated. The note derives the phase floor, compares it with the phase resolution required by QFT- and Shor-type circuits, and gives a concrete experimental signature on superconducting quantum processors.
Recently, several approaches to solving linear systems on a quantum computer have been formulated in terms of the quantum adiabatic theorem for a continuously varying Hamiltonian.Such approaches have enabled near-linear scaling in the condition number κ of the linear system, without requiring a complicated variable-time amplitude amplification procedure.However, the most efficient of those procedures is still asymptotically suboptimal by a factor of log(κ).Here, we prove a rigorous form of the adiabatic theorem that bounds the error in terms of the spectral gap for intrinsically discrete-time evolutions.In combination with the qubitized quantum walk, our discrete adiabatic theorem gives a speed-up for all adiabatic algorithms.Here, we use this combination to develop a quantum algorithm for solving linear systems that is asymptotically optimal, in the sense that the complexity is strictly linear in κ, matching a known lower bound on the complexity.Our O[κ log(1/ )] complexity is also optimal in terms of the combined scaling in κ and the precision .Compared to existing suboptimal methods, our algorithm is simpler and easier to implement.Moreover, we determine the constant factors in the algorithm, which would be suitable for determining the complexity in terms of gate counts for specific applications.
We propose a gate-based quantum algorithm for the prediction step of Bayesian state estimation based on the Fokker-Planck equation on a discretized position-velocity state space. The probability density is encoded in the amplitudes of a quantum state, enabling a compact representation of high-dimensional distributions. Exploiting the circulant structure of finite-difference operators, the evolution is realized in the spectral domain using quantum Fourier transforms and phase rotations. A key result is that the drift component can be implemented exactly in amplitude space, leading to an accurate reproduction of the classical transport dynamics. In contrast, the diffusion term does not admit a linear representation in amplitude space due to the nonlinear relation between probability density and wave function. To enable a quantum implementation, we introduce a unitary surrogate based on a Wick rotation, transforming diffusion into a dispersive phase evolution. This yields a fully unitary propagation that can be implemented efficiently on a gate-based quantum computer. The proposed method is evaluated numerically for different scenarios and shows strong agreement with the exact solution of the Fokker-Planck equation. The approach demonstrates the potential of quantum computing for Bayesian state estimation, as the representable state space grows exponentially with the number of qubits. This allows the efficient representation and propagation of probability densities that would otherwise require complex tensor decompositions on classical hardware, making the method a promising candidate for high-dimensional filtering problems.