Related papers: Equilibrium Graphs
We obtain eigenvalue equations satisfied by various elliptic modular graphs with five links where two of the vertices are unintegrated. Solving them leads to several non--trivial algebraic identities between these graphs.
This short note proposes a symbolic approach for representing and reasoning about quantum circuits using complex, vector or matrix-valued Boolean expressions. A major benefit of this approach is that it allows us to directly borrow the…
In arXiv: math.LO/0011208 we proposed the {\sl intuitionistic or disjunctive representation of quantum logic}, i.e., a representation of the property lattice of physical systems as a complete Heyting algebra of logical propositions on these…
Disentangling the explanatory factors in complex data is a promising approach for generalizable and data-efficient representation learning. While a variety of quantitative metrics for learning and evaluating disentangled representations…
Graphical (Linear) Algebra is a family of diagrammatic languages allowing to reason about different kinds of subsets of vector spaces compositionally. It has been used to model various application domains, from signal-flow graphs to Petri…
Computability logic (CoL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a recently introduced semantical platform and ambitious program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth…
Recent advances in the integration of deep learning with automated theorem proving have centered around the representation of logical formulae as inputs to deep learning systems. In particular, there has been a growing interest in adapting…
In this paper, we propose a new way to represent graphs in quantum space. In that approach, we replace the rows of the adjacency matrix of the graph by state vectors in the occupation number representation. Unlike the traditional definition…
Recently, there has been a surge of interest in employing neural networks for graph generation, a fundamental statistical learning problem with critical applications like molecule design and community analysis. However, most approaches…
Presented is a topological representation of quantum logic that views entangled qubit spacetime histories (or qubit world lines) as a generalized braid, referred to as a superbraid. The crossing of world lines is purely quantum in nature,…
One of the many interesting algebraic objects associated to a given rational elliptic curve, $E$, is its full-torsion representation $\rho_E:\mathrm{Gal}(\bar{\mathbf{Q}}/\mathbf{Q})\to\mathrm{GL}_2(\hat{\mathbf{Z}})$. Generalizing this…
This paper presents a novel simplification calculus for propositional logic derived from Peirce's existential graphs' rules of inference and implication graphs. Our rules can be applied to propositional logic formulae in nested form, are…
The syntax of modal graphs is defined in terms of the continuous cut and broken cut following Charles Peirce's notation in the gamma part of his graphical logic of existential graphs. Graphical calculi for normal modal logics are developed…
Beyond word embeddings, continuous representations of knowledge graph (KG) components, such as entities, types and relations, are widely used for entity mention disambiguation, relation inference and deep question answering. Great strides…
We define formal exponential maps for any graded manifold as maps from the formal tangent bundle (that we also define) into the graded manifold. We show that each such map uniquely determines and is determined by its associated Grothendieck…
A quantum circuit is a computational unit that transforms an input quantum state to an output one. A natural way to reason about its behavior is to compute explicitly the unitary matrix implemented by it. However, when the number of qubits…
This paper considers minimum-dimensional representations of graphs in pseudo-Euclidean spaces, where adjacency and non-adjacency relations are reflected in fixed scalar square values. A representation of a simple graph $(V,E)$ is a mapping…
For a reductive group G over a non-archimedean local field, we compare smooth representations over C with smooth representations over Qbar (an algebraic closure of Q). We show that an elliptic G-representation (in the sense of Arthur) can…
Graphical calculi for representing interacting quantum systems serve a number of purposes: compositionally, intuitive graphical reasoning, and a logical underpinning for automation. The power of these calculi stems from the fact that they…
Parameterized Quantum Circuits (PQCs) are essential to quantum machine learning and optimization algorithms. The expressibility of PQCs, which measures their ability to represent a wide range of quantum states, is a critical factor…