Multiparameter Persistent Homology-Generic Structures and Quantum
Computing
- URL: http://arxiv.org/abs/2210.11433v1
- Date: Thu, 20 Oct 2022 17:30:20 GMT
- Title: Multiparameter Persistent Homology-Generic Structures and Quantum
Computing
- Authors: Amelie Schreiber
- Abstract summary: This article is an application of commutative algebra to the study of persistent homology in topological data analysis.
The generic structure of such resolutions and the classifying spaces are studied using results spanning several decades of research.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The following article is an application of commutative algebra to the study
of multiparameter persistent homology in topological data analysis. In
particular, the theory of finite free resolutions of modules over polynomial
rings is applied to multiparameter persistent modules. The generic structure of
such resolutions and the classifying spaces involved are studied using results
spanning several decades of research in commutative algebra, beginning with the
study of generic structural properties of free resolutions popularized by
Buchsbaum and Eisenbud. Many explicit computations are presented using the
computer algebra package Macaulay2, along with the code used for computations.
This paper serves as a collection of theoretical results from commutative
algebra which will be necessary as a foundation in the future use of
computational methods using Gr\"obner bases, standard monomial theories, Young
tableaux, Schur functors and Schur polynomials, and the classical
representation theory and invariant theory involved in linear algebraic group
actions. The methods used are in general characteristic free and are designed
to work over the ring of integers in order to be useful for applications and
computations in data science. As an applications we explain how one could apply
2-parameter persistent homology to study time-varying interactions graphs
associated to quadratic Hamiltonians such as those in the Ising model or
Kitaev's torus code and other surface codes.
Related papers
- Gaussian Entanglement Measure: Applications to Multipartite Entanglement
of Graph States and Bosonic Field Theory [50.24983453990065]
An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers.
We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states.
By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
arXiv Detail & Related papers (2024-01-31T15:50:50Z) - Strategies for simulating time evolution of Hamiltonian lattice field theories [0.0]
Simulating the time evolution of quantum field theories given some Hamiltonian $H$ requires developing algorithms for implementing the unitary operator e-iHt.
Some techniques exist that promise better scaling in certain parameters of the theory being simulated, the most efficient of which are based on the concept of block encoding.
We derive and compare the gate complexities of several commonly used simulation techniques in application to Hamiltonian Lattice Field Theories.
arXiv Detail & Related papers (2023-12-18T19:00:07Z) - Covering Number of Real Algebraic Varieties and Beyond: Improved Bounds and Applications [8.438718130535296]
We prove upper bounds on the covering number of sets in Euclidean space.
We show that bounds improve the best known general bound by Yomdin-Comte.
We illustrate the power of the result on three computational applications.
arXiv Detail & Related papers (2023-11-09T03:06:59Z) - Deep Learning Symmetries and Their Lie Groups, Algebras, and Subalgebras
from First Principles [55.41644538483948]
We design a deep-learning algorithm for the discovery and identification of the continuous group of symmetries present in a labeled dataset.
We use fully connected neural networks to model the transformations symmetry and the corresponding generators.
Our study also opens the door for using a machine learning approach in the mathematical study of Lie groups and their properties.
arXiv Detail & Related papers (2023-01-13T16:25:25Z) - Mathematical Foundations for a Compositional Account of the Bayesian
Brain [0.0]
We use the tools of contemporary applied category theory to supply functorial semantics for approximate inference.
We define fibrations of statistical games and classify various problems of statistical inference as corresponding sections.
We construct functors which explain the compositional structure of predictive coding neural circuits under the free energy principle.
arXiv Detail & Related papers (2022-12-23T18:58:17Z) - The Many-Worlds Calculus [0.0]
We propose a colored PROP to model computation in this framework.
The model can support regular tests, probabilistic and non-deterministic branching, as well as quantum branching.
We prove the language to be universal, and the equational theory to be complete with respect to this semantics.
arXiv Detail & Related papers (2022-06-21T10:10:26Z) - Learning Algebraic Recombination for Compositional Generalization [71.78771157219428]
We propose LeAR, an end-to-end neural model to learn algebraic recombination for compositional generalization.
Key insight is to model the semantic parsing task as a homomorphism between a latent syntactic algebra and a semantic algebra.
Experiments on two realistic and comprehensive compositional generalization demonstrate the effectiveness of our model.
arXiv Detail & Related papers (2021-07-14T07:23:46Z) - Exact correlations in topological quantum chains [0.0]
We derive closed expressions for quantities for certain classes of topological fermionic wires.
General models in these classes can be obtained by taking limits of the models we analyse.
These results constitute the first application of Day's formula and Gorodetsky's formula for Toeplitz determinants to many determinants-body quantum physics.
arXiv Detail & Related papers (2021-05-27T18:00:00Z) - Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals.
We propose a general graph estimator based on a novel structured fusion regularization.
We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
arXiv Detail & Related papers (2021-03-05T04:42:32Z) - Finite-Function-Encoding Quantum States [52.77024349608834]
We introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions.
We investigate some of their structural properties.
arXiv Detail & Related papers (2020-12-01T13:53:23Z) - A refinement of Reznick's Positivstellensatz with applications to
quantum information theory [72.8349503901712]
In Hilbert's 17th problem Artin showed that any positive definite in several variables can be written as the quotient of two sums of squares.
Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables.
arXiv Detail & Related papers (2019-09-04T11:46:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.