Related papers: Stateless Quantum Structures and Extremal Graph Th…
The vortex structures and formations of the few-electron states in quantum dots without the Zeeman splitting are investigated. With spin degree of freedom, it is noticed that both the choices of probe electron and the ways to fix the other…
We study the noncommutative geometrical structures of quantum entangled states. We show that the space of a pure entangled state is a noncommutative space. In particular we show that by rewritten the conifold or the Segre variety we can get…
The Local Structure Theorem (LST) for Graph Minors roughly states that for every $H$-minor-free graph $G$ that contains a sufficiently large wall $W$, there is a small vertex subset $A,$ whose removal yields a graph that admits an "almost…
Many applications, ranging from natural to social sciences, rely on graphlet analysis for the intuitive and meaningful characterization of networks employing micro-level structures as building blocks. However, it has not been thoroughly…
Graph states are a class of multi-partite entangled quantum states that are ubiquitous in quantum information. We study equivalence relations between graph states under local unitaries (LU) to obtain distinguishing methods both in local and…
Deciding if a given family of quantum states is topologically ordered is an important but nontrivial problem in condensed matter physics and quantum information theory. We derive necessary and sufficient conditions for a family of graph…
We construct a space of quantum states and an algebra of quantum observables, over the set of all metrics of arbitrary but fixed signature, defined on a manifold. The construction is diffeomorphism invariant, and unique up to natural…
Given an undirected, weighted graph, with $n$ vertices and $m$ edges, and two special vertices $s$ and $t$, the problem is to find the shortest path between them. We give two bounded-error quantum algorithms with improved runtime in the…
This thesis explores the use of entangled states in quantum computation and quantum information science. Entanglement, a quantum phenomenon with no classical counterpart, has been identified as an important and quantifiable resource in many…
Since the experimental realization of synthetic gauge fields for neutral atoms, the simulation of topologically non-trivial phases of matter with ultracold atoms has become a major focus of cold atom experiments. However, several obvious…
We study the number of connected graphs with $n$ vertices that cannot be written as the cartesian product of two graphs with fewer vertices. We give an upper bound which implies that for large $n$ almost all graphs are both connected and…
For every positive integer $t$ we construct a finite family of triple systems ${\mathcal M}_t$, determine its Tur\'{a}n number, and show that there are $t$ extremal ${\mathcal M}_t$-free configurations that are far from each other in…
Hypergraph states are a special kind of multipartite states encoded by hypergraphs relevant in quantum error correction, measurement--based quantum computation, quantum non locality and entanglement. In a series of two papers, we introduce…
We describe a simple lattice model of higher-curvature quantum gravity in two dimensions and study the phase structure of the theory as a function of the curvature coupling. It is shown that the ensemble of flat graphs is entropically…
We provide formulas for invariants defined on a tensor product of defining representations of unitary groups, under the action of the product group. This situation has a physical interpretation, as it is related to the quantum mechanical…
In this paper, we propose a new way to represent graphs in quantum space. In that approach, we replace the rows of the adjacency matrix of the graph by state vectors in the occupation number representation. Unlike the traditional definition…
A vertex whose removal in a graph $G$ increases the number of components of $G$ is called a cut vertex. For all $n,c$, we determine the maximum number of connected induced subgraphs in a connected graph with order $n$ and $c$ cut vertices,…
We are presented with a graph, $G$, on $n$ vertices with $m$ edges whose edge set is unknown. Our goal is to learn the edges of $G$ with as few queries to an oracle as possible. When we submit a set $S$ of vertices to the oracle, it tells…
Quantum symmetry of a graph $C^{*}$-algebra $C^{*}(\Gamma)$ corresponding to a finite graph $\Gamma$ has been explored by several mathematicians within different categories in the past few years. In this article, we establish that there are…
The holographic entropy cone (HEC) is a polyhedral cone first introduced in the study of a class of quantum entropy inequalities. It admits a graph-theoretic description in terms of minimum cuts in weighted graphs, a characterization which…