Related papers: On the Pauli graphs of N-qudits

Simulating physical systems on near-term quantum computers often requires preparing states within constrained subspaces, like those with fixed particle number or spin. We use Lie algebraic techniques to prove that hardware-efficient gates…

The authors studied in [Ann. Inst. Henri Poincar\'e D 9, 367-433, (2022)], a complex multi-matrix model with $\mathrm{U}(N)^2 \times \mathrm{O}(D)$ symmetry, and whose double scaling limit where simultaneously the large-$N$ and large-$D$…

A central building block of many quantum algorithms is the diagonalization of Pauli operators. Although it is always possible to construct a quantum circuit that simultaneously diagonalizes a given set of commuting Pauli operators, only…

We demonstrate that a quantum graph exhibits a $\mathcal{PT}$-symmetry provided the coefficients in the condition describing the wave function matching at the vertices are circulant matrices; this symmetry is nontrivial if they are not…

We study the commuting graph on elements of odd prime order in finite simple groups. The results are used in a forthcoming paper describing the structure of Bruck loops and Bol loops of exponent 2.

We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…

Decomposing unitary operations into native gates is an essential step for implementing quantum algorithms. For qubit-based devices, where native gates are typically single- and two-qubit operations, a range of decomposition techniques have…

We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Eulerian tours in certain spanning subgraphs of the quartic graph associated with the cubic graph by 1-factor contraction. This correspondence is…

An orbit of $G$ is a subset $S$ of $V(G)$ such that $\phi(u)=v$ for any two vertices $u,v\in S$, where $\phi$ is an isomorphism of $G$. The orbit number of a graph $G$, denoted by $\text{Orb}(G)$, is the number of orbits of $G$. In [A Note…

Fermionic Gaussian operators are foundational tools in quantum many-body theory, numerical simulation of fermionic dynamics, and fermionic linear optics. While their structure is fully determined by two-point correlations, evaluating their…

We generalize a recently discovered example of a private quantum subsystem to find private subsystems for Abelian subgroups of the $n$-qubit Pauli group, which exist in the absence of private subspaces. In doing so, we also connect these…

In this paper a systematic study of unitary asymptotes of commuting $n$-tuples of general Hilbert space operators is initiated. Special emphasis is put on the study of the quasianalicity property.

Intrinsic symmetry of the existing protocols of quantum dialogue are explored. It is shown that if we have a set of mutually orthogonal $n$-qubit states {\normalsize $\{|\phi_{0}>,|\phi_{1}>,....,|\phi_{i}<,...,|\phi_{2^{n}-1}>\}$ and a set…

Let $L$ be a finite-dimensional non-abelian Lie algebra with the center $Z(L)$. In this paper, we define a non-commuting graph associated with $L$ as the graph whose vertex set is the projective space of the quotient algebra $L/Z(L)$, and…

We construct Pauli topological subsystem codes characterized by arbitrary two-dimensional Abelian anyon theories--this includes anyon theories with degenerate braiding relations and those without a gapped boundary to the vacuum. Our work…

We propose a description of T-duality between general geometric and non-geometric backgrounds as higher groupoid bundles with connections. Our description extends the previous observation by Nikolaus and Waldorf that the topological aspects…

Partial cubes are graphs isometrically embeddable into hypercubes. In this paper it is proved that every cubic, vertex-transitive partial cube is isomorphic to one of the following graphs: $K_2 \, \square \, C_{2n}$, for some $n\geq 2$, the…

Interactions and relations between objects may be pairwise or higher-order in nature, and so network-valued data are ubiquitous in the real world. The "space of networks", however, has a complex structure that cannot be adequately described…

We study four-dimensional $\mathcal{N}=2$ supersymmetric $U(N)$ gauge theory with $2N$ fundamental hypermultiplets in the self-dual $\Omega$-background. The partition function simplifies at special points of the parameter space and is…

We study generalized gauge theories engineered by taking the low energy limit of the $Dp$ branes wrapping $X \times T^{p-3}$, with $X$ a possibly singular surface in a Calabi-Yau fourfold $Z$. For toric $Z$ and $X$ the partition function…