Related papers: Explicit, analytical solution of scaling quantum g…
We establish a connection between measurement-based quantum computation and the field of mathematical logic. We show that the computational power of an important class of quantum states called graph states, representing resources for…
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…
We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…
The explainability of deep networks is becoming a central issue in the deep learning community. It is the same for learning on graphs, a data structure present in many real world problems. In this paper, we propose a method that is more…
We consider the dynamics of relativistic spin-half particles in quantum graphs with transparent branching points. The system is modeled by combining the quantum graph concept with the one of transparent boundary conditions applied to the…
A new proof is given of the fact that the particle trajectories of the ideal incompressible fluid are analytic curves, though the solutions of the Euler equations may have a finite regularity. This is a consequence of a general fact that…
Theoretical research into many-body quantum systems has mostly focused on regular structures which have a small, simple unit cell and where a vanishingly small number of pairs of the constituents directly interact. Motivated by advances in…
Graph rewriting is a popular tool for the optimisation and modification of graph expressions in domains such as compilers, machine learning and quantum computing. The underlying data structures are often port graphs - graphs with labels at…
We derive a formula for the level spacing probability distribution in quantum graphs. We apply it to simple examples and we discuss its relation with previous work and its possible application in more general cases. Moreover, we derive an…
Recently, Braunstein et al. [1] introduced normalized Laplacian matrices of graphs as density matrices in quantum mechanics and studied the relationships between quantum physical properties and graph theoretical properties of the underlying…
Unsplittable flow problems cover a wide range of telecommunication and transportation problems and their efficient resolution is key to a number of applications. In this work, we study algorithms that can scale up to large graphs and…
We investigate the limitations of quantum computers for solving nonlinear dynamical systems. In particular, we tighten the worst-case bounds of the quantum Carleman linearisation (QCL) algorithm [Liu et al., PNAS 118, 2021] answering one of…
The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…
Continuous time quantum walks on exponentially large, sparse graphs form a powerful paradigm for quantum computing: On the one hand, they can be efficiently simulated on a quantum computer. On the other hand, they are themselves…
We derive the black hole solutions with horizons of non-trivial topology and investigate their properties in the framework of an approach to quantum gravity being an extension of Bohm's formulation of quantum mechanics. The solutions we…
Algebro-geometric methods have proven to be very successful in the study of graphical models in statistics. In this paper we introduce the foundations to carry out a similar study of their quantum counterparts. These quantum graphical…
A {\em solvable} cover of a graph is a regular cover whose covering transformation group is solvable. In this paper, we show that a solvable cover of a graph can be decomposed into layers of abelian covers, and also, a lift of a given…
We present an infinite sequence of finite graphs with trivial automorphism group and non-trivial quantum automorphism group. These are the first known examples of graphs with this property. Moreover, to the best of our knowledge, these are…