Related papers: Complete Graphical Language for Hermiticity-Preser…
The notion of Wheeler languages is rooted in the Burrows-Wheeler transform (BWT), one of the most central concepts in data compression and indexing. The BWT has been generalized to finite automata, the so-called Wheeler automata, by Gagie…
There are various gate sets used for describing quantum computation. A particularly popular one consists of Clifford gates and arbitrary single-qubit phase gates. Computations in this gate set can be elegantly described by the ZX-calculus,…
We develop two approaches to Quantum (or Non-commutative) Graphs based on arbitrary von Neumann algebras $M\subseteq\mathcal B(H)$: one looking at operator bimodules of Hilbert--Schmidt (instead of bounded) operators, and the second looking…
In the context of the factorization method, we investigate the pseudo- Hermitian coherent states and its Hermitian counterpart coherent states under the generalized quantum condition in the framework of a position-dependent mass. By…
Quantum Mechanics and Signal Processing in the line R, are strictly related to Fourier Transform and Weyl-Heisenberg algebra. We discuss here the addition of a new discrete variable that measures the degree of the Hermite functions and…
In this short note we formulate a stabilizer formalism in the language of noncommutative graphs. The classes of noncommutative graphs we consider are obtained via unitary representations of compact groups, and suitably chosen operators on…
This is a motivating tutorial introduction to a semantic analysis of programming languages using a graphical language as the representation of terms, and graph rewriting as a representation of reduction rules. We show how the graphical…
A quasi-Hermitian operator is an operator that is similar to its adjoint in some sense, via a metric operator, i.e., a strictly positive self-adjoint operator. Whereas those metric operators are in general assumed to be bounded, we analyze…
For a diagonalizable linear operator $H:\mathscr{H}\to\mathscr{H}$ acting in a separable Hilbert space $\mathscr{H}$, i.e., an operator with a purely point spectrum, eigenvalues with finite algebraic multiplicities, and a set of…
We examine a variant of hypergraphs that we call interfaced linear hypergraphs, with the aim of creating a sound and complete graphical language for symmetric traced monoidal categories (STMCs) suitable for graph rewriting. In particular,…
A quantum holonomy reflects the curvature of some underlying structure of quantum mechanical systems, such as that associated with quantum states. Here, we extend the notion of holonomy to families of quantum channels, i.e., trace…
We study the Poisson geometrical formulation of quantum mechanics for finite dimensional mixed and pure states. Equivalently, we show that quantum mechanics can be understood in the language of classical mechanics. We review the symplectic…
Geometric (Clifford) algebra provides an efficient mathematical language for describing physical problems. We formulate general relativity in this language. The resulting formalism combines the efficiency of differential forms with the…
Quantum covariant Hamiltonian system theory provides a coherent framework for modelling the complex dynamics of quantum systems. In this paper, we centrally deal with the Hermiticity of quantum operators that directly links to the physical…
PT-symmetric quantum mechanics is an alternative formulation of quantum mechanics in which the mathematical axiom of Hermiticity (transpose and complex conjugate) is replaced by the physically transparent condition of space-time reflection…
A review is given on the foundations and applications of non-Hermitian classical and quantum physics. First, key theorems and central concepts in non-Hermitian linear algebra, including Jordan normal form, biorthogonality, exceptional…
The stabilizer ZX-calculus is a rigorous graphical language for reasoning about quantum mechanics. The language is sound and complete: one can transform a stabilizer ZX-diagram into another one using the graphical rewrite rules if and only…
Structured canonical forms under unitary and suitable structure-preserving similarity transformations for normal and (skew-)Hamiltonian as well as normal and per(skew)-Hermitian matrices are proposed. Moreover, an algorithm for computing…
The ZX-calculus is a graphical calculus for reasoning about quantum systems and processes. It is known to be universal for pure state qubit quantum mechanics, meaning any pure state, unitary operation and post-selected pure projective…
Diagrammatic techniques for reasoning about monoidal categories provide an intuitive understanding of the symmetries and connections of interacting computational processes. In the context of categorical quantum mechanics, Coecke and…