Related papers: On Holant Theorem and Its Proof
Quantum computers can execute algorithms that sometimes dramatically outperform classical computation. Undoubtedly the best-known example of this is Shor's discovery of an efficient quantum algorithm for factoring integers, whereas the same…
The Ryu-Takayanagi (RT) formula has been a key ingredient in our understanding of holography. Recent work on TT deformations has also boosted our understanding of holography away from the conformal boundary of AdS. In this short note, we…
Standard multiple-beam holography has been largely used to produce gratings in polymer-liquid crystal composites, like POLICRYPS, H-PDLC gratings and POLIPHEM [1]. In this work we present a different approach to liquid crystalpolymeric…
A real symmetric matrix (resp., tensor) is said to be copositive if the associated quadratic (resp., homogeneous) form is greater than or equal to zero over the nonnegative orthant. The problem of detecting their copositivity is NP-hard.…
A new algorithm of the canonical polyadic decomposition (CPD) presented here. It features lower computational complexity and memory usage than the available state of the art implementations. We begin with some examples of CPD applications…
The Celestial Holography program encompasses recent efforts to understand the flat space hologram in terms of a CFT living on the celestial sphere. A key development instigating these efforts came from understanding how soft limits of…
Abstract The coherence time $\tau$ c of light is an important physical parameter in fundamental and applied optics and therefore, it is crucial that students understand its meaning. In this work, this notion is addressed through holography…
Recent developments in holography have provided a new vista to the nucleon composition. A strongly coupled core nucleon tied with vector mesons emerge in line with the Cheshire cat principle. The cat is found to hide in the holographic…
A theoretical model of computation is proposed based on Lorentz quantum mechanics. Besides the standard qubits, this model has an additional bit, which we call hyperbolic bit (or hybit in short). A set of basic logical gates are constructed…
Integral transforms are invaluable mathematical tools to map functions into spaces where they are easier to characterize. We introduce the hyperdimensional transform as a new kind of integral transform. It converts square-integrable…
We propose a covariant geometrical expression for the c-function for theories which admit dual gravitational descriptions. We state a c-theorem with respect to this quantity and prove it. We apply the expression to a class of geometries,…
Motivated by the ability to consistently apply the Ryu-Takayanagi prescription for general convex surfaces and the relationship between entanglement and geometry in tensor networks, we introduce a novel, covariant bulk object - the…
In this article, we review recent progresses on the holographic understandings of the entanglement entropy in the AdS/CFT correspondence. After reviewing the general idea of holographic entanglement entropy, we will explain its applications…
We present an algorithm, called BiSC, that describes the patterns avoided by a given set of permutations. It automatically conjectures the statements of known theorems such as the descriptions of stack-sortable (Knuth 1975) and…
In this paper, a new general decomposition theory inspired from modular graph decomposition is presented. Our main result shows that, within this general theory, most of the nice algorithmic tools developed for modular decomposition are…
Theorem proving is a fundamental aspect of mathematics, spanning from informal reasoning in natural language to rigorous derivations in formal systems. In recent years, the advancement of deep learning, especially the emergence of large…
Mathematical theorems are human knowledge able to be accumulated in the form of symbolic representation, and proving theorems has been considered intelligent behavior. Based on the BHK interpretation and the Curry-Howard isomorphism, proof…
The Computable Cross Norm (CCNR) was recently discussed in Ref.~\cite{Yin:2022toc} as a measure of multipartite entanglement in a condensed matter context. In this short note, we point out that it is closely related to the $(2,n)$-R\'enyi…
This paper introduces a formalism that aims to describe the intricacies of quantum computation by establishing a connection with the mathematical foundations of tensor theory and multilinear maps. The focus is on providing a comprehensive…
As a kind of basic machine learning method, clustering algorithms group data points into different categories based on their similarity or distribution. We present a clustering algorithm by finding hyper-planes to distinguish the data…