Related papers: On the Pauli graphs of N-qudits
A class of unital qubit maps displaying diagonal unitary and orthogonal symmetries is analyzed. Such maps already found a lot applications in quantum information theory. We provide a complete characterization of this class of maps showing…
Heisenberg-Weyl operators provide a Hermitian generalization of Pauli operators in higher dimensions. Positive maps arising from Heisenberg-Weyl operators have been studied along with several algebraic and spectral properties of…
The group of matrices $P_1$ of Pauli is a finite 2-group of order 16 and plays a fundamental role in quantum information theory, since it is related to the quantum information on the 1-qubit. Here we show that both $P_1$ and the Pauli…
A two-dimensional Pauli Hamiltonian describing the interaction of a neutral spin-1/2 particle with a magnetic field having axial and second order symmetries, is considered. After separation of variables, the one-dimensional matrix…
In the paper (math-ph/0504049) Jarlskog gave an interesting simple parametrization to unitary matrices, which was essentially the canonical coordinate of the second kind in the Lie group theory (math-ph/0505047). In this paper we apply the…
Let consider the Pauli group $\mathcal{P}_q=<X,Z>$ with unitary quantum generators $X$ (shift) and $Z$ (clock) acting on the vectors of the $q$-dimensional Hilbert space via $X|s> =|s+1>$ and $Z|s> =\omega^s |s>$, with…
Analysis of quantum processes, especially in the context of noise, errors, and decoherence is essential for the improvement of quantum devices. An intuitive representation of those processes modeled by quantum channels are Pauli transfer…
The Pauli matrices are a set of three 2x2 complex Hermitian, unitary matrices. In this article, we investigate the relationships between certain roots of the Pauli matrices and how gates implementing those roots are used in quantum…
Graph states and their entanglement properties are pivotal for the development of quantum computing and technologies. For qubits, local complementation, a graphical rule that connects all the equivalent states under Local Clifford (LC)…
A variety of quantum algorithms employ Pauli operators as a convenient basis for studying the spectrum or evolution of Hamiltonians or measuring multi-body observables. One strategy to reduce circuit depth in such algorithms involves…
We study unfrustrated spin Hamiltonians that consist of commuting tensor products of Pauli matrices. Assuming translation-invariance, a family of Hamiltonians that belong to the same phase of matter is described by a map between modules…
We consider arbitrary embeddings of surface operators in a pure, non-supersymmetric abelian gauge theory on spin (non-spin) four-manifolds. For any surface operator with a priori simultaneously non-vanishing parameters, we explicitly show…
We study quantized dual graded graphs, which are graphs equipped with linear operators satisfying the relation DU - qUD = rI. We construct examples based upon: the Fibonacci poset, permutations, standard Young tableau, and plane binary…
Quantum walks in general graphs, or more specifically scattering on graphs, encompass enough complexity to perform universal quantum computation. Any given quantum circuit can be broken down into single- and two-qubit gates, which can then…
This paper investigates continuous-time quantum walks on directed bipartite graphs based on a graph's adjacency matrix. We prove that on bipartite graphs, probability transport between the two node partitions can be completely suppressed by…
Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain…
The completely positive maps, a generalization of the nonnegative matrices, are a well-studied class of maps from $n\times n$ matrices to $m\times m$ matrices. The existence of the operator analogues of doubly stochastic scalings of…
We study geometric presentations of braid groups for particles that are constrained to move on a graph, i.e. a network consisting of nodes and edges. Our proposed set of generators consists of exchanges of pairs of particles on junctions of…
Parametrized and random unitary (or orthogonal) $n$-qubit circuits play a central role in quantum information. As such, one could naturally assume that circuits implementing symplectic transformations would attract similar attention.…
In the present paper we show that it is possible to obtain the well known Pauli group $P=\langle X,Y,Z \ | \ X^2=Y^2=Z^2=1, (YZ)^4=(ZX)^4=(XY)^4=1 \rangle $ of order $16$ as an appropriate quotient group of two distinct spaces of orbits of…