Related papers: Two statements on path systems related to quantum …

Common sense suggests that a particle must have a definite origin if its full path information is available. In quantum mechanics, the knowledge of path information is captured through the well-established duality relation between path…

To each totally disconnected, locally compact topological group G and each group A of automorphisms of G, a pseudo-metric space of ``directions'' has been associated by U. Baumgartner and the second author. Given a Lie group G over a local…

A graph G is called "minimalizable" if a diagram with minimal crossing number can be obtained from an arbitrary diagram of G by crossing changes. If, furthermore, the minimal diagram is unique up to crossing changes then G is called…

The path integral on a homogeneous space $ G/H $ is constructed, based on the guiding principle `first lift to $ G $ and then project to $ G/H $'. It is then shown that this principle admits inequivalent quantizations inducing a gauge field…

For a matrix $\mathbf{M} \in \mathbb{K}^{n \times n}$ we establish a condition on the Galois group of the characteristic polynomial $\varphi_\mathbf{M}$ that induces nonvanishing of the minors of the eigenvector matrix of $\mathbf{M}$. For…

Rough path theory is focused on capturing and making precise the interactions between highly oscillatory and non-linear systems. It draws on the analysis of LC Young and the geometric algebra of KT Chen. The concepts and the uniform…

The spectral flow is an integer-valued homotopy invariant for paths of selfadjoint Fredholm operators. Lesch as well as Pejsachowicz, Fitzpatrick and Ciriza independently showed that it is uniquely characterised by its elementary…

A strongly separating path system in a graph $G$ is a collection $\mathcal{P}$ of paths in $G$ such that, for every two edges $e$ and $f$ of $G$, there is a paths in $\mathcal{P}$ with $e$ and not $f$, and vice-versa. The minimum number of…

Matrix product states play an important role in quantum information theory to represent states of many-body systems. They can be seen as low-dimensional subvarieties of a high-dimensional tensor space. In these notes, we consider two…

The variety of principal minors of $n\times n$ symmetric matrices, denoted $Z_{n}$, is invariant under the action of a group $G\subset \GL(2^{n})$ isomorphic to $\G$. We describe an irreducible $G$-module of degree $4$ polynomials…

We propose a quantum walk defined by digraphs (mixed graphs). This is like Grover walk that is perturbed by a certain complex-valued function defined by digraphs. The discriminant of this quantum walk is a matrix that is a certain…

For description of the quantum dynamics on a curved group manifold the path integrals in a space of the group parameters is offered. The formalism is illustrated by the $H$-atom problem.

For a $2$-connected graph $G$ and vertices $u,v$ of $G$ we define an abstract graph $\mathcal{P}(G_{uv})$ whose vertices are the paths joining $u$ and $v$ in $G$, where paths $S$ and $T$ are adjacent if $T$ is obtained from $S$ by replacing…

A minor of a matrix is quasi-principal if it is a principal or an almost-principal minor. The quasi principal rank characteristic sequence (qpr-sequence) of an $n\times n$ symmetric matrix is introduced, which is defined as $q_1 q_2 \cdots…

This paper develops a structural theory of unique shortest paths in real-weighted graphs. Our main goal is to characterize exactly which sets of node sequences, which we call path systems, can be realized as unique shortest paths in a graph…

In contrast to ordinary graphs, the number of the nowhere-zero group-flows in a signed graph may vary with different groups, even if the groups have the same order. In fact, for a signed graph $G$ and non-negative integer $d$, it was shown…

We give a path integral construction of the quantum mechanical partition function for gauged finite groups. Our construction gives the quantization of a system of $d$, $N\times N$ matrices invariant under the adjoint action of the symmetric…

The quantum hidden subgroup approach is an actively studied approach to solve combinatorial problems in quantum complexity theory. With the success of the Shor's algorithm, it was hoped that similar approach may be useful to solve the other…

We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the…

A path in an edge-colored graph is called a proper path if no two adjacent edges of the path receive the same color. For a connected graph $G$, the proper connection number $pc(G)$ of $G$ is defined as the minimum number of colors needed to…