Related papers: Incorporating non-local anyonic statistics into a …
We study the quantum phase transition between Abelian and non-Abelian phases in an extended Kitaev spin model on the honeycomb lattice, where the periodic boundary condition is applied by placing the lattice on a torus. Our analytical…
The structure of the network can be described by motifs, which are subgraphs that often repeat themselves. In order to understand the structure of network motifs, it is of great importance to study subgraphs from the perspective of…
The two main features of the Aharonov-Bohm effect are the topological dependence of accumulated phase on the winding number around the magnetic fluxon, and non-locality -- local observations at any intermediate point along the trajectories…
We investigate how the topology of attributed graphs influences the distribution of node attributes. This work offers a novel perspective by treating topology and attributes as structurally distinct but interacting components. We introduce…
Topology identification and inference of processes evolving over graphs arise in timely applications involving brain, transportation, financial, power, as well as social and information networks. This chapter provides an overview of graph…
We present multiscale graph-based reduction algorithms for upscaling heterogeneous and anisotropic diffusion problems. The proposed coarsening approaches begin by constructing a partitioning of the computational domain into a set of…
We explore the collective electromagnetic response in atomic clusters of various sizes and geometries. Our aim is to understand, and hence to control, their dielectric response, based on a fully quantum-mechanical description which captures…
Optimal operation of distribution grid resources relies on accurate estimation of its state and topology. Practical estimation of such quantities is complicated by the limited presence of real-time meters. This paper discusses a theoretical…
We consider the graphs involved in the theoretical physics model known as the colored Sachdev-Ye-Kitaev (SYK) model. We study in detail their combinatorial properties at any order in the so-called $1/N$ expansion, and we enumerate these…
Let $G$ be a topological group, let $\phi$ be a continuous endomorphism of $G$ and let $H$ be a closed $\phi$-invariant subgroup of $G$. We study whether the topological entropy is an additive invariant, that is,…
The conventional theory of solids is well suited to describing band structures locally near isolated points in momentum space, but struggles to capture the full, global picture necessary for understanding topological phenomena. In part of a…
Analysis of signals defined on complex topologies modeled by graphs is a topic of increasing interest. Signal decomposition plays a crucial role in the representation and processing of such information, in particular, to process graph…
We investigate one-loop four-point scattering of non-abelian gauge bosons in heterotic string theory and identify new connections with the corresponding open-string amplitude. In the low-energy expansion of the heterotic-string amplitude,…
Hypergraphs provide a powerful framework for modeling complex systems and networks with higher-order interactions beyond simple pairwise relationships. However, graph-based clustering approaches, which focus primarily on pairwise relations,…
Using superconducting quantum circuits, we propose an approach to construct a Kitaev lattice, i.e., an anisotropic spin model on a honeycomb lattice with three types of nearest-neighbor interactions. We study two particular cases to…
We propose a universal decomposition of unitary maps over a tensorial power of C^2, introducing the key concept of "phase maps", and investigate how this decomposition can be used to implement unitary maps directly in the measurement-based…
Characterizing graph properties is fundamental to the analysis and to our understanding of real-world networked systems. The local clustering coefficient, and the more recently introduced, local closure coefficient, capture powerful…
Neighborhood graphs are a critical but often fragile step in spectral clustering of text embeddings. On realistic text datasets, standard $k$-NN graphs can contain many disconnected components at practical sparsity levels (small $k$),…
Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic…
With the advancement in synthesizing and analyzing Kitaev materials, the Kitaev-Heisenberg model on the honeycomb lattice has attracted a lot of attention in the last few years. Several variations, which include additional anisotropic…