Related papers: Some examples of quantum graphs
With an arbitrary finite graph having a special form of 2-intervals (a diamond-shaped graph) we associate a subgroup of a symmetric group and a representation of this subgroup; state a series of problems on such groups and their…
Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…
We study multi-qubit variational quantum states that can be considered as vertex- and edge-weighted graph. These states are constructed as single-layer variational circuits with $RX$ rotations and $RZZ$ entangling gates, corresponding to…
A recent notion in theoretical physics is that not all quantum theories arise from quantising a classical system. Also, a given quantum model may possess more than just one classical limit. These facts find strong evidence in string duality…
We develop the noncommutative geometry (bundles, connections etc.) associated to algebras that factorise into two subalgebras. An example is the factorisation of matrices $M_2(\C)=\C\Z_2\cdot\C\Z_2$. We also further extend the coalgebra…
The physical interpretation of the main notions of the quantum group theory (coproduct, representations and corepresentations, action and coaction) is discussed using the simplest examples of $q$-deformed objects (quantum group…
The algebraic formulation of the quantum group gauge models in the framework of the $R$-matrix approach to the theory of quantum groups is given. We consider gauge groups taking values in the quantum groups and noncommutative gauge fields…
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 introduce a new approach to confusability in a quantum channel, namely quantum confusability multigraph, which incorporates the output information into the graphical structure. By``counting" the edges between two vertices of this…
We give a pedagogical introduction to the differential calculus on quantum groups by stressing at all stages the connection with the classical case ($q \rightarrow 1$ limit). The Lie derivative and the contraction operator on forms and…
Let $n >3$ and $ 0< k < \frac{n}{2} $ be integers. In this paper, we investigate some algebraic properties of the line graph of the graph $ {Q_n}(k,k+1) $ where $ {Q_n}(k,k+1) $ is the subgraph of the hypercube $Q_n$ which is induced by the…
We introduce shortcut graphs and groups. Shortcut graphs are graphs in which cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly…
A theory of canonical basis for a two-parameter quantum algebra is developed in parallel with the one in one-parameter case. A geometric construction of the negative part of a two-parameter quantum algebra is given by using mixed perverse…
A theory of principal bundles possessing quantum structure groups and classical base manifolds is presented. Structural analysis of such quantum principal bundles is performed. A differential calculus is constructed, combining differential…
The connection between certain entangled states and graphs has been heavily studied in the context of measurement-based quantum computation as a tool for understanding entanglement. Here we show that this correspondence can be harnessed in…
We provide formulas for invariants defined on a tensor product of defining representations of unitary groups, under the action of the product group. This situation has a physical interpretation, as it is related to the quantum mechanical…
We offer a new structural basis for the theory of 3-connected graphs, providing a unique decomposition of every such graph into parts that are either quasi 4-connected, wheels, or thickened $K_{3,m}$'s. Our construction is explicit,…
We propose a novel method using a quantum annealer -- an analog quantum computer based on the principles of quantum adiabatic evolution -- to solve the Graph Isomorphism problem, in which one has to determine whether two graphs are…
Using a quantum processor to embed and process classical data enables the generation of correlations between variables that are inefficient to represent through classical computation. A fundamental question is whether these correlations…
The quantum N-dimensional orthogonal vector Cayley-Klein spaces with different combinations of quantum structure and Cayley-Klein scheme of contractions and analytical continuations are described for multipliers, which include the first and…