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

COMPUTATIONAL REDUCIBILITY OF FINITE UNITARY QUANTUM SYSTEMS (technical note)

Materov

Published Aug 10, 2026• 2 citations
Publisher

Abstract

COMPUTATIONAL REDUCIBILITY OF FINITE UNITARY QUANTUM SYSTEMS (technical note). A Theory-Independent Result.
DOI
10.5281/zenodo.21864925

Related papers

THE COMPUTATIONAL REDUCIBILITY THEOREM

Materov

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.

•Jul 3, 2026•0 citations

Reversibility and Irreversibility in Quantum Computation and in Quantum Computational Logics

María Luisa Dalla Chiara, Roberto Giuntini, Roberto Leporini

Lecture notes in computer science•Jan 1, 2007•2 citations

On the Basic Algorithms of Quantum Computation

昌史 木村

•Mar 14, 2001•0 citations

FINITE-DIMENSIONAL APPROXIMATIONS OF QUANTUM SYSTEMS AND CONNES' EMBEDDING CONJECTURE

Volkher B. Scholz

We study the requirements for and implications of the existence of finite-dimensional approximations of quantum systems with an infinite number of degrees of freedom. We find a close relationship between these physical questions and the embedding problem of Alain Connes, appearing in the theory of von Neumann algebras. We are mainly interested in the bipartite scenario known from quantum information theory, where two independent parties act on a joint physical system, i.e. by performing measurements. This latter example leads to Tsirelson's problem, which asks whether the modeling of bipartite situations using the usual approach of tensor product of Hilbert spaces compared to the situation of only commuting observables leads to the same correlation tables. We model this situation using the theory of operator systems and explain the connection to Connes' embedding problem. We go on by employing the language of operator systems to elaborate on the requirements for the existence of finite-dimensional approximations for general quantum systems. We furthermore introduce the concept of ultraproducts of operator systems and use it to study the implications of two different kinds of finite-dimensional approximations. Note from Publisher: This article contains the abstract only.

WORLD SCIENTIFIC eBooks•Oct 1, 2013•0 citations

A NOTE ON THE EXISTENCE OF UNITARY PROPAGATOR OF EQUATIONS IN QUANTUM MECHANICS(Spectral and Scattering Theory and Its Related Topics)

弥 一ノ瀬

数理解析研究所講究録•Apr 1, 1995•0 citations

Reversibility and irreversibility in quantum computational logics

María Luisa Dalla Chiara, Roberto Giuntini, Roberto Leporini

•Jan 1, 2007•0 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.
We study the requirements for and implications of the existence of finite-dimensional approximations of quantum systems with an infinite number of degrees of freedom. We find a close relationship between these physical questions and the embedding problem of Alain Connes, appearing in the theory of von Neumann algebras. We are mainly interested in the bipartite scenario known from quantum information theory, where two independent parties act on a joint physical system, i.e. by performing measurements. This latter example leads to Tsirelson's problem, which asks whether the modeling of bipartite situations using the usual approach of tensor product of Hilbert spaces compared to the situation of only commuting observables leads to the same correlation tables. We model this situation using the theory of operator systems and explain the connection to Connes' embedding problem. We go on by employing the language of operator systems to elaborate on the requirements for the existence of finite-dimensional approximations for general quantum systems. We furthermore introduce the concept of ultraproducts of operator systems and use it to study the implications of two different kinds of finite-dimensional approximations. Note from Publisher: This article contains the abstract only.