Related papers: On Infinite Tensor Networks, Complementary Recover…
We study kernel functions, and associated reproducing kernel Hilbert spaces $\mathscr{H}$ over infinite, discrete and countable sets $V$. Numerical analysis builds discrete models (e.g., finite element) for the purpose of finding…
We study infinite weighted graphs with view to \textquotedblleft limits at infinity,\textquotedblright or boundaries at infinity. Examples of such weighted graphs arise in infinite (in practice, that means \textquotedblleft…
We study the robustness of quantum and classical information to perturbations implemented by local operator insertions. We do this by computing multipartite entanglement measures in the Hilbert space of local operators in the Heisenberg…
A fully tensorial theoretical framework for hypercomplex-valued neural networks is presented. The proposed approach enables neural network architectures to operate on data defined over arbitrary finite-dimensional algebras. The central…
We present a generalization of quantum error correction to infinite-dimensional Hilbert spaces. The generalization yields new classes of quantum error correcting codes that have no finite-dimensional counterparts. The error correction…
Deep generative models have become a standard for modeling priors for inverse problems, going beyond classical sparsity-based methods. However, existing theoretical guarantees are mostly confined to finite-dimensional vector spaces,…
We apply artificial neural networks to the holographic inverse problem, reconstructing bulk geometry from boundary entanglement entropy by using the Ryu--Takayanagi area functional as a differentiable loss. Validated on the…
We study holographic entanglement entropy in four-dimensional quantum gravity with negative cosmological constant. By using the replica trick and evaluating path integrals in the minisuperspace approximation, in conjunction with the…
By classifying infinite-width neural networks and identifying the *optimal* limit, Tensor Programs IV and V demonstrated a universal way, called $\mu$P, for *widthwise hyperparameter transfer*, i.e., predicting optimal hyperparameters of…
In the long-standing quest to reconcile gravity with quantum mechanics, profound connections have been unveiled between concepts traditionally pertaining to quantum information theory, such as entanglement, and constitutive features of…
It was recently shown by Harlow that any quantum error correcting code, satisfying the same complementary recovery properties as AdS/CFT, will obey a version of the Ryu-Takayanagi formula. In his most general result, Harlow allowed the bulk…
We study the holographic properties of a class of quantum geometry states characterized by a superposition of discrete geometric data, in the form of generalised tensor networks. This class specifically includes spin networks, the kinematic…
In this paper, we introduced the local and global mixed Morrey-type spaces, and some properties of these spaces are also studied. After that, the necessary conditions of the boundedness of fractional integral operators $I_{\alpha}$ are…
Random tensor networks provide useful models that incorporate various important features of holographic duality. A tensor network is usually defined for a fixed graph geometry specified by the connection of tensors. In this paper, we…
In canonical quantum gravity, the presence of spatial boundaries naturally leads to a boundary quantum states, representing quantum boundary conditions for the bulk fields. As a consequence, quantum states of the bulk geometry needs to be…
This paper is concerned with the question of reconstructing a vector in a finite-dimensional real Hilbert space when only the magnitudes of the coefficients of the vector under a redundant linear map are known. We analyze various Lipschitz…
Tensor networks are useful toy models for understanding the structure of entanglement in holographic states and reconstruction of bulk operators within the entanglement wedge. They are, however, constrained to only prepare so-called…
A sort of planar tensor networks with tensor constraints is investigated as a model for holography. We study the greedy algorithm generated by tensor constraints and propose the notion of critical protection (CP) against the action of…
Complementable operators extend classical matrix decompositions, such as the Schur complement, to the setting of infinite-dimensional Hilbert spaces, thereby broadening their applicability in various mathematical and physical contexts. This…
In this paper, we study the sample complexity lower bounds for the exact recovery of parameters and for a positive excess risk of a feed-forward, fully-connected neural network for binary classification, using information-theoretic tools.…