Related papers: Factor system for graphs and combinatorial HHS
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…
A graph-theoretic parameter, in a form of a function, called the extra-factorial sum is discussed. The main results are presented in ref. [1] (Nastou et al., Optim Lett, 10, 1203-1220, 2016) and the reader is strongly advised to study the…
This paper is the first in a series on graphical calculus for quantum vertex operators. We establish in great detail the foundations of graphical calculus for ribbon categories and braided monoidal categories with twist. We illustrate the…
A class of two-dimensional superintegrable systems on a constant curvature surface is considered as the natural generalization of some well known one-dimensional factorized systems. By using standard methods to find the shape-invariant…
We present exponential and super factorial lower bounds on the number of Hamiltonian cycles passing through any edge of the basis graphs of a graphic, generalized Catalan and uniform matroids. All lower bounds were obtained by a common…
The recently proposed QAOA-GPT framework demonstrated that generative pre-trained transformers can learn mappings between problem graphs and optimized quantum circuits for the Quantum Approximate Optimization Algorithm (QAOA). In this work,…
Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…
We propose a quantum Monte Carlo algorithm capable of simulating the Bose-Hubbard model on arbitrary graphs, obviating the need for devising lattice-specific updates for different input graphs. We show that with our method, which is based…
In the standard category of directed graphs, graph morphisms map edges to edges. By allowing graph morphisms to map edges to finite paths (path homomorphisms of graphs), we obtain an ambient category in which we determine subcategories…
Graph theory is important in information theory. We introduce a quantization process on graphs and apply the quantized graphs in quantum information. The quon language provides a mathematical theory to study such quantized graphs in a…
Graph structures are ubiquitous throughout the natural sciences. Here we consider graph-structured quantum data and describe how to carry out its quantum machine learning via quantum neural networks. In particular, we consider training data…
Central to near-term quantum machine learning is the use of hybrid quantum-classical algorithms. This paper develops a formal framework for describing these algorithms in terms of string diagrams: a key step towards integrating these hybrid…
One of the interesting topics in quantum contextuality is the construction for various non-contextual inequalities. By introducing a new structure called hyper-graph, we present a general method, which seems to be analytic and extensible,…
We study computational aspects of repulsive Gibbs point processes, which are probabilistic models of interacting particles in a finite-volume region of space. We introduce an approach for reducing a Gibbs point process to the hard-core…
A deformed differential calculus is developed based on an associative star-product. In two dimensions the Hamiltonian vector fields model the algebra of pseudo-differential operator, as used in the theory of integrable systems. Thus one…
We describe rules to simplify quantum circuits at their boundaries, i.e. at state preparation and measurement. There, any strictly incoherent operation may be pushed into a pre- or post-processing of classical data. The rules can greatly…
In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…
We give elementary applications of quasi-homomorphisms to growth problems in groups. A particular case concerns the number of torsion elements required to factorise a given element in the mapping class group of a surface.
Some of the most interesting quantities associated with a factor graph are its marginals and its partition sum. For factor graphs \emph{without cycles} and moderate message update complexities, the sum-product algorithm (SPA) can be used to…