Related papers: A Reduction Algorithm for Cosmological Correlators…
Imagine we want to split a group of agents into teams in the most \emph{efficient} way, considering that each agent has their own preferences about their teammates. This scenario is modeled by the extensively studied \textsc{Coalition…
Linearity and ramification constraints have been widely used to weaken higher-order (primitive) recursion in such a way that the class of representable functions equals the class of polytime functions. We show that fine-tuning these two…
We present a tree-tensor-network-based method to study strongly correlated systems with nonlocal interactions in higher dimensions. Although the momentum-space and quantum-chemistry versions of the density matrix renormalization group…
In the lattice approach to Loop Quantum Gravity on a fixed graph computations tend to be involved and are rarely analytically manageable. But, when interested in the expectation values of coherent states on the lattice which are sharply…
We analyze the size and evolution of quantum fluctuations of cosmologically relevant geometric observables, in the context of the effective relational cosmological dynamics of GFT models of quantum gravity. We consider the fluctuations of…
A complete reduction on a difference field is a linear operator that enables one to decompose an element of the field as the sum of a summable part and a remainder such that the given element is summable if and only if the remainder is…
Deviations from classical physics when distant quantum systems become correlated are interesting both fundamentally and operationally. There exist situations where the correlations enable collaborative tasks that are impossible within the…
This article presents a new and efficient alternative to well established algorithms for molecular geometry optimization. The new approach exploits the approximate decoupling of molecular energetics in a curvilinear internal coordinate…
Convolutional Neural Networks (CNNs) have been widely applied. But as the CNNs grow, the number of arithmetic operations and memory footprint also increase. Furthermore, typical non-linear activation functions do not allow associativity of…
Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke…
Representations of multivariate functions with low-dimensional functions that depend on subsets of original coordinates (corresponding of different orders of coupling) are useful in quantum dynamics and other applications, especially where…
One of the most basic notions in physics is the partitioning of a system into subsystems, and the study of correlations among its parts. In this work, we explore these notions in the context of quantum reference frame (QRF) covariance, in…
This paper presents a novel set of algorithms for heap abstraction, identifying logically related regions of the heap. The targeted regions include objects that are part of the same component structure (recursive data structure). The result…
We uncover a combinatorial structure governing the differential equations satisfied by wavefunction coefficients of scalar fields with generic masses in de Sitter space. Using an integral representation of the massive mode functions, we…
The correlation matrix is a central representation of functional brain networks in neuroimaging. Traditional analyses often treat pairwise interactions independently in a Euclidean setting, overlooking the intrinsic geometry of correlation…
We construct a Goulian-Li-type continuation in the number of insertions of the cosmological constant operator which is no longer restricted to one dimensional target space. The method is applied to the calculation of the three-point and a…
Simulating molecular systems on quantum processors has the potential to surpass classical methods in computational resource efficiency. The limited qubit connectivity, small processor size, and short coherence times of near-term quantum…
In this article, we review the use of numerical techniques to obtain solutions for the quantum Hamiltonian constraint in loop quantum cosmology (LQC). First, we summarize the basic features of LQC, and describe features of the constraint…
Since there are quantization ambiguities in constructing the Hamiltonian constraint operator in isotropic loop quantum cosmology, it is crucial to check whether the key features of loop quantum cosmology, such as the quantum bounce and…
Contemporary large models often exhibit behaviors suggesting the presence of low-level primitives that compose into modules with richer functionality, but these fundamental building blocks remain poorly understood. We investigate this…