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

Channels and Conditional Expectations over Functional Analysis (Common Ground between Functional Analysis and Mathematical Theory of Information)

Hisaharu Umegaki

Published Apr 1, 2002• 0 citations
OpenAlex

Related papers

Channels and Conditional Expectations over Functional Analysis (Common Ground between Functional Analysis and Mathematical Theory of Information)

寿春 梅垣

•Apr 1, 2002•0 citations

Fidelity in a quantum teleportation model (Common Ground between Functional Analysis and Mathematical Theory of Information)

Takayuki Miyadera, Masanori Ohya, Karl‐Heinz Fichtner

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

The Functional Analysis of Quantum Information Theory

Ved Prakash Gupta, Prabha Mandayam, Viakalathur Shankar Sunder

Lecture notes in physics•Jan 1, 2015•27 citations

Quantum-Inspired Semantic Communication Capacity Analysis based on von Neumann Entropy

Zhu Han, Dusit Tao Niyato

Semantic communication aims to transmit the task-relevant uncertainty that remains after common knowledge has been taken into account. However, the semantic communication capacity and rate distortion analysis have not been well investigated theoretically. Inspired by quantum entanglement across a black-hole horizon, this paper develops a quantum-inspired framework, where we present a von Neumann entropy bridge between new information and existing common knowledge. Conditioned on the existing common knowledge and the new information, we show that the corresponding von Neumann entropy is continuous and nondecreasing. To give this von Neumann entropy a practical interpretation, we define an auxiliary classical spectral-mode source, whose conditional probabilities are the eigenvalues of the reduced state. Then the resulting semantic capacity and tradeoff are discussed between the fully new information (the Shannon capacity case) and fully common knowledge (no new information) limits. Furthermore, we derive a conditional rate-distortion function, a source-channel feasibility condition, and a task-specific semantic-sample throughput over a cost-constrained discrete memoryless channel. A binary example illustrates the effects of common knowledge, semantic distinguishability, distortion tolerance, and the physical channel capacity.

ACM International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing (MobiHoc)•Oct 30, 2026•0 citations

Mathematical Foundations of Quantum Pricing Theory

Tian Xin, Liang Aoqin

Let $M$ be a von Neumann algebra and let $(N_t)_{t\in[0,T]}$ be an increasing family of abelian von Neumann subalgebras encoding a (classical) information flow. Fix a faithful normal state $φ_ρ$ and a filtration of normal $φ_ρ$-preserving conditional expectations $E_t:M\to N_t$ satisfying the tower property. Using bounded functional-calculus cutoffs $f_n$, we introduce a truncation-stable notion of localized $(N_t,E_t)$-martingales for affiliated self-adjoint observables, and formulate a \emph{Local Informational Efficiency Principle} requiring symmetrically discounted traded prices to be martingales in this sense. Assuming a pricing state $φ^\star$ and a compatible family of normal $φ^\star$-preserving conditional expectations $(E_t^\star)$, we define for bounded terminal payoffs $X\in M_T$ the dynamic pricing operator \[ Π_t(X):=B_t^{1/2}\,E_t^\star\!\bigl(B_T^{-1/2}XB_T^{-1/2}\bigr)\,B_t^{1/2}, \] where $(B_t)$ is a strictly positive numéraire adapted to $(N_t)$. We prove that $(Π_t)$ is normal, completely positive, $N_t$-bimodular, and time-consistent, and satisfies $Π_t(\mathbf 1)=B_t$ (equivalently, $\widetildeΠ_t(X):=B_t^{-1/2}Π_t(X)B_t^{-1/2}$ is unital). In the commutative reduction it agrees with risk-neutral valuation by conditional expectation. Finally, we develop an $L^2(M,φ_ρ)$ prediction theory and introduce an operator-valued Fisher information relative to $(N_t)$, obtaining a noncommutative Cramér--Rao lower bound for conditional mean-square prediction error; we compute the bound for compound Poisson lattice-jump models under $\sum_αγ_α(e^{αΔx}-1)=r$.

arXiv:2601.14355•Jan 20, 2026•0 citations

Fundamentals of Information Theory

Elloá B. Guedes, Francisco de Assis, Rex A. C. Medeiros

Springer eBooks•Jan 1, 2016•6 citations
Semantic communication aims to transmit the task-relevant uncertainty that remains after common knowledge has been taken into account. However, the semantic communication capacity and rate distortion analysis have not been well investigated theoretically. Inspired by quantum entanglement across a black-hole horizon, this paper develops a quantum-inspired framework, where we present a von Neumann entropy bridge between new information and existing common knowledge. Conditioned on the existing common knowledge and the new information, we show that the corresponding von Neumann entropy is continuous and nondecreasing. To give this von Neumann entropy a practical interpretation, we define an auxiliary classical spectral-mode source, whose conditional probabilities are the eigenvalues of the reduced state. Then the resulting semantic capacity and tradeoff are discussed between the fully new information (the Shannon capacity case) and fully common knowledge (no new information) limits. Furthermore, we derive a conditional rate-distortion function, a source-channel feasibility condition, and a task-specific semantic-sample throughput over a cost-constrained discrete memoryless channel. A binary example illustrates the effects of common knowledge, semantic distinguishability, distortion tolerance, and the physical channel capacity.
Let MMM be a von Neumann algebra and let (Nt)t∈[0,T](N_t)_{t\in[0,T]}(Nt​)t∈[0,T]​ be an increasing family of abelian von Neumann subalgebras encoding a (classical) information flow. Fix a faithful normal state φρφ_ρφρ​ and a filtration of normal φρφ_ρφρ​-preserving conditional expectations Et:M→NtE_t:M\to N_tEt​:M→Nt​ satisfying the tower property. Using bounded functional-calculus cutoffs fnf_nfn​, we introduce a truncation-stable notion of localized (Nt,Et)(N_t,E_t)(Nt​,Et​)-martingales for affiliated self-adjoint observables, and formulate a \emph{Local Informational Efficiency Principle} requiring symmetrically discounted traded prices to be martingales in this sense. Assuming a pricing state φ⋆φ^\starφ⋆ and a compatible family of normal φ⋆φ^\starφ⋆-preserving conditional expectations (Et⋆)(E_t^\star)(Et⋆​), we define for bounded terminal payoffs X∈MTX\in M_TX∈MT​ the dynamic pricing operator Πt(X):=Bt1/2 Et⋆ ⁣(BT−1/2XBT−1/2) Bt1/2, Π_t(X):=B_t^{1/2}\,E_t^\star\!\bigl(B_T^{-1/2}XB_T^{-1/2}\bigr)\,B_t^{1/2}, Πt​(X):=Bt1/2​Et⋆​(BT−1/2​XBT−1/2​)Bt1/2​, where (Bt)(B_t)(Bt​) is a strictly positive numéraire adapted to (Nt)(N_t)(Nt​). We prove that (Πt)(Π_t)(Πt​) is normal, completely positive, NtN_tNt​-bimodular, and time-consistent, and satisfies Πt(1)=BtΠ_t(\mathbf 1)=B_tΠt​(1)=Bt​ (equivalently, Π~t(X):=Bt−1/2Πt(X)Bt−1/2\widetildeΠ_t(X):=B_t^{-1/2}Π_t(X)B_t^{-1/2}Πt​(X):=Bt−1/2​Πt​(X)Bt−1/2​ is unital). In the commutative reduction it agrees with risk-neutral valuation by conditional expectation. Finally, we develop an L2(M,φρ)L^2(M,φ_ρ)L2(M,φρ​) prediction theory and introduce an operator-valued Fisher information relative to (Nt)(N_t)(Nt​), obtaining a noncommutative Cramér--Rao lower bound for conditional mean-square prediction error; we compute the bound for compound Poisson lattice-jump models under ∑αγα(eαΔx−1)=r\sum_αγ_α(e^{αΔx}-1)=r∑α​γα​(eαΔx−1)=r.