Related papers: Local complementation rule for continuous-variable…
A \emph{self-complementary} graph is a graph isomorphic to its complement. An isomorphism between $G$ and its complement, viewed as a permutation of $V(G)$, is then called an \emph{antimorphism}. A \emph{skew partition} of $G$ is a…
Local complement is a graph operation formalized by Bouchet which replaces the neighborhood of a chosen vertex with its edge-complement. This operation induces an equivalence relation on graphs; determining the size of the resulting…
We introduce topological invariants for gapless systems and study the associated boundary phenomena. More generally, the symmetry properties of the low-energy conformal field theory (CFT) provide discrete invariants, establishing the notion…
This thesis develops a theoretical framework for hybrid continuous-variable (CV) and discrete-variable (DV) quantum systems, with emphasis on quantum control, state preparation, and error correction. A central contribution is non-abelian…
We investigate the equivalence of quantum mixed states under local unitary transformations. For a class of rank-two mixed states, a sufficient and necessary condition of local equivalence is obtained by giving a complete set of invariants…
Graph states are a key resource for measurement-based quantum computation and quantum networking, but state-preparation costs limit their practical use. Graph states related by local complement (LC) operations are equivalent up to…
We investigate the non-perturbative regimes in the class of non-Abelian theories that have been proposed as an ultraviolet completion 4-D Quantum Field Theory (QFT) generalizing the kinetic energy operators to an infinite series of…
Hypergraph states are a special kind of multipartite states encoded by hypergraphs. They play a significant role in quantum error correction, measurement--based quantum computation, quantum non locality and entanglement. In a series of two…
We define notions of local topological convergence and local geometric convergence for embedded graphs in $\mathbb{R}^n,$ and study their properties. The former is related to Benjamini-Schramm convergence, and the latter to weak convergence…
A new algorithm based on bayesian inference for learning local graph conductance based on Gaussian Process(GP) is given that uses advanced MCMC convergence ideas to create a scalable and fast algorithm for convergence to stationary…
The paper introduces a general method to construct conformal measures for a local homeomorphism on a locally compact non-compact Hausdorff space, subject to mild irreducibility-like conditions. Among others the method is used to give…
We explore absolutely maximal entanglement (AME) and k-uniformity in continuous-variable (CV) quantum systems, and show that-unlike in qudit systems-such entanglement is readily realizable in both Gaussian and non-Gaussian quantum states of…
Let $\Gamma$ be a finite connected $G$-vertex-transitive graph and let $v$ be a vertex of $\Gamma$. If the permutation group induced by the action of the vertex-stabiliser $G_v$ on the neighbourhood $\Gamma(v)$ is permutation isomorphic to…
A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a subgroup of ${\rm Aut}(G)$. Regular…
Building upon our previous work, on graphical representation of a quantum state by signless Laplacian matrix, we pose the following question. If a local unitary operation is applied to a quantum state, represented by a signless Laplacian…
We investigate permutation-invariant continuous variable quantum states and their covariance matrices. We provide a complete characterization of the latter with respect to permutation-invariance, exchangeability and representing convex…
Vector quantization(VQ) is a lossy data compression technique from signal processing, which is restricted to feature vectors and therefore inapplicable for combinatorial structures. This contribution presents a theoretical foundation of…
Locally triangular graphs are known to be halved graphs of bipartite rectagraphs, which are connected triangle-free graphs in which every $2$-arc lies in a unique quadrangle. A graph $\Gamma$ is locally rank 3 if there exists $G\leq…
This paper introduces the foliage partition, an easy-to-compute LC-invariant for graph states, of computational complexity $\mathcal{O}(n^3)$ in the number of qubits. Inspired by the foliage of a graph, our invariant has a natural graphical…
Quantum stabilizer states over GF(m) can be represented as self-dual additive codes over GF(m^2). These codes can be represented as weighted graphs, and orbits of graphs under the generalized local complementation operation correspond to…