Related papers: Quantum graphs: different perspectives, homomorphi…
Gauge theories are important descriptions for many physical phenomena and systems in quantum computation. Automorphism of gauge group naturally gives global symmetries of gauge theories. In this work we study such symmetries in gauge…
The quantum mechanical formalism doesn't support our intuition, nor does it elucidate the key concepts that govern the behaviour of the entities that are subject to the laws of quantum physics. The arrays of complex numbers are kin to the…
Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…
We introduce some equivalent notions of homomorphisms between quantum groups that behave well with respect to duality of quantum groups. Our equivalent definitions are based on bicharacters, coactions, and universal quantum groups,…
Looking for a quantum-mechanical implementation of duality, we formulate a relation between coherent states and complex-differentiable structures on classical phase space ${\cal C}$. A necessary and sufficient condition for the existence of…
We introduce quantum tomography on locally compact Abelian groups $G$. A linear map from the set of quantum states on the $C^*$-algebra $A(G)$ generated by the projective unitary representation of $G$ to the space of characteristic…
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. Hitting times for discrete quantum walks on graphs give an average time before the walk…
Quantum theory can be regarded as a non-commutative generalization of classical probability. From this point of view, one expects quantum dynamics to be analogous to classical conditional probabilities. In this paper, a variant of the…
The paradigm of measurement-based quantum computing (MBQC) starts from a highly entangled resource state on which unitary operations are executed through adaptive measurements and corrections ensuring determinism. This is set in contrast to…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
We introduce the coherent algebra of a compact metric measure space by analogy with the corresponding concept for a finite graph. As an application we show that upon topologizing the collection of isomorphism classes of compact metric…
We address the study of controllability of a closed quantum system whose dynamical Lie algebra is generated by adjacency matrices of graphs. We characterize a large family of graphs that renders a system controllable. The key property is a…
Given the extensive application of classical random walks to classical algorithms in a variety of fields, their quantum analogue in quantum walks is expected to provide a fruitful source of quantum algorithms. So far, however, such…
The notion of simple compact quantum group is introduced. As non-trivial (noncommutative and noncocommutative) examples, the following families of compact quantum groups are shown to be simple: (a) The universal quantum groups $B_u(Q)$ for…
We show that non-abelian quantum statistics can be studied using certain topological invariants which are the homology groups of configuration spaces. In particular, we formulate a general framework for describing quantum statistics of…
An automorphism of a graph is called quasi-semiregular if it fixes a unique vertex of the graph and its remaining cycles have the same length. This kind of symmetry of graphs was first investigated by Kutnar, Malni\v{c}, Mart\'{i}nez and…
A chain of quantum subgroups of the quantum automorphism group of finite graphs has been introduced. It generalizes the construction of J. Bichon (see [3]) in a sense. A better bound of the non zero eigenvalues of the graph Laplacian has…
We quantize the regularity properties of classical graphs that determine spin models for singly-generated Yang-Baxter planar algebras, including the Kauffman polynomial, and construct explicit examples. A source of examples comes from…
On a conformal net $\mathcal{A}$, one can consider collections of unital completely positive maps on each local algebra $\mathcal{A}(I)$, subject to natural compatibility, vacuum preserving and conformal covariance conditions. We call…
A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…