Related papers: A new quantum computational set-up for algebraic t…
The basic methods of constructing the sets of mutually unbiased bases in the Hilbert space of an arbitrary finite dimension are discussed and an emerging link between them is outlined. It is shown that these methods employ a wide range of…
Symmetry algebras of quantum many-body systems with locality can be understood using commutant algebras, which are defined as algebras of operators that commute with a given set of local operators. In this work, we show that these symmetry…
We study conformal field theories (CFTs) and their classifications from a modern perspective based on the abstract algebraic formalism of symmetries or conserved charges, known as symmetry topological field theories (SymTFTs). By studying…
We consider the topology of simplicial complexes with vertices the points of a random point process and faces determined by distance relationships between the vertices. In particular, we study the Betti numbers of these complexes as the…
We prove that for any $\ell \geq 0$, there exists an algorithm which takes as input a description of a semi-algebraic subset $S \subset \mathbb{R}^k$ given by a quantifier-free first order formula $\phi$ in the language of the reals, and…
Solutions of generic $SU(2)\otimes SU(2)$ Hamiltonian eigensystems are obtained through systematic manipulations of quartic polynomial equations. An {\em ansatz} for constructing separable and entangled eigenstate basis, depending on the…
We present a basis-set-free approach to the variational quantum eigensolver using an adaptive representation of the spatial part of molecular wavefunctions. Our approach directly determines system-specific representations of qubit…
The symmetric homology of a unital algebra $A$ over a commutative ground ring $k$ is defined using derived functors and the symmetric bar construction of Fiedorowicz. For a group ring $A = k[\Gamma]$, the symmetric homology is related to…
In this paper, we study simplicial commutative algebras with finite Andr\'e-Quillen homology. Here we restrict our focus to simplicial algebras having characteristic 2. Our aim is to find a generalization of results established by the…
According to the pioneering work of Nielsen and collaborators, the length of the minimal geodesic in a geometric realization of a suitable operator space provides a measure of the quantum complexity of an operation. Compared with the…
Using the notion of contiguity of simplicial maps, we adapt Farber's topological complexity to the realm of simplicial complexes. We show that, for a finite simplicial complex $K$, our discretized concept recovers the topological complexity…
The coalgebra approach to the construction of classical integrable systems from Poisson coalgebras is reviewed, and the essential role played by symplectic realizations in this framework is emphasized. Many examples of Hamiltonians with…
In this PhD thesis, we give a new geometric approach to higher Teichm\"uller theory. In particular we construct a geometric structure on surfaces, generalizing the complex structure, and we explore its link to Hitchin components. The…
We explore in the framework of Quantum Computation the notion of {\em Computability}, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm for Hilbert's tenth problem, which is equivalent to…
The paper surveys some new results and open problems connected with such fundamental combinatorial concepts as polytopes, simplicial complexes, cubical complexes, and subspace arrangements. Particular attention is paid to the case of…
Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed…
Linear-Optical Passive (LOP) devices and photon counters are sufficient to implement universal quantum computation with single photons, and particular schemes have already been proposed. In this paper we discuss the link between the…
We present an efficient quantum algorithm for some independent set problems in graph theory, based on non-abelian adiabatic mixing. We illustrate the performance of our algorithm with analysis and numerical calculations for two different…
We study equivariant localization formulas for phase space path integrals when the phase space is a multiply connected compact Riemann surface. We consider the Hamiltonian systems to which the localization formulas are applicable and show…
Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using…