A new quantum computational set-up for algebraic topology via simplicial sets

• URL: http://arxiv.org/abs/2309.11304v3
• Date: Tue, 4 Jun 2024 07:44:18 GMT
• Title: A new quantum computational set-up for algebraic topology via simplicial sets
• Authors: Roberto Zucchini,
• Abstract summary: A quantum computational framework for algebraic topology based on simplicial set theory is presented. The proposed set-up applies to any parafinite simplicial set and proceeds by associating with it a finite dimensional simplicial Hilbert space. A quantum algorithmic scheme capable to compute the simplicial homology spaces and Betti numbers of a simplicial set is outlined.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, a quantum computational framework for algebraic topology based on simplicial set theory is presented. This extends previous work, which was limited to simplicial complexes and aimed mostly to topological data analysis. The proposed set--up applies to any parafinite simplicial set and proceeds by associating with it a finite dimensional simplicial Hilbert space, whose simplicial operator structure is studied in some depth. It is shown in particular how the problem of determining the simplicial set's homology can be solved within the simplicial Hilbert framework. Further, the conditions under which simplicial set theoretic algorithms can be implemented in a quantum computational setting with finite resources are examined. Finally a quantum algorithmic scheme capable to compute the simplicial homology spaces and Betti numbers of a simplicial set combining a number of basic quantum algorithms is outlined.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Twisted simplicial distributions [0.0]
  We leverage the classical theory of simplicial principal bundles, as well as structures on categories of such bundles, to provide powerful computational tools for analyzing twisted distributions. We use these techniques to analyze our key examples: quantum distributions and operator-theoretic polytopes used in the classical simulation of quantum computation.
  arXiv  Detail & Related papers  (2024-03-28T19:43:28Z)
• Quantum walk on simplicial complexes for simplicial community detection [0.0]
  We present a quantum walk algorithm to detect higher-order community structures called simplicial communities. The potential of our quantum algorithm is tested on Zachary's karate club network.
  arXiv  Detail & Related papers  (2024-01-01T08:43:43Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Higher-order topological kernels via quantum computation [68.8204255655161]
  Topological data analysis (TDA) has emerged as a powerful tool for extracting meaningful insights from complex data. We propose a quantum approach to defining Betti kernels, which is based on constructing Betti curves with increasing order.
  arXiv  Detail & Related papers  (2023-07-14T14:48:52Z)
• Constrained mixers for the quantum approximate optimization algorithm [55.41644538483948]
  We present a framework for constructing mixing operators that restrict the evolution to a subspace of the full Hilbert space. We generalize the "XY"-mixer designed to preserve the subspace of "one-hot" states to the general case of subspaces given by a number of computational basis states. Our analysis also leads to valid Trotterizations for "XY"-mixer with fewer CX gates than is known to date.
  arXiv  Detail & Related papers  (2022-03-11T17:19:26Z)
• Bounds on quantum evolution complexity via lattice cryptography [0.0]
  We address the difference between integrable and chaotic motion in quantum theory as manifested by the complexity of the corresponding evolution operators. Complexity is understood here as the shortest geodesic distance between the time-dependent evolution operator and the origin within the group of unitaries.
  arXiv  Detail & Related papers  (2022-02-28T16:20:10Z)
• Simplicial Quantum Gravity [0.0]
  A four-dimensional simplicial geometry is made up of flat four-simplices joined together. A sum over simplicial geometries is a sum over thedifferent ways the simplices can be joined together with an integral over their edge lengths.
  arXiv  Detail & Related papers  (2022-01-01T18:20:07Z)
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms [55.41644538483948]
  In particular, some steps of the implementation, as state preparation and readout processes, can surpass the complexity aspects of the algorithm itself. We present the complexity involved in the full implementation of quantum algorithms for solving linear systems of equations and linear system of differential equations.
  arXiv  Detail & Related papers  (2021-06-23T16:33:33Z)
• Search for Efficient Formulations for Hamiltonian Simulation of non-Abelian Lattice Gauge Theories [0.0]
  Hamiltonian formulation of lattice gauge theories (LGTs) is the most natural framework for the purpose of quantum simulation. It remains an important task to identify the most accurate, while computationally economic, Hamiltonian formulation(s) in such theories. This paper is a first step toward addressing this question in the case of non-Abelian LGTs.
  arXiv  Detail & Related papers  (2020-09-24T16:44:39Z)
• 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.